Pages that link to "Item:Q1825190"
From MaRDI portal
The following pages link to Unification in permutative equational theories is undecidable (Q1825190):
Displaying 15 items.
- Permutative rewriting and unification (Q876048) (← links)
- The undecidability of the unification and matching problem for canonical theories (Q1077931) (← links)
- A note on a canonical theory with undecidable unification and matching problem (Q1098623) (← links)
- The unification hierarchy is undecidable (Q1181721) (← links)
- Single versus simultaneous equational unification and equational unification for variable-permuting theories (Q1367080) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- The undecidability of the D<sub>A</sub>-unification problem (Q3478395) (← links)
- An Oxford survey of order sorted algebra (Q4322433) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (Q5096169) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- (Q5216313) (← links)
- Term Rewriting and Applications (Q5703878) (← links)