uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
Show others and affiliations
2000 (English)In: THEORETICAL COMPUTER SCIENCE, ISSN 0304-3975, Vol. 243, no 1-2, 167-184 p.Article in journal (Refereed) Published
Abstract [en]

We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the For All*There Exists For All* fragment of intuitionistic logic with equality is decidable

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2000. Vol. 243, no 1-2, 167-184 p.
Keyword [en]
rigid E-unification; finite tree automata; logic with equality; INTUITIONISTIC LOGIC; MATINGS; SYSTEMS
URN: urn:nbn:se:uu:diva-36493OAI: oai:DiVA.org:uu-36493DiVA: diva2:64392
Addresses: Veanes M, Max Planck Inst Informat, Stadtwald, D-66123 Saarbrucken, Germany. Max Planck Inst Informat, D-66123 Saarbrucken, Germany. Univ Uppsala, Dept Comp Sci, S-75105 Uppsala, Sweden. Univ Michigan, Dept EECS, Ann Arbor, MI 48109 USA. SUNY AAvailable from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 201 hits
ReferencesLink to record
Permanent link

Direct link