A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
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
doi:10.1016/s0304-3975(98)00185-6
fatcat:boefe4gcbzhmvk7y7rqrioehuq