Guarded fragments with constants

Journal of Logic, Language and Information 14 (3):281-288 (2005)
  Copy   BIBTEX

Abstract

We prove ExpTime-membership of the satisfiability problem for loosely ∀-guarded first-order formulas with a bounded number of variables and an unbounded number of constants. Guarded fragments with constants are interesting by themselves and because of their connection to hybrid logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
31 (#488,695)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On the restraining power of guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
The classical decision problem.Egon Boerger - 1997 - New York: Springer. Edited by Erich Grädel & Yuri Gurevich.

View all 11 references / Add more references