Undecidable properties of finite sets of equations
From MaRDI portal
Publication:4154857
DOI10.2307/2272037zbMath0375.02040MaRDI QIDQ4154857
Publication date: 1976
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272037
03B25: Decidability of theories and sets of sentences
03D80: Applications of computability and recursion theory
Related Items
Congruence-distributive varieties of algebras, When is a term point universal?, Recursive undecidability of the binding property for finitely presented equational classes, Structural diversity in the lattice of equational theories, A field guide to equational logic, Base-undecidable properties of universal varieties, Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten, The reverse spelling of an FPrt-universal word in two letters, Covering in the lattice of equational theories and some properties of term finite theories, Thue trees, The combinatorial degrees of proofs and equations, Unnamed Item, Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen