A Note On Equivalences Among Logics of Programs

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.

[1]  Joseph Y. Halpern.  On the Expressive Power of Dynamic Logic. II , 1981 .

[2]  J. C. Shepherdson,et al.  Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes , 1975 .

[3]  Jean H. Gallier,et al.  Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II , 1981, Theor. Comput. Sci..

[4]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[5]  J. Love.  A programming logic by Robert L. Constable and Michael J. O'Donnell. Winthrop Publishers, Cambridge, Mass. 1978. 398 pp. $15.96 , 1982 .

[6]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[7]  Karl Winklmann,et al.  On the expressive power of Dynamic Logic (Preliminary Report) , 1979, STOC.

[8]  R. Milner.  Mathematical Centre Tracts , 1976 .

[9]  Grazyna Mirkowska,et al.  Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations , 1980, STOC '80.

[10]  Albert R. Meyer,et al.  Definability in Dynamic Logic , 1981, J. Comput. Syst. Sci..

[11]  Antoni Kreczmar,et al.  An introduction to algorithmic logic; metamathematical investigations in the theory of programs , 1977 .

[12]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[13]  David Michael Ritchie Park.  Finiteness is Mu-Ineffable , 1976, Theor. Comput. Sci..

[14]  Albert R. Meyer,et al.  Computability and completeness in logics of programs (Preliminary Report) , 1977, STOC '77.

[15]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[16]  Jerzy Tiuryn.  Unbounded program memory adds to the expressive power of first-order dynamic logic , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[17]  David Harel,et al.  Nondeterminism in logics of programs , 1978, POPL.

[18]  Assaf J. Kfoury,et al.  Translatability of Schemas over Restricted Interpretations , 1974, J. Comput. Syst. Sci..

[19]  H. Keisler.  Model theory for infinitary logic , 1971 .

[20]  Sheila A. Greibach,et al.  Theory of Program Structures: Schemes, Semantics, Verification , 1976, Lecture Notes in Computer Science.

[21]  Joseph Y. Halpern,et al.  Axiomatic definitions of programming languages: a theoretical assessment (preliminary report) , 1980, POPL '80.

[22]  Jerzy Tiuryn.  A Survey of the Logic of Effective Definitions , 1979, Logic of Programs.

[23]  Denis J. Kfoury.  Comparing Algebraic Structures up to Algorithmic Equivalence , 1972, ICALP.