Undecidable semiassociative relation algebras

DOI10.2307/2275397zbMath0815.03041OpenAlexW2154020737MaRDI QIDQ4302341

Roger D. 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

free algebraword problemrelation algebrasundecidable theoriescylindric algebrashereditarily undecidable theories

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)

Related Items (2)

Relation algebras can tile ⋮ Algebraic Logic, Where Does it Stand Today?

Cites Work

• Varieties of relation algebras
• Boolean Algebras with Operators

This page was built for publication: Undecidable semiassociative relation algebras