Abstract
Several different first order formal logics of programs— Algorithmic Logic, Dynamic Logic, and Logic of Effective Definitions — are compared and shown to be equivalent to a fragment of constructive Lω1ω. When programs are modelled as effective flowcharts, the logics of deterministic and nondeterministic programs are equivalent.
This work was supported in part by The National Science Foundation, Grant Nos. MCS 7719754 and MCS 8010707, and by a grant to the M.I.T. Laboratory for Computer Science by the IBM Corporation.
Preview
Unable to display preview. Download preview PDF.
References
BANACHOWSKI, L. et al. An Introduction to Algorithmic Logic; Metamathematical Investigations in the Theory of Programs, Mathematical Foundations of Computer Science, Banach Center Publichations, vol. 2, (ed A. Mazurkiewicz and Z. Pawlak), Polish Scientific Publishers, Warsaw, 1977, 7–100.
BERGSTRA, J., TIURYN, J. and TUCKER, J., Floyd's Principle, Correctness Theories and Program Equivalence, Mathematisch Centrum, IW145/80. To appear in Theoretical Computer Science, 1981.
CONSTABLE, R.L., and O'DONNELL, M.J., A Programming Logic, Winthrop Publishers, 1978.
DE BAKKER, J., Mathematical Theory of Program Correctness, Prentice-Hall, 1980.
ENGELER, E. Algorithmic Properties of Structures, Mathematical Systems Theory, 1, 1967, 183–195.
ENGELER, E., Algorithmic Logic. In de Bakker (ed.) Mathematical Centre Tracts (63) Amsterdam 1975, 57–85.
GALLIER, J.H. Nondeterministic flowchart programs with recursive procedures: semantics and correctness, Theoretical Computer Science, 13, 2(1981), 193–224.
GREIBACH, S. Theory of Program Structures: Schemes, Semantics, Verification, Lecture Notes in Computer Science, 36, Springer Verlag, 1975.
HAREL, D., First-Order Dynamic Logic, Lecture Notes in Computer Science 68, Springer-Verlag, 1979.
10.HAREL, D., A.R. MEYER and V. PRATT, Computability and Completeness in Logics of Programs: Preliminary Report, 9th ACM Symp. on Theory of Computing, Boulder, Colorado, (May, 1977), 261–268. Revised version, M.I.T. Lab. for Computer Science TM-97, (Feb. 1978), 16 pp.
HAREL, D., and PRATT, V. Nondeterminism in logics of programs, 5th Annual Symposium on Principles of Programming Languages, January 1978, 203–213.
HITCHCOCK, P. AND PARK, D. Induction Rules and Termination Proofs, Automata, Languages and Programming, (ed M. Nivat), American Elsevier, New York, 1973, 225–251.
KEISLER, H.J., Model Theory for Infinitary Logic. North-Holland Publ. Co., Amsterdam 1972.
KFOURY, D.J., Comparing Algebraic Structures up to Algorithmic Equivalence. In Nivat (ed.) Automata, Languages and Programming. North-Holland Publ. Co., Amsterdam 1972, 253–264.
KFOURY, D.J., Translatability of schemes over restricted interpretations. Journal of Comp. and Syst. Sc. 8 (1974), 387–408.
MEYER, A.R., Ten thousand and one logics of programming. EATCS Bulletin, 11–29; M.I.T. LCS TM 150, MIT Laboratory for Computer Science, Cambridge, Ma., February 1980.
MEYER, A.R. and J. Y. HALPERN, Axiomatic Definitions of Programming Languages: A Theoretical Assessment, (Preliminary Report) Proc. of Seventh Annual POPL Conf., January 1980, 203–212; M.I.T. LCS TM 163, April, 1980, 34 pp.; to appear JACM (1981).
MEYER, ALBERT R., and ROHIT PARIKH, Definability in Dynamic Logic, Proc. of ACM Symp. on Theory of Computing, Los Angeles, Cal., April, 1980, 1–7; to appear Jour. Computer and System Science (1981).
MEYER, A.R. and K. WINKLMANN, On the Expressive Power of Dynamic Logic, Preliminary Report, Proc. of the 11th Annual ACM Conf. on Theory of Computing, Atlanta, Ga., May 1979, 167–175; M.I.T. LCS TM 157, February, 1980, 36pp; to appear Theoretical Computer Science (1981).
MIRKOWSKA, G., Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations, 12th Annual ACM Symp. on Theory of Computing (1980), 14–21.
D. PARK. Finiteness is mu-ineffable, Theoretical Computer Science 3, 1976, 173–181.
PRATT, V., Semantical considerations on Floyd-Hoare logic, Proceedings 17th Symposium on Foundations of Computer Science, Houston, Texas, October 1976, 109–121.
SALWICKI, A. Formalized Algorithmic Languages, Bull. Acad. Pol. Sci.,Ser. Math. Astr. Phys. 18, 1970, 227–232.
SCOTT, D. S. Relating Theories of the %1-Calculus, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, eds. Seldin and Hindley, Academic Press, New York, 1980, 403–450.
SHEPHERDSON, J.C., Computing over abstract structures: serial and parallel procedures and Friedman's effective definitional schemes, In Shepherdson and Rose (eds.) Logic Colloquium 73. North-Holland, Amsterdam, 1973, pp. 445–513.
TIURYN, J., A Survey of the Logic of Effective Definitions, MIT/LCS/TR-246, MIT, Laboratory For Computer Science, Cambridge, Mass., September
TIURYN, J., Unbounded program memory adds to expressive power of first-order Dynamic Logic, Proceedings 22nd IEEE Symposium on Foundations of Computer Science, Nashville, Tennessee, October 1981, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, A.R., Tiuryn, J. (1982). A note on equivalences among logics of programs. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025787
Download citation
DOI: https://doi.org/10.1007/BFb0025787
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11212-9
Online ISBN: 978-3-540-39047-3
eBook Packages: Springer Book Archive