Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic
AUSCRYPT '90 Proceedings of the international conference on cryptology on Algebraic logic and universal algebra in computer science
Theoretical Computer Science
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
The gueirded fragment (GF) was introduced in [ABN98] as a fragment of first order logic which combines a great expressive power with nice modal behavior. It consists of relationeil first order formulas whose qucintiiiers are relativized by atoms in a certain way. While GF hsis been established as a particularly well-behaved fragment of first order logic in many respects, interpolation fails in restriction to GF, [HM99]. 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. Being a closure property w.r.t. definability, the Beth property is of independent interest, both theoretically and for typical potential appUcations of GF, e.g., in the context of description logics. 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 n-ary relations has the Beth property.