On the restraining power of guards

Journal of Symbolic Logic 64 (4):1719-1742 (1999)
Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidable classes that avoid the usual syntactic restrictions (on the arity of relation symbols, the quantifier pattern or the number of variables) of almost all other known decidable fragments of first-order logic. Here, we investigate the computational complexity of these fragments. We prove that the satisfiability problems for the guarded fragment (GF) and the loosely guarded fragment (LGF) of first-order logic are complete for deterministic double exponential time. For the subfragments that have only a bounded number of variables or only relation symbols of bounded arity, satisfiability is EXPTIME-complete. We further establish a tree model property for both the guarded fragment and the loosely guarded fragment, and give a proof of the finite model property of the guarded fragment. It is also shown that some natural, modest extensions of the guarded fragments are undecidable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586808
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,664
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Michael Mortimer (1975). On Languages with Two Variables. Mathematical Logic Quarterly 21 (1):135-140.

Add more references

Citations of this work BETA
Johan van Benthem (2012). The Range of Modal Logic. Journal of Applied Non-Classical Logics 9 (2-3):407-442.

View all 14 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

193 ( #19,864 of 1,902,889 )

Recent downloads (6 months)

3 ( #264,800 of 1,902,889 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.