Unsolvable problems for equational theories
From MaRDI portal
Publication:2539862
DOI10.1305/ndjfl/1093956081zbMath0197.28201OpenAlexW2070471622MaRDI QIDQ2539862
Publication date: 1967
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093956081
Related Items (17)
Some undecidability results in strong algebraic languages ⋮ Decision problems concerning properties of finite sets of equations ⋮ An equational logic sampler ⋮ Finitely generated permutative varieties. ⋮ Finite axiomatizability for equational theories of computable groupoids ⋮ The combinatorial degrees of proofs and equations ⋮ Tarski’s finite basis problem via 𝐀(𝒯) ⋮ Some Universal Sets of Terms ⋮ The existence of finitely based lower covers for finitely based equational theories ⋮ On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model ⋮ The unification hierarchy is undecidable ⋮ A field guide to equational logic ⋮ Characterizing Mal'cev conditions ⋮ Base-undecidable properties of universal varieties ⋮ The undecidability of the elementary theory of lattices of all equational theories of large signature ⋮ Basic questions for general algebras ⋮ Thue trees
This page was built for publication: Unsolvable problems for equational theories
