On the equational theory of representable polyadic equality algebras

DOI10.2307/2586692zbMath0964.03070OpenAlexW2164186482MaRDI QIDQ4527915

Gábor Sági, Istvan Németi

Publication date: 29 January 2001

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

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

zbMATH Keywords

equational theorypolyadic algebras\(\omega\)-dimensional representable polyadic equality algebrasschema axiomatizability

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (8)

Quasi-polyadic algebras and their dual position ⋮ Representations of polyadic-like equality algebras ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Neat embeddings as adjoint situations ⋮ Cylindric algebras and finite polyadic algebras ⋮ Algebraic Logic, Where Does it Stand Today? ⋮ Omitting types for algebraizable extensions of first order logic ⋮ Varieties of Algebras without the Amalgamation Property

Cites Work

• Cylindric algebras. Part II
• Unnamed Item
• Unnamed Item

This page was built for publication: On the equational theory of representable polyadic equality algebras