scientific article; zbMATH DE number 1222595
From MaRDI portal
Publication:4218135
zbMath0912.03006MaRDI QIDQ4218135
Publication date: 11 November 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)
Related Items (3)
Decidability of bounded higher-order unification ⋮ 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: