Abstract
AbstractIn 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.
Publisher
Springer International Publishing
Reference20 articles.
1. Andréka, H., Németi, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217–274 (1998)
2. Bárány, V., Benedikt, M., Cate, B.T.: Some model theory of guarded negation. The Journal of Symbolic Logic 83, 1307 – 1344 (2018)
3. Bell, J., Slomson, A.: Models and Ultraproducts: An Introduction. Dover Books on Mathematics Series, Dover Publications (2006)
4. van Benthem, J.: The many faces of interpolation. Synthese 164(3), 451–460 (2008)
5. Blackburn, P., Rijke, M.d., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (2001)