Unsolvable problems for equational theories

DOI10.1305/NDJFL/1093956081MaRDI QIDQ2539862zbMATH OpenOpenAlexFDO

Authors Peter Perkins

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

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(17)

• Some undecidability results in strong algebraic languages
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• A field guide to equational logic
• Decision problems concerning properties of finite sets of equations
• Base-undecidable properties of universal varieties
• The existence of finitely based lower covers for finitely based equational theories
• Characterizing Mal'cev conditions
• An equational logic sampler
• Some Universal Sets of Terms
• The combinatorial degrees of proofs and equations
• The unification hierarchy is undecidable
• Tarski’s finite basis problem via 𝐀(𝒯)
• Finite axiomatizability for equational theories of computable groupoids
• Thue trees
• Basic questions for general algebras
• Finitely generated permutative varieties.
• The undecidability of the elementary theory of lattices of all equational theories of large signature

This page was built for publication: Unsolvable problems for equational theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2539862)