Complexity of equations valid in algebras of relations. II: Finite axiomatizations

DOI10.1016/S0168-0072(97)00028-6zbMath0898.03024MaRDI QIDQ1377626

Hajnalka Andréka

Publication date: 1 November 1998

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

relation algebrasvarietiesaxiomatizabilitycylindric algebraspolyadic algebrasrepresentable algebrasequational axiomatization

Mathematics Subject Classification ID

Equational classes, universal algebra in model theory (03C05) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

Atom structures of cylindric algebras and relation algebras, Notions of density that imply representability in algebraic logic

Cites Work

• Sequential calculus
• Cylindric algebras. Part II
• Defining relations for full semigroups of finite transformations
• Lambek calculus and its relational semantics: Completeness and incompleteness
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• The equational theory of union-free algebras of relations
• Adjoining units to residuated Boolean algebras
• Taming logic
• Axiomatization of identity-free equations valid in relation algebras
• A remark of representable positive cylindric algebras
• On representable relation algebras
• A Stone Type Representation Theorem for Algebras of Relations of Higher Rank
• Nonfinitizability of classes of representable cylindric algebras
• Nonfinitizability of classes of representable polyadic algebras
• Boolean Algebras with Operators. Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item