Expressivity of second order propositional modal logic

Journal of Philosophical Logic

Volumn 35, Issue 2, 2006, Pages 209-223

  Ten Cate, Balder ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Bounded fragment; Expressivity; Modal logic; Propositional quantifiers

Indexed keywords

EID: 33746119839     PISSN: 00223611     EISSN: 15730433     Source Type: Journal    
DOI: 10.1007/s10992-005-9012-9     Document Type: Article

References (19)

1. Barwise, J. (1975): Admissible Sets and Structures, Springer.
2. van Benthem, J. (1983): Modal Logic and Classical Logic, Bibliopolis.
3. Blackburn, P. and Marx, M. (2003): Constructive interpolation in hybrid logic, J. Symb. Log. 68(2), 463-480.
4. Blackburn, P., de Rijke, M. and Venema, Y. (2001): Modal Logic, Cambridge University Press, Cambridge, UK.
5. Buss, S. R. (1997): Bounded arithmetic and prepositional proof complexity, in H. Schwichtenberg (ed.), logic and Computation, Springer, Berlin Heidelberg New York, pp. 67-122.
6. ten Cate, B. (2005): Model Theory for Extended Modal Languages. PhD thesis, University of Amsterdam. ILLC Dissertation Series DS-2005-01.
7. Feferman, S. (1968): Persistent and invariant formulas for outer extensions, Compos. Math. 20, 29-52.
8. Feferman, S. and Kreisel, G. (1966): Persistent and invariant formulas relative to theories of higher order, Bull. Am. Math. Soc. 72, 480-485. Research Announcement.
9. Fine, K. (1970): Prepositional quantifiers in modal logic, Theoria, 36, 336-346.
10. Goldblatt, R. (1975): First-order definability in modal logic, J. Symb. Log. 40(1), 35-40.
11. Janin, D. and Walukiewicz, I. (1996): On the expressive completeness of the propositional mu-calculus with respect to monadic second-order logic, in U. Montanari and V. Sassone (eds.), Proceedings of the seventh International Conference on Concurrency Theory (CONCUR'96), volume 1119 of Lecture Notes in Computer Science, Springer, pp. 263-277.
12. Kaminski, M. and Tiomkin, M. (1996): The expressive power of second-order propositional modal logic, Notre Dame J. Form. Log. 37(1), 35-43.
13. Kremer, P. (1993): Quantifying over propositions in relevance logic: nonaxiomatizability of primary interpretations of ∀p and ∃p, J. Symb. Log. 58(1), 334-349.
14. Kremer, P. (1997): On the complexity of propositional quantification in intuitionistic logic, J. Symb. Log. 62(2), 529-544.
15. Lévy, A. (1965): A Hierarchy of Formulas in Set Theory, volume 57 of Memoirs of the American Mathematical Society.
16. Otto, M. (2004): Modal and guarded characterisation theorems over finite transition systems, Ann. Pure Appl. Logic 130, 173-205.
17. Rabin, M. (1969): Decidability of second-order theories and automata on infinite trees, Trans. AMS 141, 1-35.
18. Stirling, C. (2003): Bisimulation and language equivalence, in Ruy J. G. B. de Queiroz (ed.), Logic for Concurrency and Synchronisation, Trends in Logic, Kluwer Academic, pp. 269-284.
19. van Benthem, J. (1975): A note on modal formulas and relational properties, J. Symb. Log. 40(1), 55-58.