{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,20]],"date-time":"2024-01-20T15:10:45Z","timestamp":1705763445104},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,1,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We characterize non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations because they relate pairs of states from one model to single states from another. En route to this result, we use a more traditional notion of simulations and prove a Hennessy\u2013Milner-style theorem for it, using an analogue of modal saturation called meet-compactness.<\/jats:p>","DOI":"10.1093\/logcom\/exad003","type":"journal-article","created":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T18:32:41Z","timestamp":1677695561000},"page":"180-196","source":"Crossref","is-referenced-by-count":0,"title":["Non-distributive positive logic as a fragment of first-order logic over semilattices"],"prefix":"10.1093","volume":"34","author":[{"given":"Jim","family":"de Groot","sequence":"first","affiliation":[{"name":"The Australian National University , School of Computing,108 North Rd, Acton ACT 2601, Canberra, Ngunnawal Country, Australia"}]}],"member":"286","published-online":{"date-parts":[[2023,2,28]]},"reference":[{"key":"2024012014561744900_ref1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.ic.2017.01.002","article-title":"Model theory of XPath on data trees. Part II: Binary bisimulation and definability","volume":"255","author":"Abriola","year":"2017","journal-title":"Information and Computation"},{"key":"2024012014561744900_ref2","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1007\/s11225-016-9664-1","article-title":"Bi-simulating in bi-intuitionistic logic","volume":"104","author":"Badia","year":"2016","journal-title":"Studia Logica"},{"key":"2024012014561744900_ref3","volume-title":"Modal Correspondence Theory","author":"van Benthem","year":"1976"},{"key":"2024012014561744900_ref4","article-title":"Relational patterns, partiality, and set lifting in modal semantics","author":"van Benthem","year":"2022","journal-title":"Saul Kripke on Modality"},{"key":"2024012014561744900_ref5","article-title":"Positive (modal) logic beyond distributivity","author":"Bezhanishvili","year":"2022"},{"key":"2024012014561744900_ref6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"Blackburn","year":"2001"},{"key":"2024012014561744900_ref7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-616","article-title":"A note on the model theory for positive modal logic","volume":"114","author":"Celani","year":"2012","journal-title":"Fundamenta Informaticae"},{"key":"2024012014561744900_ref8","volume-title":"Model Theory","author":"Chang","year":"1973"},{"key":"2024012014561744900_ref9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.2307\/2273560","article-title":"Some useful preservation theorems","volume":"48","author":"Compton","year":"1983","journal-title":"The Journal of Symbolic Logic"},{"key":"2024012014561744900_ref10","volume-title":"Non-distributive logics: from semantics to meaning","author":"Conradie","year":"2021"},{"key":"2024012014561744900_ref11","volume-title":"Positive modal logic beyond distributivity: Duality, preservation and completeness","author":"Dmitrieva","year":"2021"},{"key":"2024012014561744900_ref12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1093\/logcom\/exu018","article-title":"Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations","volume":"25","author":"Fletcher","year":"2015","journal-title":"Journal of Logic and Computation"},{"key":"2024012014561744900_ref13","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s11225-021-09975-w","article-title":"Hennessy\u2013Milner and Van Benthem for instantial neighbourhood logic","volume":"110","author":"de Groot","year":"2022","journal-title":"Studia Logica"},{"key":"2024012014561744900_ref14","volume-title":"Monotonic modal logics","author":"Hansen","year":"2003"},{"key":"2024012014561744900_ref15","first-page":"1","article-title":"Neighbourhood structures: Bisimilarity and basic model theory","volume":"5","author":"Hansen","year":"2009","journal-title":"Logical Methods in Computer Science"},{"key":"2024012014561744900_ref16","first-page":"294","article-title":"The expressive power of modal dependence logic","volume-title":"Proc. AIML 2014","author":"Hella","year":"2014"},{"key":"2024012014561744900_ref17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"Journal of the Association for Computing Machinery"},{"key":"2024012014561744900_ref18","first-page":"353","article-title":"Modal independence logic","volume-title":"Proc. AIML 2014","author":"Kontinen","year":"2014"},{"key":"2024012014561744900_ref19","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1093\/logcom\/7.4.501","article-title":"Simulating without negation","volume":"7","author":"Kurtonina","year":"1997","journal-title":"Journal of Logic and Computation"},{"key":"2024012014561744900_ref20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02120877","article-title":"A general approach to non-distributive logics","volume":"35","author":"Luisa","year":"1976","journal-title":"Studia Logica"},{"key":"2024012014561744900_ref21","volume-title":"Intuitionistic Correspondence Theory","author":"Rodenburg","year":"1986"},{"key":"2024012014561744900_ref22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02485369","article-title":"A topological representation theory for lattices","volume":"8","author":"Urquhart","year":"1978","journal-title":"Algebra Universalis"},{"key":"2024012014561744900_ref23","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1016\/j.apal.2017.01.007","article-title":"Propositional team logics","volume":"168","author":"Yang","year":"2017","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/34\/1\/180\/56260271\/exad003.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/34\/1\/180\/56260271\/exad003.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,20]],"date-time":"2024-01-20T14:56:36Z","timestamp":1705762596000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/34\/1\/180\/7058947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,28]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,2,28]]},"published-print":{"date-parts":[[2024,1,22]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exad003","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,1]]},"published":{"date-parts":[[2023,2,28]]}}}