Beth definability in the Guarded Fragment
نویسندگان
چکیده
The guarded fragment (GF) was introduced in [1] 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. While GF has been established as a particularly well-behaved fragment of first order logic in many respects, interpolation fails in restriction to GF, [9]. In this paper we consider the Beth property of first order logic and show that, despite the failure of interpolation, it is retained in restriction to GF. The Beth property for GF is here established on the basis of a limited form of interpolation, which more closely resembles the interpolation property that is usually studied in modal logics. ¿From this we obtain that, more specifically, even every n-variable guarded fragment with up to nary relations has the Beth property.
منابع مشابه
Beth Definability for the Guarded Fragment
The guarded fragment (GF) was introduced in ABN98] as a fragment of rst order logic which combines a great expressive power with nice modal behavior. It consists of relational rst order formulas whose quantiiers are relativized by atoms in a certain way. While GF has been established as a particularly well-behaved fragment of rst order logic in many respects, interpolation fails in restriction ...
متن کاملRewriting Guarded Negation Queries
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all unions of conjunctive queries, a restricted form of negation that suffices for expressing some common uses of negation in SQL queries, and a large class of integrity constraints. At the same time, as was recently shown, the syntax of GNFO is restrictive enough so that static analysis problems such as query...
متن کاملBeth Deenability for the Guarded Fragment
The guarded fragment (GF) was introduced in ABN98] as a fragment of rst order logic which combines a great expressive power with nice modal behavior. It consists of relational rst order formulas whose quantiiers are relativized by atoms in a certain way. While GF has been established as a particularly well-behaved fragment of rst order logic in many respects, interpolation fails in restriction ...
متن کاملBeth De nability for the Guarded
The guarded fragment (GF) was introduced in ABN98] as a fragment of rst order logic which combines a great expressive power with nice modal behavior. It consists of relational rst order formulas whose quantiiers are relativized by atoms in a certain way. While GF has been established as a particularly well-behaved fragment of rst order logic in many respects, interpolation fails in restriction ...
متن کاملBeth Definability in Institutions
BETH DEFINABILITY IN INSTITUTIONS MARIUS PETRIA∗ AND RĂZVAN DIACONESCU Abstract. This paper studies definability within the theory of institutions, a version of abstract model This paper studies definability within the theory of institutions, a version of abstract model theory that emerged in computing science studies of software specification and semantics. We generalise the concept of definab...
متن کامل