{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:34:34Z","timestamp":1774060474789,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221456","type":"print"},{"value":"9783540247715","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24771-5_13","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T17:41:39Z","timestamp":1294508499000},"page":"149-162","source":"Crossref","is-referenced-by-count":11,"title":["SCAN Is Complete for All Sahlqvist Formulae"],"prefix":"10.1007","author":[{"given":"V.","family":"Goranko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Hustadt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. A.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Vakarelov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Automated Deduction \u2013 A Basis for Applications","year":"1998","unstructured":"Bibel, W., Schmitt, P.H. (eds.): Automated Deduction \u2013 A Basis for Applications, vol.\u00a0I-III. Kluwer, Dordrecht (1998)"},{"key":"13_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, V.: Modal Logic. Cambridge Univ. Press, Cambridge (2001)"},{"key":"13_CR3","series-title":"Oxford Logic Guides","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A. Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford Logic Guides, vol.\u00a035. Clarendon Press, Oxford (1997)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01058532","volume":"54","author":"M. Rijke de","year":"1995","unstructured":"de Rijke, M., Venema, Y.: Sahlqvist\u2019s Theorem For Boolean Algebras with Operators with an Application to Cylindric Algebras. Studia Logica\u00a054, 61\u201378 (1995)","journal-title":"Studia Logica"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"Doherty, P., Lukaszewics, W., Szalas, A.: Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning\u00a018(3), 297\u2013336 (1997)","journal-title":"Journal of Automated Reasoning"},{"key":"13_CR6","unstructured":"Engel, T.: Quantifier Elimination in Second-Order Predicate Logic. MSc thesis, Saarland University, Saarbr\u00fccken, Germany (1996)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1016\/B978-044450813-3\/50027-8","volume-title":"Handbook of Automated Reasoning","author":"C.G. Ferm\u00fcller","year":"2001","unstructured":"Ferm\u00fcller, C.G., Leitsch, A., Hustadt, U., Tammet, T.: Resolution decision procedures. In: Handbook of Automated Reasoning, pp. 1791\u20131849. Elsevier, Amsterdam (2001)"},{"key":"13_CR8","first-page":"35","volume":"7","author":"D.M. Gabbay","year":"1992","unstructured":"Gabbay, D.M., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. South African Computer Journal\u00a07, 35\u201343 (1992)","journal-title":"South African Computer Journal"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1142\/9789812776471_0012","volume-title":"Advances in Modal Logic","author":"V. Goranko","year":"2002","unstructured":"Goranko, V., Vakarelov, D.: Sahlqvist formulas unleashed in polyadic modal languages. In: Advances in Modal Logic, vol.\u00a03, pp. 221\u2013240. World Scientific, Singapore (2002)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01057646","volume":"53","author":"B. J\u00f3nsson","year":"1994","unstructured":"J\u00f3nsson, B.: On the canonicity of Sahlqvist identities. Studia Logica\u00a053, 473\u2013491 (1994)","journal-title":"Studia Logica"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-94-015-8242-1_7","volume-title":"Diamonds and Defaults","author":"M. Kracht","year":"1993","unstructured":"Kracht, M.: How completeness and correspondence theory got married. In: Diamonds and Defaults, pp. 175\u2013214. Kluwer, Dordrecht (1993)"},{"key":"13_CR12","unstructured":"Nonnengart, A.: Strong skolemization. Research Report MPI-I-96-2-010, Max- Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken (1996)"},{"key":"13_CR13","volume-title":"Logic, Language and Reasoning: Essays in honour of Dov Gabbay","author":"A. Nonnengart","year":"1999","unstructured":"Nonnengart, A., Ohlbach, H.J., Szalas, A.: Quantifier elimination for secondorder predicate logic. In: Logic, Language and Reasoning: Essays in honour of Dov Gabbay, Kluwer, Dordrecht (1999)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/B978-044450813-3\/50008-4","volume-title":"Handbook of Automated Reasoning","author":"A. Nonnengart","year":"2001","unstructured":"Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Handbook of Automated Reasoning, pp. 335\u2013367. Elsevier, Amsterdam (2001)"},{"key":"13_CR15","volume-title":"Handbook of Automated Reasoning.","year":"2001","unstructured":"Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning. Elsevier Science, Amsterdam (2001)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/S0049-237X(08)70728-6","volume-title":"Proc. of the 3rd Scandinavian Logic Symposium, 1973","author":"H. Sahlqvist","year":"1975","unstructured":"Sahlqvist, H.: Completeness and correspondence in the first and second order semantics for modal logics. In: Proc. of the 3rd Scandinavian Logic Symposium, 1973, pp. 110\u2013143. North-Holland, Amsterdam (1975)"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"992","DOI":"10.2307\/2274758","volume":"54","author":"G. Sambin","year":"1989","unstructured":"Sambin, G., Vaccaro, V.: A new proof of Sahlqvist\u2019s theorem on modal definability and completeness. Journal of Symbolic Logic\u00a054(3), 992\u2013999 (1989)","journal-title":"Journal of Symbolic Logic"},{"issue":"6","key":"13_CR18","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/3.6.605","volume":"3","author":"A. Sza\u0142as","year":"1993","unstructured":"Sza\u0142as, A.: On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation\u00a03(6), 605\u2013620 (1993)","journal-title":"Journal of Logic and Computation"},{"key":"13_CR19","unstructured":"van Benthem, J.: Modal Logic and Classical Logic. Bibliopolis (1983)"}],"container-title":["Lecture Notes in Computer Science","Relational and Kleene-Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24771-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T21:54:27Z","timestamp":1712094867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24771-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221456","9783540247715"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24771-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}