A Neat Embedding Theorem for Expansions of Cylindric Algebras

We generalize two classical results on cylindric algebra to certain expansions of cylindric algebras where the extra operations are defined via first order formulas. The first result is the Neat Embedding Theorem of Henkin and the second is Monk’s classical non-finitizability result of the class of representable algebras. As a corollary we obtain known classical results of Johnson and Biro published in the Journal of Symbolic logic.

[1]  István Németi,et al.  Algebraization of quantifier logics, an introductory overview , 1991, Stud Logica.

[2]  Roger D. Maddux,et al.  Nonfinite axiomatizability results for cylindric and relation algebras , 1989, Journal of Symbolic Logic.

[3]  Ian M. Hodkinson,et al.  Provability with Finitely Many Variables , 2002, Bulletin of Symbolic Logic.

[4]  Tarek Sayed Ahmed,et al.  On amalgamation of reducts of polyadic algebras , 2004 .

[5]  Tarek Sayed Ahmed,et al.  Omitting types for algebraizable extensions of first order logic , 2005, J. Appl. Non Class. Logics.

[6]  Tarek Sayed Ahmed,et al.  Martin's Axiom, Omitting Types, and Complete Representations in Algebraic Logic , 2002, Stud Logica.

[7]  Tarek Sayed Ahmed,et al.  Polyadic and cylindric algebras of sentences , 2006, Math. Log. Q..

[8]  Tarek Sayed Ahmed A Modeltheoretic Solution to a Problem of Tarski , 2002, Math. Log. Q..

[9]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

[10]  James S. Johnson,et al.  Nonfinitizability of classes of representable polyadic algebras , 1969, Journal of Symbolic Logic.

[11]  Balázs Biró Non-Finite-Axiomatizability Results in Algebraic Logic , 1992, J. Symb. Log..

[12]  J. Donald Monk,et al.  Nonfinitizability of Classes of Representable Cylindric Algebras , 1969, J. Symb. Log..

[13]  J. Donald Monk Provability with finitely many variables , 1971 .

[14]  Ildikó Sain,et al.  On the Search for a Finitizable Algebraization of First Order Logic , 2000, Log. J. IGPL.

[15]  Hajnal Andréka,et al.  Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations , 1997, Ann. Pure Appl. Log..

[16]  Algebraic logic , 1985, Problem books in mathematics.

[17]  Miklós Ferenczi,et al.  On representability of neatly embeddable cylindric algebras , 2000, J. Appl. Non Class. Logics.

[18]  Tarek Sayed Ahmed The Class of Neat Reducts is Not Elementary , 2001, Log. J. IGPL.

[19]  András Simon,et al.  What the finitization problem is not , 1993 .

[20]  I. Németi,et al.  Algebras of relations of various ranks , some current trends and applications , 2001 .