Abstract
Partial functions play an important role in computer science. In order to reason about partial functions one may extend classical logic to a logic supporting partial functions, a so-called partial logic. Usually such an extension necessitates side-conditions on classical proof rules in order to ensure consistency, and introduces non-classical proof rules in order to maintain completeness. These complications depend on the choice of consequence relation and non-monotonic operators. In computer science applications such complications are undesirable, because they affect (semi-) mechanical reasoning methods, and make manual reasoning difficult for computer scientists who are not logicians.
By carefully choosing the consequence relation and non-monotonic operators, a simple calculus for partial functions arises. The resulting logic is “healthy” in the sense that “meaningless” formulas (such as top(emptystack) > 1) cannot be concluded, except from contradictory or false assumptions, and a meaningless assumption provides no information. This requires all axioms to be healthy; and as a consequence the “excluded middle” (a V ¬a) must be weakened (to meaningfula's). All the well-known classical rules preserve healthiness and are therefore sound in the logic, provided substitutions are restricted to meaningful terms. This means that program reasoning methods based on classical logic usually can be adapted to the presented partial logic.
Similar content being viewed by others
References
Barringer, H., Cheng, J.H. and Jones, C.B.: “A Logic Covering Undefinedness in Program Proofs.”Acta Informatica,21, 251–269, (1984).
Blamey, S.: “Partial Logic.” InHandbook of Philosophical Logic, Volume III, D. Gabbay and F. Guenthner (eds.), D. Reidel Publishing Company, 1986.
Blikle, A.: “Three-Valued Predicates for Software Specification and Validation.” InVDM — The Way Ahead, Lecture Notes in Computer Science 328, Springer Verlag, 1988.
Cheng, J.H.: “A Logic for Partial Functions.” Ph.D. Thesis, Report UJMCS-86-7-1, Dept. of CS, University of Manchester, 1986.
Cheng, J.H. and Jones, C.B.: “On the Usability of Logics which Handle Partial Functions.” InProceedings of the Third Refinement Workshop, C. Morgan and J. Woodcock (eds.), Springer Verlag, 1990.
Dahl, O.-J., Langmyhr, D.F. and Owe, O.: “Preliminary Report on the Specification and Programming Language ABEL.” Research Report 106, Dept. of Informatics, University of Oslo, Norway, 1986.
Dahl, O.-J.:Verifiable Programming. The Hoare Series, Prentice Hall, 1992.
Elvang-Gøransson, M.: “Some properties of WSL.” Preprint, Dept. of Informatics, University of Oslo, 1991.
Gallier, J.H.:Logic for Computer Science. Harper & Row, 1986.
Gavilanes-Franco, A.G. and Lucio-Carrasco, F.: “A First Order Logic for Partial Functions.” Report DIA/89/1, Dept. of Informatics, Universidad Complutense, Madrid, Spain, 1989.
Goguen, J.A.: “Abstract Errors for Abstract Data Types.” InFormal Description of Programming Concepts, North Holland, 1978.
Holden, M.: “Weak Logic Theory.”Theoretical Computer Science,79, 295–321, (1991).
Hoogewijs, A.: “A Calculus of Partially Defined Predicates.” Technical Report, Rijksuniversiteit, Gent, 1977.
Hoogewijs, A.: “Partial Predicate Logic in Computer Science.”Acta Informatica,24, 381–393, (1987).
Kleene, S.C.:Introduction to Metamathematics. North Holland, 1952.
Konikowska, B., Tarlecki, A. and Blikle, A.: “A Three-Valued Logic for Software Specification and Validation.” InVDM — The Way Ahead, Lecture Notes in Computer Science 328, Springer Verlag, 1988.
Manna, Z.:Mathematical Theory of Computation. McGraw-Hill, 1974.
Owe, O.: “An Approach to Program Reasoning Based on a First Order Logic for Partial Functions.” Report CS-081, Dept. of EECS, UCSD, USA, 1984.
Prawitz, D.:Natural Deduction. Almquist & Wiksell, Stockholm, 1965.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Owe, O. Partial logics reconsidered: A conservative approach. Formal Aspects of Computing 5, 208–223 (1993). https://doi.org/10.1007/BF01211555
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01211555