On Neat Reducts of Reducts of Cylindric Algebras

[1] H. Andréka, I. Németi, T. Sayed Ahmed, Omitting types for finite variable fragments and
complete representations of algebras. Journal of Symbolic Logic 73(1) (2008) p.65-89
[2] H. Andréka, S.Givant, S. Mikulus, I. Németi, A. Simon Notions of density that imply
representability in algebraic logic Annals of pure and applied logic 91 (1998) p.93-190
[3] J. Burgess Forcing Chapter in Handbook of Mathemmatical Logic Edited by Barwise. J.
[4] M. Ferenczi, On representability of neatly embeddable cylindric algebras Journal of Applied
Non-classical Logic, 10 3-4(2000), p. 1-11
[5] D, H, Fremlin, Consequences of MA. Cambridge University press. (1984)
[6] W. Hodges Model Theory, volume 42 of Encyclopedia of mathematics and its applications
[7] Hirsch R. Relation algebra reducts of cylindric algebras and complete representations Journal
of Symbolic Logic, 72(2) (2007) p.673-703.
[8] R. Hirsch and I. Hodkinson, Complete representations in algebraic logic. Journal of Symbolic
Logic, 62(3) (1997), 816–847.
[9] R. Hirsch I. Hodkinson Relation algebras by games. (2002) Studies in Logic and the
Foundations of Mathematics. Volume 147. (2002)
[10] R. Hirsch, I. Hodkinson, R. Maddux, Relation algebra reducts of cylindric algebras and
an application to proof theory. Journal of Symbolic Logic 67(1) (2002), 197–213.
[11] L. Henkin, J.D. Monk and A. Tarski Cylindric Algebras Part I. North Holland, (1971.)
[12] L. Henkin, J.D. Monk, and A. Tarski Cylindric Algebras Part II. North Holland, (1985).
[13] L. Henkin, J. D. Monk, A. Tarski, H. Andreka, and I. Németi, Cylindric Set Algebras.
Lecture Notes in Mathematics, Vol. 883, Springer-Verlag, Berlin, (1981), p.vi + 323.
[14] I. Németi, The Class of Neat Reducts of Cylindric Algebras is Not a Variety But is closed
w.r.t. HP. Notre Dame Journal of Formal logic, 24(3) (1983), pp 399-409.
[15] I. Németi, Algebraisation of quantifier logics, an introductory overview.
Math.Inst.Budapest, Preprint, No 13-1996. A shortened version appeared in Studia
Logica 50(4) (1991)p.465-569.
[16] J. Madárasz J., and T. Sayed Ahmed, Amalgamation, interpolation and epimorphisms
Algebra Universalis 56 (2) (2007) p. 179-210.
[17] A. Miller, Some properties of measure and category Transactions of the American Mathematical
Society, 266 (1981),. 93-113
[18] T. Sayed Ahmed The class of neat reducts is not elementary. Logic Journal of IGPL, 9
(2001) p. 31-65 electronically available at http://www.math-inst.hu/pub/algebraiclogic.
[19] T. Sayed Ahmed Martin’s axiom, omitting types and complete representations in algebraic
logic . Studia Logica 72 (2002), p.1-25
[20] T. Sayed Ahmed Neat embeddings, interpolation, and omitting types, an overview. Notre
Dame Journal of formal logic, 44 (3)(2003), p.157-173
[21] T. Sayed Ahmed, The class of 2-dimensional neat reducts of polyadic algebras is not elementary.
Fundementa Mathematicea, 172 (2002), p.61-81.
[22] T. Sayed Ahmed, Martin’s axiom, omitting types and complete representations in algebraic
logic . Studia Logica 72 (2002), p.1-25
[23] T. Sayed Ahmed, A confirmation of a conjecture of Tarski Bulletin section of logic 32 (3)
(2003), p.103-105
[24] T. Sayed Ahmed, Neat embeddings, Interpolation, and omitting types, an overview. Notre
Dame Journal of formal logic, 44 (3)(2003), p.157-173
[25] T. Sayed Ahmed, On Amalgamation of Reducts of Polyadic Algebras. Algebra Universalis
51 (2004), p.301-359.
[26] T. Sayed Ahmed, On amalgamation of algebras of logic Studia Logica 81 (2005), p.61-
77.
[27] T. Sayed Ahmed, Algebraic Logic, where does it stand today? Bulletin of Symbolic Logic.
11 (4) (2005), p.465-516.
[28] T. Sayed Ahmed , The class of infinite dimensional neat reducts quasi-polyadic algebras
is not axiomatizable Mathematical Logic quaterly 52 (1) (2006), p.106-112
[29] T.Sayed Ahmed A note on neat reducts, Studia Logica 85(2), (2007)p. 139-151.
[30] T. Sayed Ahmed On Amalgamation of Reducts of Polyadic Algebras. Algebra Universalis
51 (2004), p.301-359.
[31] T. Sayed Ahmed, Amalgamation Theorems in Algebraic Logic, an overview Logic Journal
of IGPL, 13 (2005), 277-286.
[32] T. Sayed Ahmed, On amalgamation of algebras of logic Studia Logica 81 (2005), p.61-
77.
[33] T. Sayed Ahmed, Algebraic Logic, where does it stand today? Bulletin of Symbolic Logic.
11 (4) (2005), p.465-516.
[34] T. Sayed Ahmed, The class of infinite dimensional neat reducts of quasi-polyadic algebras
is not axiomatizable Mathematical Logic quaterly 52 (1) (2006), p.106-112
[35] T. Sayed Ahmed, Omitting types for algebraizable extensions of first order logic Journal
of Applied non-classical logics 15 (4) (2006), p.465-487
[36] T.Sayed Ahmed Non elementary classes in algebraic logic submitted
[37] T. Sayed Ahmed. On a Theorem of Vaught for first order logic with finitely many variables
Journal of Applied Non-classical Logic 19(1) (2009) p. 97-112.
[38] T. Sayed Ahmed. A note on substitutions in cylindric algebras Mathematical Logic Quarterly
55(3)(2009) p. 280-287
[39] T. Sayed Ahmed On neat embeddings of cylindric algebras Mathematical Logic Quarterly
55(6)(2009)p.666-668
[40] T. Sayed Ahmed. The class of polyadic algebras has the superamalgamation property
Mathematical Logic Quarterly 56(1)(2010)p.103-112
[41] T. Sayed Ahmed On neat embedding of algebraisations of first order logic Journal of
Algebra, number theory, advances and applications 1(2) 2009 p. 113-125
[42] T. Sayed Ahmed The amalgmation property, and a problem of Henkin Monk and Tarski
Journal of Algebra, number theory, advances and applications 1(2) 2009 p. 127-141
[43] T. Sayed Ahmed The class of polyadic algebras has the superamalgamation property
Mathematical Logic Quarterly 56(1)(2010)p.103-112
[44] T. Sayed Ahmed Some results on neat reducts Algebra Universalis, in press.
[45] T. Sayed Ahmed, I. Németi, On neat reducts of algebras of logic. Studia Logica, 62 (2)
(2001), p.229-262.
[46] T.Sayed Ahmed and M. Amer Polyadic and cylindric algebras of sentences Mathematical
logic quaterly vol 52 no 5 p.44-49 (2006)
[47] T. Sayed Ahmed and B.Samir A Neat embedding theorem for expansions of cylindric
algebras Logic journal of IGPL 15 (2007) p. 41-51
[48] I. Sain. Searching for a finitizable algebraization of first order logic. Logic Journal of
IGPL. Oxford University Press. 8(4) (2000), 495–589.
[49] G. Sagi, A completeness theorem for higher order logics Journal of Symbolic Logic
65(3)(2000) p.857-884.
[50] S. Shelah. Classification Theory Second Edition North Holland P.C., Amsterdam 1990.
[51] A. Tarski and S. Givant A formalization of set theory without variables. AMS Colloquium
Publications 41, (1987).