{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T01:27:44Z","timestamp":1700443664737},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We elaborate on semantically labelled syntax trees that provide a method of proving the non-existence of modal formulae satisfying certain syntactic properties and defining a given class of frames and use them to show that there are classes of Kripke frames that are definable by both non-Sahlqvist and Sahlqvist formulae, but the latter requires more propositional variables.<\/jats:p>","DOI":"10.1093\/jigpal\/jzac044","type":"journal-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T11:18:26Z","timestamp":1649935106000},"page":"483-509","source":"Crossref","is-referenced-by-count":1,"title":["On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae"],"prefix":"10.1093","volume":"31","author":[{"given":"Petar","family":"Iliev","sequence":"first","affiliation":[{"name":"Institute of Mathematics and Informatics , and Institute of Philosophy and Sociology, Bulgarian Academy of Sciences, 1000 Sofia, Bulgaria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,4,27]]},"reference":[{"key":"2023052700431054400_ref1","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/772062.772064","volume":"4","author":"Adler","year":"2003","journal-title":"ACM Transactions on Computational Logic"},{"key":"2023052700431054400_ref2","first-page":"83","article-title":"Frame validity games and absolute minimality of modal axioms","volume-title":"Proceedings of Advances in Modal Logic","author":"Balbiani","year":"2018"},{"key":"2023052700431054400_ref3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1093\/jigpal\/jzaa068","article-title":"Frame-validity games and lower bounds on the complexity of modal axioms","volume":"30","author":"Balbiani","year":"2022","journal-title":"Logic Journal of the IGPL"},{"key":"2023052700431054400_ref4","volume-title":"Modal Logic","author":"Blackburn","year":"2010"},{"key":"2023052700431054400_ref5","article-title":"Oxford Logic Guides","volume-title":"Modal Logic","author":"Chagrov","year":"1997"},{"key":"2023052700431054400_ref6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.jlamp.2016.10.006","article-title":"Algebraic modal correspondence: Sahlqvist and beyond","volume":"91","author":"Conradie","year":"2017","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"key":"2023052700431054400_ref7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/11663081.2016.1144016","article-title":"The succinctness of the cover modality","volume":"25","author":"van Ditmarsch","year":"2015","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"2023052700431054400_ref8","first-page":"827","article-title":"Succinctness in subsystems of the spatial $\\mu $-calculus","volume":"5","author":"Fern\u00e1ndez-Duque","year":"2018","journal-title":"Journal of Applied Logics\u2014IfCoLoG Journal of Logics and their Applications"},{"key":"2023052700431054400_ref9","first-page":"114","article-title":"On the size of shortest modal descriptions","volume-title":"Proceedings of Advances in Modal Logic","author":"Figueira","year":"2010"},{"key":"2023052700431054400_ref10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.artint.2013.02.003","article-title":"On the succinctness of some modal logics","volume":"197","author":"French","year":"2013","journal-title":"Artificial Intelligence"},{"key":"2023052700431054400_ref11","first-page":"881","article-title":"Succinctness of epistemic languages","volume-title":"Proceedings of IJCAI","author":"French","year":"2011"},{"key":"2023052700431054400_ref12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.apal.2005.10.005","article-title":"Elementary canonical formulae: extending Sahlqvist\u2019s theorem","volume":"141","author":"Goranko","year":"2006","journal-title":"Annals of Pure and Applied Logic"},{"key":"2023052700431054400_ref13","first-page":"1","article-title":"The succinctness of first-order logic on linear orders","volume":"1","author":"Grohe","year":"2005","journal-title":"Logical Methods in Computer Science"},{"key":"2023052700431054400_ref14","first-page":"401","article-title":"The succinctness of first-order logic over modal logic via a formula size game","volume-title":"Proceedings of Advances in Modal Logic","author":"Hella","year":"2016"},{"key":"2023052700431054400_ref15","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1093\/logcom\/exz025","article-title":"Formula size games for modal logic and $\\mu $-calculus","volume":"29","author":"T Hella","year":"2019","journal-title":"Journal of Logic and Computation"},{"key":"2023052700431054400_ref16","first-page":"341","article-title":"On the relative succinctness of modal logics with union, intersection and quantification","volume-title":"Proceedings of AAMAS","author":"van der Hoek","year":"2014"},{"key":"2023052700431054400_ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2566-9_8","article-title":"On proving lower bounds for circuit size","volume-title":"Feasible Mathematics II","author":"Karchmer","year":"1995"},{"key":"2023052700431054400_ref18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02122698","article-title":"Applications of matrix methods to the theory of lower bounds in computational complexity","volume":"10","author":"Razborov","year":"1990","journal-title":"Combinatorica"},{"key":"2023052700431054400_ref19","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0049-237X(08)70728-6","article-title":"Completeness and correspondence in the first and second order semantics for modal logic","volume":"82","author":"Sahlqvist","year":"1975","journal-title":"Proceedings of the Third Scandinavian Logic Symposium"},{"key":"2023052700431054400_ref20","doi-asserted-by":"crossref","first-page":"992","DOI":"10.2307\/2274758","article-title":"A new proof of Sahlqvist\u2019s theorem on modal definability and completeness","volume":"54","author":"Sambin","year":"1989","journal-title":"The Journal of Symbolic Logic"},{"key":"2023052700431054400_ref21","first-page":"499","article-title":"Modal definability in languages with a finite number of propositional variables and a new extension of the Sahlqvist\u2019s class","volume-title":"Proceedings of Advances in Modal Logic","author":"Vakarelov","year":"2003"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/31\/3\/483\/50460879\/jzac044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/31\/3\/483\/50460879\/jzac044.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:43:54Z","timestamp":1685148234000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/31\/3\/483\/6573336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,27]]},"references-count":21,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,4,27]]},"published-print":{"date-parts":[[2023,5,25]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzac044","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,6]]},"published":{"date-parts":[[2022,4,27]]}}}