Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality

Abstract

Uniform one-dimensional fragment \(UF_1^=\) is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified formula. The fragment is closed under Boolean operations, but additional restrictions (called uniformity conditions) apply to combinations of atomic formulas with two or more variables. \(UF_1^=\) can be seen as a canonical generalization of two-variable logic, defined in order to be able to deal with relations of arbitrary arities. \(UF_1^=\) was introduced recently, and it was shown that the satisfiability problem of the equality-free fragment UF₁ of \(UF_1^=\) is decidable. In this article we establish that the satisfiability and finite satisfiability problems of \(UF_1^=\) are NEXPTIME-complete. We also show that the corresponding problems for the extension of \(UF_1^=\) with counting quantifiers are undecidable. In addition to decidability questions, we compare the expressivities of \(UF_1^=\) and two-variable logic with counting quantifiers FOC². We show that while the logics are incomparable in general, \(UF_1^=\) is strictly contained in FOC² when attention is restricted to vocabularies with the arity bound two.