Pages that link to "Item:Q5234685"
From MaRDI portal
The following pages link to On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685):
Displaying 9 items.
- Context unification with one context variable (Q1041589) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- On rewrite constraints and context unification (Q1607044) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
