On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras

DOI10.1002/malq.201010015zbMath1245.03106OpenAlexW2018384874MaRDI QIDQ3170559

Tarek Sayed Ahmed

Publication date: 27 September 2011

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201010015

zbMATH Keywords

algebraic logicgamesaxiomatizationsrepresentable quasi-polyadic equality algebras

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (3)

Quasi-polyadic algebras and their dual position ⋮ Bare canonicity of representable cylindric and polyadic algebras ⋮ New perspectives in algebraic logic, from neat embeddings to Erdős graphs

Cites Work

• Unnamed Item
• The representation of relation algebras. II
• Epimorphisms in cylindric algebras and definability in finite variable logic
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• Finitary polyadic algebras from cylindric algebras
• A Modal Logic for Quantification and Substitution
• Cylindric modal logic
• On Cylindric Algebras Satisfying Merry-go-round Properties
• Nonfinitizability of classes of representable cylindric algebras
• Nonfinitizability of classes of representable polyadic algebras
• Provability with Finitely Many Variables

This page was built for publication: On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras