{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:23:55Z","timestamp":1725902635585},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_7","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T11:24:53Z","timestamp":1498649093000},"page":"92-109","source":"Crossref","is-referenced-by-count":5,"title":["Constructive Canonicity for Lattice-Based Fixed Point Logics"],"prefix":"10.1007","author":[{"given":"Willem","family":"Conradie","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Craig","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Palmigiano","sequence":"additional","affiliation":[]},{"given":"Zhiguang","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00045-X","volume":"151","author":"S Ambler","year":"1995","unstructured":"Ambler, S., Kwiatkowska, M., Measor, N.: Duality and the completeness of the modal $$\\mu $$ -calculus. Theoret. Comput. Sci. 151, 3\u201327 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR2","first-page":"2","volume":"13","author":"D Baelde","year":"2012","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Log. (TOCL) 13, 2 (2012)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2011.11.026","volume":"424","author":"N Bezhanishvili","year":"2012","unstructured":"Bezhanishvili, N., Hodkinson, I.: Sahlqvist theorem for modal fixed point logic. Theoret. Comput. Sci. 424, 1\u201319 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1093\/logcom\/exv009","volume":"26","author":"M Bilkova","year":"2016","unstructured":"Bilkova, M., Majer, O., Pelis, M.: Epistemic logics for sceptical agents. J. Log. Comput. 26, 1815\u20131841 (2016)","journal-title":"J. Log. Comput."},{"key":"7_CR5","unstructured":"Britz, C.: Correspondence theory in many-valued modal logics. Master\u2019s thesis, University of Johannesburg, South Africa (2016)"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1093\/logcom\/exx011","volume":"27","author":"W Conradie","year":"2017","unstructured":"Conradie, W., Craig, A.: Canonicity results for mu-calculi: an algorithmic approach. J. Log. Comput. 27, 705\u2013748 (2017)","journal-title":"J. Log. Comput."},{"key":"7_CR7","unstructured":"Conradie, W., Craig, A., Palmigiano, A., Zhao, Z.: Constructive canonicity for lattice-based fixed point logics. ArXiv preprint arXiv:1603.06547"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.tcs.2014.10.027","volume":"564","author":"W Conradie","year":"2015","unstructured":"Conradie, W., Fomatati, Y., Palmigiano, A., Sourabh, S.: Algorithmic correspondence for intuitionistic modal mu-calculus. Theoret. Comput. Sci. 564, 30\u201362 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-52921-8_10","volume-title":"Logic, Language, Information, and Computation","author":"W Conradie","year":"2016","unstructured":"Conradie, W., Frittella, S., Palmigiano, A., Piazzai, M., Tzimoulis, A., Wijnberg, N.M.: Categories: how I learned to stop worrying and love two sorts. In: V\u00e4\u00e4n\u00e4nen, J., Hirvonen, \u00c5., de Queiroz, R. (eds.) WoLLIC 2016. LNCS, vol. 9803, pp. 145\u2013164. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-52921-8_10"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Conradie, W., Frittella, S., Palmigiano, A., Piazzai, M., Tzimoulis, A., Wijnberg, N.M.: Towards an epistemic-logical theory of categorization (2017, submitted). https:\/\/sites.google.com\/site\/willemconradie\/files\/EpLogicalViewCategorization.pdf","DOI":"10.4204\/EPTCS.251.12"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1007\/978-3-319-06025-5_36","volume-title":"Johan van Benthem on Logic and Information Dynamics, Outstanding Contributions to Logic","author":"W Conradie","year":"2014","unstructured":"Conradie, W., Ghilardi, S., Palmigiano, A.: Unified correspondence. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics, Outstanding Contributions to Logic, vol. 5, pp. 933\u2013975. Springer International Publishing, Cham (2014)"},{"key":"7_CR12","unstructured":"Conradie W., Palmigiano, A.: Constructive canonicity of inductive inequalities (submitted). ArXiv preprint arXiv:1603.08341"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.apal.2011.10.004","volume":"163","author":"W Conradie","year":"2012","unstructured":"Conradie, W., Palmigiano, A.: Algorithmic correspondence and canonicity for distributive modal logic. Ann. Pure Appl. Log. 163, 338\u2013376 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"7_CR14","unstructured":"Conradie, W., Palmigiano, A.: Algorithmic correspondence and canonicity for non-distributive logics (submitted). ArXiv preprint arXiv:1603.08515"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Conradie, W., Palmigiano, A., Sourabh, S.: Algebraic modal correspondence: Sahlqvist and beyond. J. Log. Algebr. Methods Program. (2016). doi: 10.1016\/j.jlamp.2016.10.006","DOI":"10.1016\/j.jlamp.2016."},{"key":"7_CR16","unstructured":"Conradie, W., Palmigiano, A., Sourabh, S., Zhao, Z.: Canonicity and relativized canonicity via pseudo-correspondence: an application of ALBA (submitted). ArXiv preprint arXiv:1511.04271"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1093\/logcom\/exx011","volume":"27","author":"W Conradie","year":"2017","unstructured":"Conradie, W., Robinson, C.: On Sahlqvist theory for hybrid logic. J. Log. Comput. 27, 867\u2013900 (2017)","journal-title":"J. Log. Comput."},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"713","DOI":"10.2178\/jsl\/1122038911","volume":"70","author":"JM Dunn","year":"2005","unstructured":"Dunn, J.M., Gehrke, M., Palmigiano, A.: Canonical extensions and relational completeness of some substructural logics. J. Symb. Log. 70, 713\u2013740 (2005)","journal-title":"J. Symb. Log."},{"key":"7_CR19","first-page":"639","volume":"27","author":"S Frittella","year":"2017","unstructured":"Frittella, S., Palmigiano, A., Santocanale, L.: Dual characterizations for finite lattices via correspondence theory for monotone modal logic. J. Log. Comput. 27, 639\u2013678 (2017)","journal-title":"J. Log. Comput."},{"key":"7_CR20","unstructured":"Gavazzo, F.: Investigations into linear logic with fixed-point operators. ILLC MoL thesis (2015)"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1006\/jabr.2000.8622","volume":"238","author":"M Gehrke","year":"2001","unstructured":"Gehrke, M., Harding, J.: Bounded lattice expansions. J. Algebra 238, 345\u2013371 (2001)","journal-title":"J. Algebra"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0168-0072(96)00048-6","volume":"86","author":"S Ghilardi","year":"1997","unstructured":"Ghilardi, S., Meloni, G.: Constructive canonicity in non-classical logics. Ann. Pure Appl. Log. 86, 1\u201332 (1997)","journal-title":"Ann. Pure Appl. Log."},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Greco, G., Ma, M., Palmigiano, A., Tzimoulis, A., Zhao, Z.: Unified correspondence as a proof-theoretic tool. J. Log. Comput. (2016). doi: 10.1093\/logcom\/exw022","DOI":"10.1093\/logcom\/exw022"},{"key":"7_CR24","doi-asserted-by":"crossref","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. Stud. Logica 53, 473\u2013491 (1994)","journal-title":"Stud. Logica"},{"key":"7_CR25","first-page":"921","volume":"27","author":"M Ma","year":"2017","unstructured":"Ma, M., Zhao, Z.: Unified correspondence and proof theory for strict implication. J. Log. Comput. 27, 921\u2013960 (2017)","journal-title":"J. Log. Comput."},{"key":"7_CR26","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1093\/logcom\/exv041","volume":"27","author":"A Palmigiano","year":"2017","unstructured":"Palmigiano, A., Sourabh, S., Zhao, Z.: J\u00f3nsson-style canonicity for ALBA-inequalities. J. Log. Comput. 27, 817\u2013865 (2017)","journal-title":"J. Log. Comput."},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1093\/logcom\/exv041","volume":"27","author":"A Palmigiano","year":"2017","unstructured":"Palmigiano, A., Sourabh, S., Zhao, Z.: Sahlqvist theory for impossible worlds. J. Log. Comput. 27, 775\u2013816 (2017)","journal-title":"J. Log. Comput."},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0049-237X(08)70728-6","volume":"82","author":"H Sahlqvist","year":"1975","unstructured":"Sahlqvist, H.: Completeness and correspondence in the first and second order semantics for modal logic. Stud. Log. Found. Math. 82, 110\u2013143 (1975)","journal-title":"Stud. Log. Found. Math."},{"issue":"3","key":"7_CR29","doi-asserted-by":"crossref","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. J. Symb. Log. 54(3), 992\u2013999 (1989)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T09:16:48Z","timestamp":1569575808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}
