Uniform Guarded Fragments
Reijo Jaakkola · Lecture notes in computer science · 2022
Abstract In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem of uniform guarded fragment is NExpTime-complete.