scientific article
From MaRDI portal
Publication:3358706
zbMath0732.03008MaRDI QIDQ3358706
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilityfirst-order theoriesterm algebrapartial lexicographic path orderingreduction of Post's Correspondence Problem to the decision problem of a theory
Undecidability and degrees of sets of sentences (03D35) Artificial intelligence (68T99) Decidability of theories and sets of sentences (03B25)
Related Items (6)
Open problems in rewriting ⋮ Encompassment properties and automata with constraints ⋮ More problems in rewriting ⋮ Problems in rewriting III ⋮ The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable. ⋮ Complete axiomatizations of some quotient term algebras
This page was built for publication:
