On the equational theory of representable polyadic equality algebras (extended abstract)

DOI10.1093/JIGPAL/6.1.3MaRDI QIDQ4380443zbMATH OpenOpenAlexFDO

Authors István Németi, Gábor Sági

Publication date 29 April 1998

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/6.1.3

zbMATH Keywords

computabilitycylindric algebrasdegrees of unsolvabilityequational theorypolyadic algebrasrepresentable polyadic equality algebrasschema axiomatization

Mathematics Subject Classification ID

Equational classes, universal algebra in model theory (03C05) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Cylindric and polyadic algebras; relation algebras (03G15)

Recommendations

• On the equational theory of representable polyadic equality algebras
• Representations of polyadic-like equality algebras
• scientific article; zbMATH DE number 2024618
• On the definition and the representability of quasi-polyadic equality algebras

Cited in

(5)

• Representations of polyadic-like equality algebras
• On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
• Relation formulas for protoalgebraic equality free quasivarieties; Pałasińska's theorem revisited
• scientific article; zbMATH DE number 2024618 (Why is no real title available?)
• On the equational theory of representable polyadic equality algebras

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380443)