{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T23:48:15Z","timestamp":1771544895357,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T00:00:00Z","timestamp":1132185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Philos Logic"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10992-005-9012-9","type":"journal-article","created":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T18:05:25Z","timestamp":1132250725000},"page":"209-223","source":"Crossref","is-referenced-by-count":15,"title":["Expressivity of Second Order Propositional Modal Logic"],"prefix":"10.1007","volume":"35","author":[{"given":"Balder","family":"ten Cate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,17]]},"reference":[{"key":"9012_CR1","doi-asserted-by":"crossref","unstructured":"Barwise, J. (1975): Admissible Sets and Structures, Springer.","DOI":"10.1007\/978-3-662-11035-5"},{"key":"9012_CR2","unstructured":"van Benthem, J. (1983): Modal Logic and Classical Logic, Bibliopolis."},{"issue":"2","key":"9012_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.2178\/jsl\/1052669059","volume":"68","author":"P. Blackburn","year":"2003","unstructured":"Blackburn, P. and Marx, M. (2003): Constructive interpolation in hybrid logic, J. Symb. Log. 68(2), 463\u2013480.","journal-title":"J. Symb. Log."},{"key":"9012_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M. and Venema, Y. (2001): Modal Logic, Cambridge University Press, Cambridge, UK."},{"key":"9012_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-642-59048-1_3","volume-title":"Logic and Computation","author":"S. R. Buss","year":"1997","unstructured":"Buss, S. R. (1997): Bounded arithmetic and propositional proof complexity, in H. Schwichtenberg (ed.), Logic and Computation, Springer, Berlin Heidelberg New York, pp. 67\u2013122."},{"key":"9012_CR6","unstructured":"ten Cate, B. (2005): Model Theory for Extended Modal Languages. PhD thesis, University of Amsterdam. ILLC Dissertation Series DS-2005-01."},{"key":"9012_CR7","first-page":"29","volume":"20","author":"S. Feferman","year":"1968","unstructured":"Feferman, S. (1968): Persistent and invariant formulas for outer extensions, Compos. Math. 20, 29\u201352.","journal-title":"Compos. Math."},{"key":"9012_CR8","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1090\/S0002-9904-1966-11507-0","volume":"72","author":"S. Feferman","year":"1966","unstructured":"Feferman, S. and Kreisel, G. (1966): Persistent and invariant formulas relative to theories of higher order, Bull. Am. Math. Soc. 72, 480\u2013485. Research Announcement.","journal-title":"Bull. Am. Math. Soc."},{"key":"9012_CR9","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1111\/j.1755-2567.1970.tb00432.x","volume":"36","author":"K. Fine","year":"1970","unstructured":"Fine, K. (1970): Propositional quantifiers in modal logic, Theoria, 36, 336\u2013346.","journal-title":"Theoria"},{"issue":"1","key":"9012_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/2272267","volume":"40","author":"R. Goldblatt","year":"1975","unstructured":"Goldblatt, R. (1975): First-order definability in modal logic, J. Symb. Log. 40(1), 35\u201340.","journal-title":"J. Symb. Log."},{"key":"9012_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013277.","DOI":"10.1007\/3-540-61604-7_60"},{"issue":"1","key":"9012_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1305\/ndjfl\/1040067314","volume":"37","author":"M. Kaminski","year":"1996","unstructured":"Kaminski, M. and Tiomkin, M. (1996): The expressive power of second-order propositional modal logic, Notre Dame J. Form. Log. 37(1), 35\u201343.","journal-title":"Notre Dame J. Form. Log."},{"issue":"1","key":"9012_CR13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.2307\/2275341","volume":"58","author":"P. Kremer","year":"1993","unstructured":"Kremer, P. (1993): Quantifying over propositions in relevance logic: nonaxiomatizability of primary interpretations of \u2200p and \u2203p, J. Symb. Log. 58(1), 334\u2013349.","journal-title":"J. Symb. Log."},{"issue":"2","key":"9012_CR14","doi-asserted-by":"crossref","first-page":"529","DOI":"10.2307\/2275545","volume":"62","author":"P. Kremer","year":"1997","unstructured":"Kremer, P. (1997): On the complexity of propositional quantification in intuitionistic logic, J. Symb. Log. 62(2), 529\u2013544.","journal-title":"J. Symb. Log."},{"key":"9012_CR15","doi-asserted-by":"crossref","unstructured":"L\u00e9vy, A. (1965): A Hierarchy of Formulas in Set Theory, volume 57 of Memoirs of the American Mathematical Society.","DOI":"10.1090\/memo\/0057"},{"key":"9012_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.apal.2004.04.003","volume":"130","author":"M. Otto","year":"2004","unstructured":"Otto, M. (2004): Modal and guarded characterisation theorems over finite transition systems, Ann. Pure Appl. Logic 130, 173\u2013205.","journal-title":"Ann. Pure Appl. Logic"},{"key":"9012_CR17","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M. (1969): Decidability of second-order theories and automata on infinite trees, Trans. AMS 141, 1\u201335.","journal-title":"Trans. AMS"},{"key":"9012_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013284.","DOI":"10.1007\/0-306-48088-3_7"},{"issue":"1","key":"9012_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272270","volume":"40","author":"J. Benthem van","year":"1975","unstructured":"van Benthem, J. (1975): A note on modal formulas and relational properties, J. Symb. Log. 40(1), 55\u201358.","journal-title":"J. Symb. Log."}],"container-title":["Journal of Philosophical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10992-005-9012-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10992-005-9012-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10992-005-9012-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:51:43Z","timestamp":1586566303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10992-005-9012-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,17]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["9012"],"URL":"https:\/\/doi.org\/10.1007\/s10992-005-9012-9","relation":{},"ISSN":["0022-3611","1573-0433"],"issn-type":[{"value":"0022-3611","type":"print"},{"value":"1573-0433","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,17]]}}}