On the uniform one-dimensional fragment over ordered models

Abstract

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 thesis we show that the satisfiability and finite satisfiability problems of U1 over linearly ordered models are NExpTime-complete. The corresponding problems for FO2 are likewise NExpTime-complete, so the transition from FO2 to U1 in the ordered realm causes no increase in complexity. To contrast our results, we also establish that U1 with an unrestricted use of two built-in linear orders is undecidable.