Decidability and Complexity of Simultaneous Rigid E-Uni cation with One Variable and Related Results

نویسندگان

  • Anatoli Degtyarev
  • Yuri Gurevich
  • Paliath Narendran
  • Margus Veanes
  • Andrei Voronkov
چکیده

We show that simultaneous rigid E-uni cation, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classi cation of decidability of the prenex fragment of intuitionistic logic with equality, in terms of the quanti er pre x. It is also proved that SREU with one variable and a constant bound on the number of rigid equations is Pcomplete. Moreover, we consider a case of SREU where one allows several variables, but each rigid equation either contains one variable, or has a ground left-hand side and an equality between two variables as a righthand side. We show that SREU is decidable also in this restricted case.

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

ثبت نام

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

منابع مشابه

Monadic Simultaneous Rigid E-Uni cation and Related Problems

We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.

متن کامل

The Decidability of Simultaneous Rigid E-Uni cation with One Variable

We show that simultaneous rigid E-uni cation, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classi cation of decidability of the prenex fragment of intuitio...

متن کامل

Monadic Simultaneous Rigid E-Unification and Related Problems

We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. 1 Section

متن کامل

The Decidability of Simultaneous RigidE - Uni cation with One

We show that simultaneous rigid E-uniication, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classiication of decidability of the prenex fragment of intuitio...

متن کامل

Decidability and complexity of simultaneous rigid E-unification with one variable and related results

We show that simultaneous rigid E-uniication, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classiication of decidability of the prenex fragment of intuitio...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1998