Submitted to Journal of Symbolic Logic
We define the adjacent fragment of first-order logic (with equality) and establish decidability of satisfiability.
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
Download Paper
Published in 33rd EACSL Annual Conference on Computer Science Logic, 2025
We show that satisfiable fluted sentences admit special kinds of “nice” models which we call globally/locally homogeneous. We establish that the fluted fragment with periodic counting is decidable for satisfiability, whilst the adjacent fragment with counting is not.
Daumantas Kojelis
Download Paper
Published in 50th International Colloquium on Automata, Languages, and Programming, 2023
We define the adjacent fragment of first-order logic (without equality) and establish decidability of satisfiability.
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
Download Paper
Published in European Summer School in Logic, Language and Information, 2022
We show that the satisfiability problem of the Ackermann fragment with equality, when the number of trailing existential quantifiers is bounded, is \({\rm ExpTime}\)-complete.
Daumantas Kojelis
Download Paper