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.
منابع مشابه
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
متن کاملHerbrand's Theorem and Equational Reasoning: Problems and Solutions
The famous Herbrand's theorem of mathematical logic plays an important role in automated theorem proving. In the rst part of this article, we recall the theorem and formulate a number of natural decision problems related to it. Somewhat surprisingly, these problems happen to be equivalent. One of these problems is the so-called simultaneous rigid E-uni cation problem. In the second part, we sur...
متن کاملSome Undecidable Problems Related to the Herbrand Theorem
March 1997 (revised July 1997) ISSN 1100{0686 Some Undecidable Problems Related to the Herbrand Theorem Yuri Gurevich Margus Veanes EECS Department Computing Science Department University of Michigan Uppsala University Ann Arbor, MI 48109-2122 Box 311, S-751 05 Uppsala USA Sweden [email protected] [email protected] Abstract We improve upon a number of recent undecidability results related to th...
متن کامل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...
متن کاملDecidability and Complexity of Simultaneous Rigid E-Uni cation with One Variable and Related Results
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...
متن کامل