Journal of Logic and Computation, Volume 10, Issue 1, pp. 43-73: Abstract.
MC Henson1 and S Reeves2
1Department of Computer Sciences, University of Essex, Wivenhoe Park, Colchester, Essex CO4 3SQ, UK, E-mail: firstname.lastname@example.org, 2Department of Computer Science, University of Waikato, Private Bag 3105, Hamilton, New Zealand, E-mail: email@example.com
In this paper we introduce and investigate an improved kernel logic ZC for the specification language Z. Unlike standard accounts, this logic is consistent and is easily shown to be sound. We show how a complete schema calculus can be derived within this logic and in doing so we reveal a high degree of logical organizations within the language. Finally, our approach eschews all non-standard concepts introduced in the standard approach, notably object level notions of substitution and entities which share properties both of constants and variables. We show, in addition, that these unusual notions are derivable in ZC and are, therefore, unnecessary innovations.
Keywords: Specification language Z, logic and semantics of specifications languages.