Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Barwise, K.J., Axioms for abstract model theory, Annals of mathematical logic, vol. 7 (1974) pp 221–265
Harel, D. First-order Dynamic logic, Lecture Notes in Computer Science, vol. 68, Heidelberg 1979
Keisler, H.J., Model Theory for Infinitary Logic, Studies in Logic vol 62, Amsterdam 1971
Makowsky, J.A., Shelah, S. and Stavi, J., Δ-Logics and generalized quantifiers, Annals of mathematical logic, vol 10 (1976) pp 155–192
Meyer,A. and Parikh,R., Definability in dynamic logic, MIT/LCS/TM-156, 1986
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 1977
A.Meyer and K.Winklmann, On the expressive power of dynamic logic, MIT/LCS/TM-157, Feb. 1980
P. Lindström, On extensions of elementary logic, Theoria, vol.35 (1969), pp 1–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makowsky, J.A. (1980). Measuring the expressive power of dynamic logics: An application of abstract model theory. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_88
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive