\(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(\forall \exists^{5}\)-equational theory of context unification is undecidable |
scientific article; zbMATH DE number 1774107
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\forall \exists^{5}\)-equational theory of context unification is undecidable |
scientific article; zbMATH DE number 1774107 |
Statements
\(\forall \exists^{5}\)-equational theory of context unification is undecidable (English)
0 references
31 July 2002
0 references
context unification problem
0 references
second-order unification
0 references
word unification
0 references
equational theory
0 references
quantified fragments
0 references
undecidability
0 references
operator algorithms
0 references
0 references
0 references
0.87707424
0 references
0.87491137
0 references
0.8671469
0 references
0.8373296
0 references
0.8353515
0 references
