A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Relating Z and First-Order Logic
2000
Formal Aspects of Computing
Despite being widely regarded as a gloss on first-order logic and set theory, Z has not been found to be very supportive of proof. This paper attempts to distinguish between the different philosophies of proof in Z. It discusses some of the issues which must be addressed in creating a proof technology for Z, namely schemas, undefinedness, and what kind of logic to use. Paper written at the University of Southampton.
doi:10.1007/s001650070029
fatcat:hxq6mgf52jf3ziw2wxn44ffxtu