Summary
In “A Logic Covering Undefinedness in Program Proofs” [1], Barringer, Cheng and Jones present a 3-valued logic designed for Program-Verification and Computer Science applications in general. In this paper we want to add some the oretical background to their arguments for the need for such a system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barringer, H., Cheng, J.H., Jones, C.B.: A logic Covering Undefinedness in Program Proofs. Acta Inf. 21:251–269 (1984)
Hermes, H.: Introduction to mathematical Logic. Berlin Heidelberg New York: Springer 1973
Hoogewijs, A.: A Calculus of Partially Defined Predicates. Mathematical Scripts. Rijksuniversiteit Gent, 56p (1977)
Hoogewijs, A.: On a formalization of the non-definedness notion. Z. Math. Logic Grundlagen Math. 25:213–217 (1979)
Hoogewijs, A.: A partial-predicate calculus in a two-valued logic. Z. Math. Logic Grundlagen Math. 29:239–249 (1983)
Koletsos, G.: Sequent Calculus and Partial Logic. M.Sc. Thesis, Manchester University 1976
Prawitz, D.: Natural Deduction. Stockholm: Almgrist and Wiksell 1965
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hoogewijs, A. Partial-predicate logic in computer science. Acta Informatica 24, 381–393 (1987). https://doi.org/10.1007/BF00292109
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00292109