{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:57:03Z","timestamp":1762271823008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319060248"},{"type":"electronic","value":"9783319060255"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06025-5_36","type":"book-chapter","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T12:47:27Z","timestamp":1409057247000},"page":"933-975","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Unified Correspondence"],"prefix":"10.1007","author":[{"given":"Willem","family":"Conradie","sequence":"first","affiliation":[]},{"given":"Silvio","family":"Ghilardi","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Palmigiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,27]]},"reference":[{"key":"36_CR1","unstructured":"Abramsky S (2005) A Cook\u2019s tour of the finitary non-well-founded sets. In: We will show them: essays in honour of Dov Gabbay, pp 1\u201318"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W Ackermann","year":"1935","unstructured":"Ackermann W (1935) Untersuchung \u00fcber das Eliminationsproblem der mathematischen logic. Mathematische Annalen 110:390\u2013413","journal-title":"Mathematische Annalen"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"van Benthem J (1976) Modal reduction principles. J Symbolic Logic 41(2):301\u2013312","DOI":"10.1017\/S0022481200051355"},{"key":"36_CR4","unstructured":"van Benthem J (1983) Modal logic and classical logic. Bibliopolis, Napoli"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"van Benthem J (2001) Correspondence theory. In: Gabbay DM, Guenthner F (eds) Handbook of philosophical logic, vol 3. Kluwer Academic, Dordrecht, pp 325\u2013408","DOI":"10.1007\/978-94-017-0454-0_4"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"van Benthem J (2005) Minimal predicates, fixed-points, and definability. J Symbolic Logic 70(3):696\u2013712","DOI":"10.2178\/jsl\/1122038910"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"van Benthem J (2006) Modal frame correspondence and fixed-points. Studia Logica 83:133\u2013155","DOI":"10.1007\/s11225-006-8301-9"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"van Benthem J, Bezhanishvili N, Hodkinson I (2012) Sahlqvist correspondence for modal mu-calculus. Studia Logica 100:31\u201360","DOI":"10.1007\/s11225-012-9388-9"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Bezhanishvili N, Ghilardi S (2013) Bounded proofs and step frames. In: Logic group preprint series, no 306. Utrecht University","DOI":"10.1007\/978-3-642-40537-2_6"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Bezhanishvili N, Ghilardi S, Jibladze M (2013) Free modal algebras revisited: the step-by-step method. In: Leo Esakia on duality in modal and intuitionistic logics. Outstanding contributions to Logic, vol 4, 2014. Springer","DOI":"10.1007\/978-94-017-8860-1"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Bezhanishvili N, Ghilardi S (2013) Bounded proofs and step frames. In: Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2013), pp 44\u201358","DOI":"10.1007\/978-3-642-40537-2_6"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Bezhanishvili N, Kurz K (2007) Free modal algebras: a coalgebraic perspective. In: Proceedings of CALCO 2007, pp 143\u2013157","DOI":"10.1007\/978-3-540-73859-6_10"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.2307\/2271102","volume":"34","author":"RA Bull","year":"1969","unstructured":"Bull RA (1969) On modal logic with propositional quantifiers. J Symbolic Logic 34:257\u2013263","journal-title":"J Symbolic Logic"},{"key":"36_CR14","unstructured":"Chagrov A, Chagrova LA (2006) The truth about algorithmic problems in correspondence theory. In: Governatori G, Hodkinson I, Venema Y (eds) Advances in modal logic, vol 6. College Publications, London, pp 121\u2013138"},{"key":"36_CR15","unstructured":"Conradie W, Fomatati Y, Palmigiano A, Sourabh S Sahlqvist correspondence for intuitionistic modal mu-calculus (To appear in Theoretical Computer Science)"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.3166\/JANCL.18.175-211","volume":"18","author":"W Conradie","year":"2008","unstructured":"Conradie W, Goranko V (2008) Algorithmic correspondence and completeness in modal logic III: semantic extensions of the algorithm SQEMA. J Appl Non-class Logics 18:175\u2013211","journal-title":"J Appl Non-class Logics"},{"key":"36_CR17","unstructured":"Conradie W, Goranko V, Vakarelov D (2005) Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects. In: Schmidt R, Pratt-Hartmann I, Reynolds M, Wansing H (eds) Advances in modal logic, vol 5. Kings College, London, pp 17\u201351"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Conradie W, Goranko V, Vakarelov D (2006) Algorithmic correspondence and completeness in modal logic I: the core algorithm SQEMA. Logical Methods Comput Sci 2(1:5):1\u201326","DOI":"10.2168\/LMCS-2(1:5)2006"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1093\/logcom\/exl026","volume":"16","author":"W Conradie","year":"2006","unstructured":"Conradie W, Goranko V, Vakarelov D (2006) Algorithmic correspondence and completeness in modal logic. II. Polyadic and hybrid extensions of the algorithm SQEMA. J Logic Comput 16:579\u2013612","journal-title":"J Logic Comput"},{"key":"36_CR20","doi-asserted-by":"publisher","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 (2010) Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA. J Appl Logic 8:319\u2013333","journal-title":"J Appl Logic"},{"key":"36_CR21","unstructured":"Conradie W, Palmigiano A Algorithmic correspondence and canonicity for non-distributive logics (Submitted)"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Conradie W, Palmigiano A (2012) Algorithmic correspondence and canonicity for distributive modal logic. Ann Pure Appl Logic 163:338\u2013376","DOI":"10.1016\/j.apal.2011.10.004"},{"key":"36_CR23","unstructured":"Conradie W, Palmigiano A, Sourabh S Algebraic modal correspondence: Sahlqvist and beyond (Submitted)"},{"key":"36_CR24","unstructured":"Conradie W, Robinson C An extended Sahlqvist theorem for hybrid logic (In preparation)"},{"key":"36_CR25","unstructured":"Coumans D, van Gool S On generalizing free algebras for a functor. J Logic Comput"},{"key":"36_CR26","unstructured":"Davey BA, Priestley HA (2002) Lattices and order. Cambridge Univerity Press, Cambridge"},{"issue":"3","key":"36_CR27","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2178\/jsl\/1122038911","volume":"70","author":"JM Dunn","year":"2005","unstructured":"Dunn JM, Gehrke M, Palmigiano A (2005) Canonical extensions and relational completeness of some substructural logics. J Symbolic Logic 70(3):713\u2013740","journal-title":"J Symbolic Logic"},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K Fine","year":"1972","unstructured":"Fine K (1972) In so many possible worlds. Notre Dame J Formal Logic 13:516\u2013520","journal-title":"Notre Dame J Formal Logic"},{"key":"36_CR29","unstructured":"Frittella S, Palmigiano A, Santocanale L Characterizing uniform upper bounds on the length of $$D$$-chains in finite lattices via correspondence theory for monotone modal logic (In preparation)"},{"key":"36_CR30","unstructured":"Gabbay DM, Schmidt RA, Sza\u0142as A (2008) Second-order quantifier elimination: foundations, computational aspects and applications. Vol 12 of studies in logic: mathematical logic and foundations. College Publications, London"},{"key":"36_CR31","unstructured":"Galatos N, Jipsen P, Kowalski T, Ono H (2007) Residuated lattices: an algebraic glimpse at substructural logics. Elsevier, Amsterdam"},{"key":"36_CR32","unstructured":"Gehrke M, J\u00f3nsson B (1994) Bounded distributive lattices with operators. Math Japon 40"},{"key":"36_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.apal.2004.04.007","volume":"131","author":"M Gehrke","year":"2005","unstructured":"Gehrke M, Nagahashi Y, Venema H (2005) A Sahlqvist theorem for distributive modal logic. Ann Pure Appl Logic 131:65\u2013102","journal-title":"Ann Pure Appl Logic"},{"key":"36_CR34","unstructured":"Georgiev D (2006) An implementation of the algorithm SQEMA for computing first-order correspondences of modal formulas, master\u2019s thesis. Sofia University, Faculty of mathematics and computer science"},{"key":"36_CR35","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0168-0072(93)E0084-2","volume":"71","author":"S Ghilardi","year":"1995","unstructured":"Ghilardi S (1995) An algebraic theory of normal forms. Ann Pure Appl Logic 71:189\u2013245","journal-title":"Ann Pure Appl Logic"},{"key":"36_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(96)00048-6","volume":"86","author":"S Ghilardi","year":"1997","unstructured":"Ghilardi S, Meloni G (1997) Constructive canonicity in non-classical logics. Ann Pure Appl Logic 86:1\u201332","journal-title":"Ann Pure Appl Logic"},{"key":"36_CR37","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1093\/logcom\/11.5.737","volume":"11","author":"V Goranko","year":"2001","unstructured":"Goranko V, Vakarelov D (2001) Sahlqvist formulas in hybrid polyadic modal logics. J Logic Comput 11:737\u2013754","journal-title":"J Logic Comput"},{"key":"36_CR38","doi-asserted-by":"crossref","unstructured":"Goranko V, Vakarelov D (2002) Sahlqvist formulas unleashed in polyadic modal languages. In: Wolter F, Wansing H, de Rijke M, Zakharyaschev M (eds) Advances in modal logic, vol 3. World Scientific, Singapore, pp 221\u2013240","DOI":"10.1142\/9789812776471_0012"},{"key":"36_CR39","doi-asserted-by":"crossref","unstructured":"Goranko V, Vakarelov D (2006) Elementary canonical formulae: extending Sahlqvist theorem. Ann Pure Appl Logic 141(1\u20132):180\u2013217","DOI":"10.1016\/j.apal.2005.10.005"},{"key":"36_CR40","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3166\/jancl.19.227-251","volume":"19","author":"S Kikot","year":"2009","unstructured":"Kikot S (2009) An extension of Kracht\u2019s theorem to generalized Sahlqvist formulas. J Appl Non-class Logics 19:227\u2013251","journal-title":"J Appl Non-class Logics"},{"key":"36_CR41","doi-asserted-by":"crossref","unstructured":"Kracht M (1993) How completeness and correspondence theory got married. In: de Rijke M (ed) Diamonds and defaults. Kluwer Academic, Dordrecht, pp 175\u2013214","DOI":"10.1007\/978-94-015-8242-1_7"},{"key":"36_CR42","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1023\/A:1008322125368","volume":"7","author":"N Kurtonina","year":"1998","unstructured":"Kurtonina N (1998) Categorical inference and modal logic. J Logic Lang Inform 7:399\u2013411","journal-title":"J Logic Lang Inform"},{"key":"36_CR43","doi-asserted-by":"publisher","unstructured":"Kurz A, Palmigiano A (2013) Epistemic updates on algebras. Logical Methods Comput Sci 9(4). doi:10.2168\/LMCS-9(4:17)2013","DOI":"10.2168\/LMCS-9(4:17)2013"},{"key":"36_CR44","doi-asserted-by":"crossref","unstructured":"Ma M, Palmigiano A, Sadrzadeh M (2013) Algebraic semantics and model completeness for intuitionistic public announcement logic. Ann Pure Appl Logic 165(4):963\u2013995","DOI":"10.1016\/j.apal.2013.11.004"},{"key":"#cr-split#-36_CR45.1","doi-asserted-by":"crossref","unstructured":"Sahlqvist H (1975) Correspondence and completeness in the first and second-order semantics for modal logic. In: Kanger S","DOI":"10.1016\/S0049-237X(08)70728-6"},{"key":"#cr-split#-36_CR45.2","unstructured":"(ed) Proceedings of the 3rd Scandinavian logic symposium, Uppsala 1973. Springer, Amsterdam, pp 110-143"},{"key":"36_CR46","doi-asserted-by":"publisher","first-page":"992","DOI":"10.2307\/2274758","volume":"54","author":"G Sambin","year":"1989","unstructured":"Sambin G, Vaccaro V (1989) A new proof of Sahlqvist\u2019s theorem on modal definability and completeness. J Symbolic Logic 54:992\u2013999","journal-title":"J Symbolic Logic"},{"issue":"1","key":"36_CR47","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1005298632302","volume":"64","author":"V Sofronie-Stokkermans","year":"2000","unstructured":"Sofronie-Stokkermans V (2000) Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I. Studia Logica 64(1):93\u2013132","journal-title":"Studia Logica"}],"container-title":["Outstanding Contributions to Logic","Johan van Benthem on Logic and Information Dynamics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06025-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T08:50:35Z","timestamp":1676883035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06025-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319060248","9783319060255"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06025-5_36","relation":{},"ISSN":["2211-2758","2211-2766"],"issn-type":[{"type":"print","value":"2211-2758"},{"type":"electronic","value":"2211-2766"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}