Undecidable properties of finite sets of equations
From MaRDI portal
Publication:4154857
DOI10.2307/2272037zbMath0375.02040OpenAlexW4246895997MaRDI 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
Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)
Related Items (15)
The combinatorial degrees of proofs and equations ⋮ When is a term point universal? ⋮ Recursive undecidability of the binding property for finitely presented equational classes ⋮ Congruence-distributive varieties of algebras ⋮ An easy test for congruence modularity ⋮ Structural diversity in the lattice of equational theories ⋮ Equations implying congruence \(n\)-permutability and semidistributivity. ⋮ Unnamed Item ⋮ A field guide to equational logic ⋮ Base-undecidable properties of universal varieties ⋮ Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten ⋮ Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen ⋮ 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
This page was built for publication: Undecidable properties of finite sets of equations
