Interpolation, Deenability and Fixed Points in Interpretability Logics

نویسندگان

  • Carlos Areces
  • Eva Hoogland
  • Dick de Jongh
چکیده

abstract. In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the-modality easily follow from this result. Furthermore , these properties are extended to the system ILP. Failure of arrow interpolation for ILW is established by providing an explicit counterexample. The related issues of Beth deenability and xed points are also addressed. It will be shown that for a general class of logics the Beth property and the xed point property are interderiv-able. This in particular yields alternative proofs for the xed point theorem for IL (cf. de Jongh and Visser 1991) and the Beth theorem for all provability logics (cf. Maksimova 1989). Moreover, it entails that all extensions of IL have the Beth property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Interpolation Theorem for IL and ILP

In this article we establish interpolation for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the-modality easily follow from this. Furthermore, these properties are extended to the system ILP. The related issue of Beth Deenability is also addressed. As usual, the arrow interpolation property...

متن کامل

Interpolation, Definability and Fixed Points in Interpretability Logics

In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the -modality easily follow from this result. Furthermore, these properties are extended to the system ILP. Failure of arrow interpolation for ILW is established by providing an explicit count...

متن کامل

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 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 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000