Abstract
The guarded fragment with transitive guards, [GF+TG], is an extension of the guarded fragment of first-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. Moreover, we show that the problem is in 2E XPTIME. This result is optimal since the satisfiability problem for GF is 2E XPTIME-complete (J. Symbolic Logic 64 (1999) 1719–1742). We also show that the satisfiability problem for two-variable [GF+TG] is N EXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability problem is E XPTIME-complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
