{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T06:14:51Z","timestamp":1775628891900,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T00:00:00Z","timestamp":1328745600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11225-012-9388-9","type":"journal-article","created":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T04:44:28Z","timestamp":1328676268000},"page":"31-60","source":"Crossref","is-referenced-by-count":20,"title":["Sahlqvist Correspondence for Modal mu-calculus"],"prefix":"10.1007","volume":"100","author":[{"given":"Johan","family":"van Benthem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Bezhanishvili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Hodkinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,9]]},"reference":[{"key":"9388_CR1","unstructured":"Balbiani, P., V. Shehtman, and I. Shapirovsky, \u2018Every world can see a Sahlqvist world\u2019, in G. Governatori, I. Hodkinson, and Y. Venema, (eds.), Proc. Advances in Modal Logic, College Publications, 2006, pp. 69\u201385."},{"issue":"1","key":"9388_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272270","volume":"40","author":"J. Benthem van","year":"1975","unstructured":"Benthem J.: \u2018A note on modal formulas and relational properties\u2019. Journal of Symbolic Logic 40(1), 55\u201358 (1975)","journal-title":"Journal of Symbolic Logic"},{"key":"9388_CR3","volume-title":"Modal logic and classical logic","author":"J. Benthem van","year":"1985","unstructured":"van Benthem J.: Modal logic and classical logic. Bibliopolis, Naples (1985)"},{"key":"9388_CR4","doi-asserted-by":"crossref","first-page":"696","DOI":"10.2178\/jsl\/1122038910","volume":"70","author":"J. Benthem van","year":"2005","unstructured":"van Benthem J.: \u2018Minimal predicates, fixed-points, and definability\u2019. J. Symbolic Logic 70, 696\u2013712 (2005)","journal-title":"J. Symbolic Logic"},{"key":"9388_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s11225-006-8301-9","volume":"83","author":"J. Benthem van","year":"2006","unstructured":"van Benthem J.: \u2018Modal frame correspondences and fixed-points\u2019. Studia Logica 83, 133\u2013155 (2006)","journal-title":"Studia Logica"},{"key":"9388_CR6","unstructured":"Bezhanishvili N., I. Hodkinson, \u2018Sahlqvist theorem for modal fixed point logic\u2019, 2010. Submitted."},{"key":"9388_CR7","doi-asserted-by":"crossref","unstructured":"Blackburn, P., M. de Rijke, and Y. Venema, Modal logic, Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, UK, 2001.","DOI":"10.1017\/CBO9781107050884"},{"key":"9388_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1093\/jigpal\/jzi024","volume":"13","author":"B. ten Cate","year":"2005","unstructured":"ten Cate B., Marx M., Viana P.: \u2018Hybrid logics with Sahlqvist axioms\u2019. Logic J. IGPL 13, 293\u2013300 (2005)","journal-title":"Logic J. IGPL"},{"key":"9388_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.jal.2010.08.002","volume":"8","author":"W. Conradie","year":"2010","unstructured":"Conradie W., Goranko V., Vakarelov D.: \u2018Algorithmic correspondence and completeness in modal logic V: recursive extensions of SQEMA\u2019. J. Applied Logic 8, 319\u2013333 (2010)","journal-title":"J. Applied Logic"},{"key":"9388_CR10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"Doherty P., \u0141ukaszewicz W., Sza\u0142as A.: \u2018Computing circumscription revisited: A reduction algorithm\u2019. J. Automated Reasoning 18, 297\u2013336 (1997)","journal-title":"J. Automated Reasoning"},{"key":"9388_CR11","unstructured":"Ebbinghaus H-D., J. Flum, Finite model theory, 2nd edn., Perspectives in mathematical logic, Springer-Verlag, New York, 1999."},{"key":"9388_CR12","first-page":"147","volume":"15","author":"L.L. Esakia","year":"1974","unstructured":"Esakia L.L.: \u2018Topological Kripke models\u2019. Soviet Math. Dokl. 15, 147\u2013151 (1974)","journal-title":"Soviet Math. Dokl."},{"key":"9388_CR13","unstructured":"Fontaine G., Modal fixpoint logic: some model theoretic questions, Ph.D. thesis, ILLC, Amsterdam, 2010. ILLC Dissertation Series DS-2010-09."},{"key":"9388_CR14","unstructured":"Gabbay, D. M., and H-J. Ohlbach, \u2018Quantifier elimination in second-order predicate logic\u2019, in B. Nebel, C. Rich, and W. Swartout, (eds.), Principles of Knowledge Representation and Reasoning (KR92), Morgan Kaufmann, 1992, pp. 425\u2013435."},{"key":"9388_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s000120050100","volume":"41","author":"S. Givant","year":"1999","unstructured":"Givant S., Venema Y.: \u2018The preservation of Sahlqvist equations in completions of Boolean algebras with operators\u2019. Algebra Universalis 41, 47\u201384 (1999)","journal-title":"Algebra Universalis"},{"key":"9388_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.26686\/ajl.v5i0.1783","volume":"5","author":"R. Goldblatt","year":"2007","unstructured":"Goldblatt R., Hodkinson I.: \u2018The McKinsey\u2013Lemmon logic is barely canonical\u2019. Australasian J. Logic 5, 1\u201319 (2007)","journal-title":"Australasian J. Logic"},{"key":"9388_CR17","doi-asserted-by":"crossref","unstructured":"Goranko, V., and M. Otto, \u2018Model theory of modal logic\u2019, in P. Blackburn, J. van Benthem, and F. Wolter, (eds.), Handbook of Modal Logic, Elsevier, Amsterdam, 2006, pp. 249\u2013329.","DOI":"10.1016\/S1570-2464(07)80008-5"},{"key":"9388_CR18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.apal.2005.10.005","volume":"141","author":"V. Goranko","year":"2006","unstructured":"Goranko V., Vakarelov D.: \u2018Elementary canonical formulae: extending Sahlqvist\u2019s theorem\u2019. Ann. Pure. Appl. Logic 141, 180\u2013217 (2006)","journal-title":"Ann. Pure. Appl. Logic"},{"key":"9388_CR19","unstructured":"Gr\u00e4del E., \u2018The decidability of guarded fixed point logic\u2019, in J. Gerbrandy, M. Marx, M. de Rijke, and Y. Venema, (eds.), JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, Vossiuspers, Amsterdam University Press, Amsterdam, 1999. CD-ROM, ISBN 90 5629 104 1."},{"key":"9388_CR20","doi-asserted-by":"crossref","unstructured":"Kracht, M., \u2018How completeness and correspondence theory got married\u2019, in M. de Rijke, (ed.), Diamonds and Defaults, Kluwer Academic Publishers, 1993, pp. 175\u2013214.","DOI":"10.1007\/978-94-015-8242-1_7"},{"key":"9388_CR21","unstructured":"Nonnengart, A., and A. Sza\u0142as, \u2018A fixpoint approach to second-order quantifier elimination with applications to correspondence theory\u2019, in E. Or\u0142owska, (ed.), Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, vol. 24 of Studies in Fuzziness and Soft Computing, Physica-Verlag, 1999, pp. 307\u2013328."},{"key":"9388_CR22","doi-asserted-by":"crossref","unstructured":"Sahlqvist, H., \u2018Completeness and correspondence in the first and second order semantics for modal logic\u2019, in S. Kanger, (ed.), Proc. 3rd Scandinavian logic symposium, Uppsala, 1973, North Holland, Amsterdam, 1975, pp. 110\u2013143.","DOI":"10.1016\/S0049-237X(08)70728-6"},{"key":"9388_CR23","doi-asserted-by":"crossref","first-page":"992","DOI":"10.2307\/2274758","volume":"54","author":"G. Sambin","year":"1989","unstructured":"Sambin G., Vaccaro V.: \u2018A new proof of Sahlqvist\u2019s theorem on modal definability and completeness\u2019. J. Symbolic Logic 54, 992\u2013999 (1989)","journal-title":"J. Symbolic Logic"},{"key":"9388_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski A.: \u2018A lattice-theoretical fixpoint theorem and its applications\u2019. Pacific Journal of Mathematics 5, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-012-9388-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-012-9388-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-012-9388-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T09:40:50Z","timestamp":1561282850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-012-9388-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,9]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s11225-012-9388-9","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,9]]}}}