The undecidability of the unification and matching problem for canonical theories (Q1077931)
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: The undecidability of the unification and matching problem for canonical theories |
scientific article; zbMATH DE number 3958719
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undecidability of the unification and matching problem for canonical theories |
scientific article; zbMATH DE number 3958719 |
Statements
The undecidability of the unification and matching problem for canonical theories (English)
0 references
1987
0 references
The problem whether there exists a unifying substitution for two terms is considered in the class of theories which can be embedded into canonical term rewriting systems. The problem is shown to be undecidable, even if we restrict the substitutions to matching ones. This implies that the class of admissible canonical theories is a proper subset of the class of canonical theories.
0 references
term rewriting systems
0 references
admissible canonical theories
0 references
0.9693712
0 references
0.91814953
0 references
0 references
0.89160705
0 references
0.89067817
0 references
0.8793336
0 references
0.8790939
0 references
0.87839556
0 references
0.8772304
0 references
