English
Related papers

Related papers: Uniform Guarded Fragments

200 papers

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…

Logic in Computer Science · Computer Science 2025-09-03 Balder ten Cate , Jesse Comer

We show that the guarded-negation fragment (GNFO) is, in a precise sense, the smallest extension of the guarded fragment (GFO) with Craig interpolation. In contrast, %we show that the smallest extension of the two-variable fragment (FO2)…

Logic in Computer Science · Computer Science 2023-04-18 Balder ten Cate , Jesse Comer

The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a…

Logic in Computer Science · Computer Science 2021-01-26 Emanuel Kieroński , Sebastian Rudolph

We study the guarded negation fragment of transitive closure logic (GNTC). We show that the satisfiability problem for GNTC is 2ExpTime-complete, by establishing the following reductions: (i) a polynomial-time reduction from the…

Logic in Computer Science · Computer Science 2026-05-20 Diego Figueira , Santiago Figueira , Yoshiki Nakamura

The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragment FO2. The logic U1 enables the use of relation symbols of all arities and thereby extends the scope of applications of FO2. In this…

Logic · Mathematics 2018-12-21 Jonne Iso-Tuisku , Antti Kuusisto

We study the Guarded Fragment with Regular Guards (RGF), which combines the expressive power of the Guarded Fragment (GF) with Propositional Dynamic Logic with Intersection and Converse (ICPDL). Our logic generalizes, in a uniform way, many…

Logic in Computer Science · Computer Science 2025-09-12 Bartosz Bednarczyk , Emanuel Kieroński

We show that a vast class of finitary fragments of geometric logic admit a form of Craig interpolation property. In doing so, we provide a new dictionary to import technology from algebraic logic to categorical logic.

Logic · Mathematics 2026-01-29 Ivan Di Liberti , Lingyuan Ye

Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a…

Logic · Mathematics 2025-08-14 Agi Kurucz , Frank Wolter , Michael Zakharyaschev

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

Logic in Computer Science · Computer Science 2025-06-27 Amirhossein Akbar Tabatabai , Raheleh Jalali

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…

Logic in Computer Science · Computer Science 2023-10-03 Emanuel Kieroński

We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…

Logic · Mathematics 2023-08-04 Wesley Fussner , Simon Santschi

We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges…

Logic in Computer Science · Computer Science 2024-09-04 Chia-Hsuan Lu , Tony Tan

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…

Logic in Computer Science · Computer Science 2025-01-14 Stefan Hetzl , Raheleh Jalali

We introduce the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) the two-variable fragment…

Logic in Computer Science · Computer Science 2024-09-04 Bartosz Bednarczyk , Daumantas Kojelis , Ian Pratt-Hartmann

Uniform interpolation properties are defined for equational consequence in a variety of algebras and related to properties of compact congruences on first the free and then the finitely presented algebras of the variety. It is also shown,…

Logic · Mathematics 2019-04-15 S. J. v. Gool , G. Metcalfe , C. Tsinakis

We study the fixed point property and the Craig interpolation property for sublogics of the interpretability logic $\mathbf{IL}$. We provide a complete description of these sublogics concerning the uniqueness of fixed points, the fixed…

Logic · Mathematics 2020-08-07 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In logics with the projective Beth definability property (PBDP), the existence of an…

Logic in Computer Science · Computer Science 2021-04-20 Jean Christoph Jung , Frank Wolter

In this article, a model-theoretic approach is proposed to prove that the first-order G\"odel logic, $\mathbf{G}$, as well as its extension $\mathbf{G}^\Delta$ associated with first-order relational languages enjoy the Craig interpolation…

We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in…

Logic in Computer Science · Computer Science 2022-06-24 Bartosz Bednarczyk , Reijo Jaakkola
‹ Prev 1 2 3 10 Next ›