scientific article
From MaRDI portal
Publication:3838760
zbMath0901.03034MaRDI QIDQ3838760
Manfred Schmidt-Schauss, Klaus U. Schulz
Publication date: 8 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42)
Related Items (9)
Decidability of bounded second order unification ⋮ Regular Patterns in Second-Order Unification ⋮ Dominance constraints in stratified context unification ⋮ Decidability of bounded higher-order unification ⋮ A decision algorithm for distributive unification ⋮ On the relation between context and sequence unification ⋮ Context unification with one context variable ⋮ Solvability of context equations with two context variables is decidable ⋮ \(\forall \exists^{5}\)-equational theory of context unification is undecidable
This page was built for publication:
