On the of Limits of Decision: the Adjacent Fragment of First-Order Logic

Bartosz BednarczykBartosz Bednarczyk

Bartosz Bednarczyk
On the of Limits of Decision: the Adjacent Fragment of First-Order Logic
Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming, ICALP 2023, Leibniz International Proceedings in Informatics, to appear. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Details
Bibtex

KurzfassungAbstract
We define 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) two-variable logic as well as the fluted fragment. We show that the adjacent fragment has the finite model property, and its satisfiability problem is no harder than for the fluted fragment, and hence Tower-complete. We further show that any relaxation of the adjacency condition on the allowed order of variables in argument sequences yields a logic whose satisfiability and finite satisfiability problems are undecidable. Finally, we study the effect of the adjacency requirement on the well-known guarded fragment GF of first-order logic. We show that the satisfiability problem for the guarded adjacent fragment (GA) remains TwoExpTime-hard, thus strengthening the known lower bound for GF, but that, in contrast to GF, the fragment GA
has the Craig Interpolation Property.
Projekt:Project: DeciGUT
Forschungsgruppe:Research Group: Computational LogicComputational Logic

@inproceedings{B2023,
  author    = {Bartosz Bednarczyk},
  title     = {On the of Limits of Decision: the Adjacent Fragment of
               First-Order Logic},
  booktitle = {Proceedings of the 50th {EATCS} International Colloquium on
               Automata, Languages and Programming, {ICALP} 2023},
  series    = {Leibniz International Proceedings in Informatics},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2023},
  month     = {July}
}