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

Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
2000 Theoretical Computer Science  
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 ∀ * ∃∀ * fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the ∃∃-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
more » ... ariable and a constant bound on the number of rigid equations is P-complete. 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 right-hand side. We show that SREU is decidable also in this restricted case.
doi:10.1016/s0304-3975(98)00185-6 fatcat:boefe4gcbzhmvk7y7rqrioehuq