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

DOI10.1093/JIGPAL/6.1.3zbMath0891.03033OpenAlexW2068191226MaRDI QIDQ4380443

Gábor Sági, Istvan Németi

Publication date: 29 April 1998

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

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

zbMATH Keywords

computabilityequational theorycylindric algebraspolyadic algebrasdegrees of unsolvabilityrepresentable polyadic equality algebrasschema axiomatization

Mathematics Subject Classification ID

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

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