Journal of Symbolic Logic 65 (3):1143-1167 (2000)
Among others we will prove that the equational theory of ω dimensional representable polyadic equality algebras (RPEA ω '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 finite schema-axiomatizable (and hence the equational theory of this class is finite schema-axiomatizable, as well). We will also show that the complexity of the equational theory of RPEA ω is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko Sain and Viktor Gyuris , 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"
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Algebraic Logic, Where Does It Stand Today?Sayed Ahmed Tarek - 2005 - Bulletin of Symbolic Logic 11 (4):465-516.
Complexity of Equations Valid in Algebras of Relations Part I: Strong Non-Finitizability.Hajnal Andréka - 1997 - Annals of Pure and Applied Logic 89 (2):149-209.
Some Variants of Vaught's Conjecture From the Perspective of Algebraic Logic.G. Sagi & D. Sziraki - 2012 - Logic Journal of the IGPL 20 (6):1064-1082.
Omitting Types for Algebraizable Extensions of First Order Logic.Sayed Ahmed Tarek - 2005 - Journal of Applied Non-Classical Logics 15 (4):465-489.
Similar books and articles
The Abstract Variable-Binding Calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.
Step by Step-Building Representations in Algebraic Logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (1):225-279.
Finite Algebras of Relations Are Representable on Finite Sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
Weakly Associative Relation Algebras with Polyadic Composition Operations.Vera Stebletsova - 2000 - Studia Logica 66 (2):297-323.
Added to index2009-01-28
Total downloads12 ( #380,973 of 2,178,208 )
Recent downloads (6 months)1 ( #316,504 of 2,178,208 )
How can I increase my downloads?