Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter

نویسندگان

  • Mikhail N. Rybakov
  • Dmitry Shkatov
چکیده

We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we consider semantics with expanding or constant domains. We then generalise this result to intervals [QBL,QKC] and [QBL,QFL], where QKC is the logic of the weak law of the excluded middle and QBL and QFL are first-order counterparts of Visser’s basic and formal logics, respectively. We also show that, for most “natural” firstorder modal logics, the two-variable fragment with a single monadic predicate letter, without constants and equality, is undecidable, regardless of whether we consider semantics with expanding or constant domains. These include all sublogics ofQKTB, QGL, and QGrz—among them, QK, QT, QKB, QD, QK4, and QS4.

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

ثبت نام

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

منابع مشابه

Undecidability of first-order intuitionistic and modal logics with two variables

We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the twovariable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of pra...

متن کامل

On 2 nd Order Intuitionistic Propositional Calculus with Full Comprehension

(x not free in A, HPC is Heyting's predicate calculus) for the class of Kripke models of constant domains. See G6rnemann [1] for an algebraic completeness proof and Gabbay I-2] for other details. The proof of undecidability uses the same method introduced in Gabbay [3, 4] and used to obtain undecidability results for a large class of intuitionistic theories. Although some versions of the monadi...

متن کامل

On Decidability of Intuitionistic Modal Logics

We prove a general decidability result for a class of intuitionistic modal logics. The proof is a slight modification of the Ganzinger, Meyer and Veanes [6] result on decidability of the two variable monadic guarded fragment of first order logic with constraints on the guard relations expressible in monadic second order logic.

متن کامل

A general method for proving decidability of intuitionistic modal logics

We generalise the result of [H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 24–34] on decidability of the two variable monadic guarded fragment of first order logic with constraints on the guard relations expressible in monadic second order logic. I...

متن کامل

Methods for Modalities 3 Carlos Areces

We generalise the result of Ganzinger, Meyer and Veanes [14] on decidability of the two variable monadic guarded fragment of first order logic with constraints on the guard relations expressible in monadic second order logic. In [14], such constraints apply to one relation at a time. We modify their proof to obtain decidability for constraints involving several relations. Now we can use this re...

متن کامل

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


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

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

دوره abs/1706.05060  شماره 

صفحات  -

تاریخ انتشار 2017