Publication:4218135
From MaRDI portal
zbMath0912.03006MaRDI QIDQ4218135
Publication date: 11 November 1998
03B25: Decidability of theories and sets of sentences
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Solvability of context equations with two context variables is decidable, \(\forall \exists^{5}\)-equational theory of context unification is undecidable, Decidability of bounded higher-order unification