Journal article

Relating Z and first-order logic

Abstract:: 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.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Martin, A. (2000). Relating Z and first-order logic. Formal Aspects of Computing, 12(3), 199–209.

MLA Style

Martin, A. “Relating Z and First-Order Logic.” Formal Aspects of Computing, vol. 12, no. 3, 2000, pp. 199–209.

Chicago Style

Martin, A. 2000. “Relating Z and First-Order Logic.” Formal Aspects of Computing 12 (3): 199–209.
Print

Access Document

Publisher copy:: 10.1007/s001650070029

Authors

+ Martin, A More by this author

Role:: Author

Journal:: Formal Aspects of Computing More from this journal
Volume:: 12
Issue:: 3
Pages:: 199-209
Publication date:: 2000-01-01
DOI:: 10.1007/s001650070029
EISSN:: 1433-299X
ISSN:: 0934-5043

Language:: English
Keywords:: Models

Tools

Z notation

Schemas

Logics

Undefinedness

Theorem proving
Pubs id:: pubs:278605
UUID:: uuid:f1975911-a6f6-4aaf-be96-75642ac6e27d
Local pid:: pubs:278605
Source identifiers:: 278605
Deposit date:: 2012-12-19
ARK identifier:: ark:/29072/ora_f1975911a6f64aafbe9675642ac6e27d

Terms of use

Copyright date:: 2000

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP