Undecidable semiassociative relation algebras

DOI10.2307/2275397MaRDI QIDQ4302341zbMATH OpenOpenAlexFDO

Authors Roger Maddux

Publication date 15 August 1994

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2275397

zbMATH Keywords

cylindric algebrasfree algebrahereditarily undecidable theoriesrelation algebrasundecidable theoriesword problem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40) Cylindric and polyadic algebras; relation algebras (03G15)

Recommendations

• Decision problems for equational theories of relation algebras
• Relation algebras from cylindric and polyadic algebras
• scientific article; zbMATH DE number 638616
• Polyadic algebras
• Undecidability of representability as binary relations

Cites work

• Boolean Algebras with Operators
• Varieties of relation algebras

Cited in

(7)

• Undecidability of relatively free Hilbert algebras
• Relation algebras can tile
• A residually finite associative algebra with an undecidable word problem
• Undecidable theories of Lyndon algebras
• scientific article; zbMATH DE number 465525 (Why is no real title available?)
• Algebraic Logic, Where Does it Stand Today?
• The undecidability of the definability of principal subcongruences

This page was built for publication: Undecidable semiassociative relation algebras

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