Remarks on Comparing Expressive Power of Logics of Programs

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

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

[3]  Richard J. Lipton,et al.  A necessary and sufficient condition for the existence of hoare logics , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Jerzy Tiuryn,et al.  A Note On Equivalences Among Logics of Programs , 1981, Logic of Programs.

[5]  Robert L. Constable,et al.  On Classes of Program Schemata , 1972, SIAM J. Comput..

[6]  Joseph Y. Halpern,et al.  On effective axiomatizations of Hoare logics , 1982, POPL '82.

[7]  Harvey M. Friedman,et al.  Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory , 1971 .

[8]  R. L. Goodstein,et al.  Logic Colloquium '69 , 1972 .

[9]  Jerzy Tiuryn,et al.  On the Power of Nondeterminism in Dynamic Logic , 1982, ICALP.

[10]  Pawel Urzyczyn,et al.  Nontrivial Definability by Flow-Chart Programs , 1984, Inf. Control..

[11]  Assaf J. Kfoury,et al.  Definability by Programs in First-Order Structures , 1983, Theor. Comput. Sci..

[12]  J. Tiuryn,et al.  Some relationships between logics of programs and complexity theory , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).