Skip to main content
Conference ProceedingsOPEN ACCESS

Relating Z and first-order logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1709 1266-1280
DOI: 10.1007/3-540-48118-4_17
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Martin, A. (1999). Relating Z and first-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1709, pp. 1266–1280). Springer Verlag. https://doi.org/10.1007/3-540-48118-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free