Diamond formulas in the dynamic logic of recursively enumerable programs
Dynamic logic QDL as presented in |3| provides a comprehensive logical framework for the study of the before-after behaviour of deterministic and non-deterministic programs. While the set of all valid QDL-formulas is highly complex (π 1 1 -complete) and hence not axiomatizable, the subset of valid termination assertions was shown to be axiomatizable in |5|. In |8|, this result was generalized to the effect that the much larger QDL-fragment of diamond formulas is still axiomatizable and satisfies a compactness theorem. The proofs were based on a rather delicate proof-theoretical treatment of consistency properties. We show how results of this kind can be obtained in the general framework of recursively enumerable dynamic logic by a very flexible approach that uses only the compactness and completeness of first-order logic and saturated structures. The method is also applicable to the dynamic logic involving undeclared global procedures and recursive procedure calls studied in |6|.
Unable to display preview. Download preview PDF.
- 1 J. Barwise, J. Schlipf, An introduction to recursively saturated and resplendent models, J.Symb.Logic 41 (1976), 531–536.Google Scholar
- 2 D.Harel, First-order dynamic logic, Springer LNCS vol.68, 1979.Google Scholar
- 3 —"—, Dynamic logic, in The Handbook of Philosophical Logic, vol.II, Reidel, Dordrecht, 1984.Google Scholar
- 6 A.R. Meyer, J.C. Mitchell, Termination assertions for recursive programs: Completeness and axiomatic definability, Inf. & Control 56 (1983), 112–138.Google Scholar
- 7 G. Sacks, Saturated Model Theory, Benjamin, Reading, Mass., 1972.Google Scholar
- 8 P.H. Schmitt, Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem, Inf. & Control 61 (1984), 147–158.Google Scholar
- 9 V. Weispfenning, Infinitary model theoretic properties of κ-saturated structures, Z. math. Logik u. G. M., 19 (1973), 97–109.Google Scholar