Abstract
This paper compares the finitary three-valued logic LPF and the infinitary two-valued logic MPLω, the logics underlying VDM SL and COLD-K. These logics reflect different approaches to reasoning about partial functions and bringing recursive function definitions into proofs. The purpose of the comparison is to acquire insight into the relationship between these approaches. A natural translation from LPF to MPLω is given. It is shown that what can be proved remains the same after translation, in case strictness axioms are added to LPF or removed from MPLω. The translation from LPF to MPLω is extended to recursive function definitions and this translation is next used to justify some ways of bringing the definitions of partial functions into proofs using LPF.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Avron. Foundations and proof theory of 3-valued logics. LFCS Report ECS-LFCS-88-48, University of Edinburgh, Department of Computer Science, 1988.
H. Barringer, H. Cheng, and C.B. Jones. A logic covering undefinedness in program proofs. Acta Informatica, 21:251–269, 1984.
M. J. Beeson. Foundations of Constructive Mathematics. Springer Verlag, 1985.
M.J. Beeson. Towards a computation system based on set theory. Theoretical Computer Science, 60:297–340, 1988.
E. Bencivenga. Free logics. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, Volume III, chapter III.6. D. Reidel Publishing Company, 1986.
S. Blamey. Partial logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, Volume III, chapter III.1. D. Reidel Publishing Company, 1986.
J.H. Cheng. A Logic for Partial Functions. PhD thesis, University of Manchester, Department of Computer Science, 1986. Technical Report UMCS-86-7-1.
J.H. Cheng and C.B. Jones. On the usability of logics which handle partial functions. Technical Report UMCS-90-3-1, University of Manchester, Department of Computer Science, 1990.
A. Gavilanes-Franco and F. Lucio-Carrasco. A first order logic for partial functions. Theoretical Computer Science, 74:37–69, 1990.
M.J.C. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF. Springer Verlag, LNCS 78, 1979.
C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall, first edition, 1986.
H.B.M. Jonkers. An introduction to COLD-K. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 139–205. Springer Verlag, LNCS 394, 1989.
C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall, second edition, 1990.
C.B. Jones and R.C.F. Shaw. Case Studies in Systematic Software Development. Prentice-Hall, 1990.
C. Karp. Languages with Expressions of Infinite Length. North-Holland, 1964.
H.J. Keisler. Model Theory for Infinitary Logic. North-Holland, 1971.
S.C. Kleene. Introduction to Metamathematics. North-Holland, 1952.
C.P.J. Koymans and G.R. Renardel de Lavalette. The logic MPLω. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 247–282. Springer Verlag, LNCS 394, 1989.
B. Konikowska, A. Tarlecki, and A. Blikle. A three-valued logic for software specification and validation. In R. Bloomfield, L. Marshall, and R. Jones, editors, VDM '88, pages 218–242. Springer Verlag, LNCS 328, 1988.
J. Łukasiewicz. On three-valued logic. In S. McCall, editor, Polish Logic 1920–1939. Oxford University Press, 1967.
J. McCarthy. A basis for a mathematical theory of computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33–70. North-Holland Publishing Company, 1967.
C.A. Middelburg. Syntax and Semantics of VVSL — A Language for Structured VDM Specifications. PhD thesis, University of Amsterdam, September 1990. Available from PTT Research, Dr. Neher Laboratories.
O. Owe. An approach to program reasoning based on a first-order logic of partial functions. Computer Science Technical Report CS-081, University of California, San Diego, 1984.
L.C. Paulson. Logic and Computation. Cambridge University Press, Cambridge Tracts in Theoretical Computer Science 2, 1987.
G.D. Plotkin. Partial function logic. Lectures at Edinburgh University, 1985.
G.R. Renardel de Lavalette. Descriptions in mathematical logic. Studia Logica, 43:281–294, 1984.
G.R. Renardel de Lavalette. COLD-K2, the static kernel of COLD-K. Report RP/mod-89/8, SERC, 1989.
D.S. Scott. Existence and description in formal logic. In R. Schoenman, editor, Bertrand Russell, Philosopher of the Century, pages 181–200. Allen & Unwin, 1967.
D.S. Scott. Identity and existence in intuitionistic logic. In M.P. Fourman, C.J. Mulvey, and D.S. Scott, editors, Applications of Sheaves, pages 660–696. Springer Verlag, Lecture Notes in Mathematics 753, 1979.
S. Thompson. A logic for Miranda. Formal Aspects of Computing, 1(4):339–365, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Middelburg, C.A., Renardel de Lavalette, G.R. (1991). LPF and MPLω — A logical comparison of VDM SL and COLD-K. In: Prehn, S., Toetenel, W.J. (eds) VDM'91 Formal Software Development Methods. VDM 1991. Lecture Notes in Computer Science, vol 551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54834-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-54834-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54834-8
Online ISBN: 978-3-540-46449-5
eBook Packages: Springer Book Archive