The Standard Logic of Z is Inconsistent (1998)
| Venue: | Formal Aspects of Computing Journal |
| Citations: | 5 - 3 self |
BibTeX
@ARTICLE{Henson98thestandard,
author = {Martin C. Henson},
title = {The Standard Logic of Z is Inconsistent},
journal = {Formal Aspects of Computing Journal},
year = {1998},
volume = {10},
pages = {243--247}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We demonstrate the logic contained in the draft Z standard is inconsistent. 1. Introduction The specification language Z has been very widely used and commended, but it has not yet received the kind of mathematical attention one would hope for a formal method. Despite more than a decade of effort, the standard source for the formalisation of Z [Nic95] still contains many unclarities and incompletenesses. Worse, as this short note demonstrates, the proposed logic it contains is inconsistent. 2. The inconsistency proof Firstly, the rule (BindSel) enables us to obtain the usual closure axiom for bindings. Suppose the alphabet set of b is f\Delta \Delta \Delta l i \Delta \Delta \Deltag. Then we have: \Delta \Delta \Delta b:l i = b:l i \Delta \Delta \Delta \Delta \Delta \Delta b:l i = b:l i \Delta \Delta \Delta b = hj \Delta \Delta \Delta l i V b:l i \Delta \Delta \Delta ji Secondly, we may use this closure axiom to obtain more natural equality congruence rules for binding projecti...
Citations
No citations identified.
