{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:43:33Z","timestamp":1757630613326,"version":"3.44.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,5,22]]},"abstract":"<jats:p>We show that the guarded-negation fragment is, in a precise sense, the smallest extension of the guarded fragment with Craig interpolation. In contrast, we show that full first-order logic is the smallest extension of both the two-variable fragment and the forward fragment with Craig interpolation. Similarly, we also show that all extensions of the two-variable fragment and of the fluted fragment with Craig interpolation are undecidable.<\/jats:p>","DOI":"10.46298\/lmcs-21(3:22)2025","type":"journal-article","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T18:46:33Z","timestamp":1757529993000},"source":"Crossref","is-referenced-by-count":0,"title":["Craig Interpolation for Decidable First-Order Fragments"],"prefix":"10.46298","volume":"Volume 21, Issue 3","author":[{"given":"Balder ten","family":"Cate","sequence":"first","affiliation":[]},{"given":"Jesse","family":"Comer","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,8,29]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2310.08689v6","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2310.08689v6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T18:46:33Z","timestamp":1757529993000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/14096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-21(3:22)2025","relation":{"has-preprint":[{"id-type":"arxiv","id":"2310.08689v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2310.08689v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2310.08689","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2310.08689","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"article-number":"14096"}}