Uniform Guarded Fragments
Logic in Computer Science
2021-10-15 v2 Logic
Abstract
In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of the guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem of uniform guarded fragment is NEXPTIME-complete.
Cite
@article{arxiv.2110.03821,
title = {Uniform Guarded Fragments},
author = {Reijo Jaakkola},
journal= {arXiv preprint arXiv:2110.03821},
year = {2021}
}
Comments
Fixed a bug in the proof of lemma 8, simplified the proof of lemma 9 and minor changes to presentation