Measuring the expressive power of dynamic logics: An application of abstract model theory
We compare two notions to measure the expressive power of various dynamic logics: Reducibility and AP-reducibility. With those and the techniques from model theory for infinitary and other generalized logics we solve some open problems in definability theory of dynamic logic.
KeywordsFunction Symbol Order Logic Expressive Power Dynamic Logic Validity Problem
Unable to display preview. Download preview PDF.
- [Ba]Barwise, K.J., Axioms for abstract model theory, Annals of mathematical logic, vol. 7 (1974) pp 221–265Google Scholar
- [Ha]Harel, D. First-order Dynamic logic, Lecture Notes in Computer Science, vol. 68, Heidelberg 1979Google Scholar
- [Ke]Keisler, H.J., Model Theory for Infinitary Logic, Studies in Logic vol 62, Amsterdam 1971Google Scholar
- [MSS]Makowsky, J.A., Shelah, S. and Stavi, J., Δ-Logics and generalized quantifiers, Annals of mathematical logic, vol 10 (1976) pp 155–192Google Scholar
- [MP]Meyer,A. and Parikh,R., Definability in dynamic logic, MIT/LCS/TM-156, 1986Google Scholar
- [Pol]Banachowski,L. et al., An Introduction to algorithmic logic; Meta-mathematical investigation in the theory of programs, In Mathematical Foundations of Computer Science, Mazurkiewicz et al.ed. Banach Center Publications, vol. 2, Warsaw 1977Google Scholar
- [MW]A.Meyer and K.Winklmann, On the expressive power of dynamic logic, MIT/LCS/TM-157, Feb. 1980Google Scholar
- [Li]P. Lindström, On extensions of elementary logic, Theoria, vol.35 (1969), pp 1–11.Google Scholar