The equational theory of CA3 is undecidable

DOI10.2307/2273191zbMath0435.03010MaRDI QIDQ3874171

Roger D. Maddux

Publication date: 1980

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

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

zbMATH Keywords

cylindric algebras; equational theories; unsolvable problems in semigroups

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03C05: Equational classes, universal algebra in model theory

03G15: Cylindric and polyadic algebras; relation algebras

08B99: Varieties

Related Items

Unnamed Item, Undecidability of Algebras of Binary Relations, Embeddability into Relational Lattices Is Undecidable, Algebraic Logic, Where Does it Stand Today?, Relational lattices: from databases to universal algebra, The relational model of data and cylindric algebras, Augmenting ATL with strategy contexts, On varieties of cylindric algebras with applications to logic, A class of decidable information logics, Embeddability into relational lattices is undecidable, Relation algebras can tile, Non-primitive recursive decidability of products of modal logics with expanding domains, On Satisfiability in ATL with Strategy Contexts, Pair-Dense Relation Algebras

Cites Work

• Undecidability of the homogeneous formulas of degree 3 of the predicate calculus
• On languages with two variables