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

We define the adjacent fragment 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 that its satisfiability problem is no harder than for the fluted fragment (and hence is \({\rm 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 of first-order logic. We show that the satisfiability problem for the guarded adjacent fragment remains \(2{\rm ExpTime}\)-hard, thus strengthening the known lower bound for the guarded fragment.

Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
Download Paper