Abstract
Among others we will see that the equational theory of ! dimensional representable polyadic equality algebras (RP EA!’s) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is nite schema-axiomatizable (and hence the equational theory of this class is nite schemaaxiomatizable, as well). We will also see that the complexity of the equational theory of RP EA! is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildik o Sain and Viktor Gyuris [10], the following methodological conclusions will be drawn: the negative properties of polyadic (equality) algebras can be removed by switching from what we call the \polyadic algebraic paradigm" to the \cylindric algebraic paradigm". 1
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
