Abstract
The guarded fragment (GF) was introduced by Andréka, van Benthem and Németi as a fragment of first order logic which combines a great expressive power with nice, modal behavior. It consists of relational first order formulas whose quantifiers are relativized by atoms in a certain way. Slightly generalizing the admissible relativizations yields the packed fragment (PF). In this paper we investigate interpolation and definability in these fragments. We first show that the interpolation property of first order logic fails in restriction to GF and PF. However, each of these fragments turns out to have an alternative interpolation property that closely resembles the interpolation property usually studied in modal logic. These results are strong enough to entail the Beth definability property for GF and PF. Even better, every guarded or packed finite variable fragment has the Beth property. For interpolation, we characterize exactly which finite variable fragments of GF and PF enjoy this property.
This is a preview of subscription content, log in via an institution to check access.
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. J. of Philosophical Logic27(3):217-274.
Andréka, H., Hodkinson, I., and Németi, I. (1999). Finite algebras of relations are representable on finite sets. J. Symbolic Logic64:243-267.
Comer, S. (1969). Classes without the amalgamation property. Pacific J. of Mathematics28:309-318.
Day, A. (1972). Varieties of Heyting algebras, II. Manuscript.
Gabbay, D. (1972). Craig's interpolation theorem for modal logics. In Hodges, W., editor, Conf. in Math. Logic—London '70, volume 255 of Lecture Notes in Math., pages 111-127. Springer-Verlag.
Grädel, E. (1999a). Decision procedures for guarded logics. In Automated Deduction–CADE16. Proc. of 16th Int. Conf. on Automated Deduction, Trento, 1999, volume 1632 of LNCS. Springer-Verlag.
Grädel, E. (1999b). On the restraining power of guards. J. Symbolic Logic64(4):1719-1742.
Grädel, E. (2001). Guarded fixed point logics and the monadic theory of countable trees. Theoretical Computer Science. To appear.
Grädel, E. and Walukiewicz, I. (1999). Guarded Fixed Point Logic. In Proc. 14th Symp. on Logic in Computer Science, LICS '99, pages 45-54.
Henkin, L., Monk, J. D., and Tarski, A. (1971 & 1985). Cylindric Algebras, Parts I & II. North-Holland.
Hodkinson, I. (1993). Finite variable logics. Bull. Europ. Assoc. Theor. Comp. Sci.51:111-140. Addendum in vol. 52.
Hodkinson, I. (2001). Loosely guarded fragment of first-order logic has the finite model property. Studia Logica70:205-240.
Hoogland, E. (2001). Definability and interpolation. PhD thesis, Institute for Logic, Language and Computation. University of Amsterdam.
Hoogland, E., Marx, M., and Otto, M. (1999). Beth definability for the guarded fragment. In Ganzinger, H., McAllester, D., and Voronkov, A., editors, Logic for Programming and Automated Reasoning, 6th Int. Conf. LPAR99, volume 1705 of LNAI, pages 273-285. Springer.
Maksimova, L. (1980). Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras. Algebra and Logic18(5):348-370.
Maksimova, L. (1992). An analog of Beth's theorem in normal extensions of the modal logic K4. Siberian Mathematical Journal33(6):1052-1065.
Marx, M. (1997). Complexity of modal logics of relations. Technical Report ML-97-02, Institute for Logic, Language and Computation, University of Amsterdam.
Marx, M. (1999). Interpolation in modal logic. In Algebraic methodology and software technology (Amazonia, 1999), pages 154-163. Springer, Berlin.
Marx, M. (2001). Tolerance logic. J. of Logic, Language and Information10(3):353-373.
Marx, M. and Areces, C. (1998). Failure of interpolation in combined modal logics. Notre Dame J. of Formal Logic39(2):253-273.
Németi, I. (1985). Cylindric relativised set algebras have strong amalgamation. J. of Symbolic Logic50(3):689-700.
Orłowska, E., editor (1999). Logic at Work. Essays Dedicated to the Memory of Elena Rasiowa. Studies in Fuzziness and Soft Computing. Springer Verlag, Berlin/Heidelberg.
Pigozzi, D. (1972). Amalgamation, congruence extension and interpolation properties in algebras. Algebra Universalis1(3):269-349.
Sain, I. (1990). Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic. In Algebraic logic and universal algebra in computer science, volume 24 of Lecture Notes in Computer Science, pages 209-226. Springer-Verlag, Berlin.
van Benthem, J. (1997). Dynamic bits and pieces. Technical Report LP-97-01, Institute for Logic, Language and Computation, University of Amsterdam.
van Benthem, J. (1998). Modal logic in two gestalts. Technical Report ML-98-12, Institute for Logic, Language and Computation, University of Amsterdam.
van Benthem, J. (1999). Modal foundations for predicate logic. In [Orłowska, 1999], pages 39-55.
Vardi, M. (1998). Why is modal logic so robustly decidable? In Immerman, N. and Kolaitis, P., editors, Descriptive Complexity and Finite Models: Proc.of a DIMACS Workshop, volume 31 of Series in Discrete Math. and Theoretical Computer Science, pages 149-184. American Math. Society.
Venema, Y. and Marx, M. (1999). A modal logic of relations. In [Orłowska, 1999], pages 124-167.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hoogland, E., Marx, M. Interpolation and Definability in Guarded Fragments. Studia Logica 70, 373–409 (2002). https://doi.org/10.1023/A:1015154431342
Issue Date:
DOI: https://doi.org/10.1023/A:1015154431342