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.
Similar content being viewed by others
References
Andréka, H., van Benthem, J., and Németi, I., 1998, “Modal logics and bounded fragments of predicate logic,” Journal of Philosophical Logic 27(3), 217–274.
Blackburn, P., 2000, “Representation, reasoning, and relational structures: A hybrid logic manifesto,” Logic Journal of the IGPL 8(3), 339–365.
Börger, E., Grädel, E., and Gurevich, Y., 1997, The Classical Decision Problem, Berlin: Springer.
Grädel, E., 1999, “On the restraining power of guards,” Journal of Symbolic Logic 64, 1719–1742.
Hoogland, E. and Marx, M., 2002, “Interpolation and definability in guarded fragments,” Studia Logica 70(3), 373–409.
Marx, M., 2001, “Tolerance logic,” Journal of Logic, Language, and Information 10(3), 353–373.
ten Cate, B., 2005, ‘Interpolation for extended modal languages,” Journal of Symbolic Logic 70(1), 223–234.
ten Cate, B. and Franceschet, M., 2004, “Guarded fragments with constants,” Technical Report PP-2004-32, ILLC, Universiteit van Amsterdam. Available from http://www.illc.uva.nl/Publications/ResearchReports/PP-2004-32.text.pdf.
van Benthem, J.: 1997, “Dynamic bits and pieces,” Technical Report LP-97-01, ILLC, University of Amsterdam. Available from http://www.illc.uva.nl/Publications/ResearchReports/LP-1997-01.text.pdf.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cate, B.t., Franceschet, M. Guarded Fragments with Constants. J Logic Lang Inf 14, 281–288 (2005). https://doi.org/10.1007/s10849-005-5787-x
Issue Date:
DOI: https://doi.org/10.1007/s10849-005-5787-x