Logic Journal of IGPL Advance Access originally published online on July 8, 2009
Logic Journal of IGPL 2009 17(6):755-802; doi:10.1093/jigpal/jzp013
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamation
Mathematical Institute of the Hungarian Academy of Science, Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt.
E-mail: rutahmed{at}gmail.com
Introduced by Leon Henkin back in the fifties, the notion of neat reducts is an old venerable notion in algebraic logic. But it is often the case that an unexpected viewpoint yields new insights. Indeed, the repercussions of the (seemingly very innocent) fact that the class of neat reducts is not closed under forming subalgebras turn out to be enormous. In this paper we review and, in the process, discuss, some of these repercussions in connection with the algebraic notion of amalgamation. Some new unpublished results (answering long-standing open problems in the field) concerning neat reducts and amalgamation are given. (Theorems 11, 13, 19 and 31-38 are such). Several counterexamples which convey the gist of techniques used in this area are presented two of which are new (Theorem 19, Theorem 38.) It is known that the algebraic notion of amalgamation in a class of algebras corresponds to the metalogical notion of interpolation in the corresponding logic. Answers to open question in the recent paper [31] concerning both amalgamation and interpolation are summarized in tabular form at the end of this paper.
This paper appears in two parts. The first part contains results on neat reducts. The present second part contains results relating the notion of neat embeddings to various amalgamation properties.1
Key Words: algebraic logic • amalgamation • cylindric algebras • quasipolyadic algebras • substitution algebras • neat reducts • neat embeddings
Received for publication 14 September 2007.
1 Mathematics Subject Classification: 03G15, 03C10.
Research was supported by the Hungarian National Foundation for Scientific Reserach OKTA grant no T30314. Research also supported by Bolyai Grant for Judit X. Madarasz.
References
-
[1] Andréka H, Németi I. On systems of varieties definable by schemes of equations. Algebra Universalis (1980) 11:105–116.[CrossRef]
[2] Andréka H, Monk JD, Németi I, eds. Algebraic Logic (1991) Amsterdam: North-Holland.
[3] Andréka H, Németi I, Sáyed Ahmed T. Amalgamation in algebras of logic (1998) Hungary. Presented at the "Universal Algebra’’ Conference held in Szeged.
[4] Andréka H, Németi I, Sayed Ahmed T. Omitting types for finite variable fragments, & complete representations of algebras. To appear in the Journal of Symbolic Logic.
[5] Andréka H, Comer C, Madarász J, Németi I, Sayed Ahmed T. Epimorphisms in cylindric algebras. To appear in Journal of Pure and Applied Algebra.
[6] Sayed Ahmed T. On neat reducts and amalgamation. Bulletin of Symbolic Logic (2001) 7(1):83.
[7] Sayed Ahmed T. The class of neat reducts is not elementary. In: Logic Journal of IGPL (2001) 9:31–65. electronically available at http://www.mathinst.hu/pub/algebraic-logic.
[8] Sayed Ahmed T. Topics in Algebraic Logic (2002) Cairo University. P.hD thesis.
[9] Sayed Ahmed T. Martin's axiom, omitting types and complete representations in algebraic logic. Studia Logica (2002) 72:1–25.
[10] Sayed Ahmed T. A confirmation of a conjecture of Tarski. Bulletin Section of Logic (2003) 32(3):103–105.
[11] Sayed Ahmed T. Neat embedings, interpolation, and omitting types, an overview. Notre Dame Journal of Formal Logic (2003) 44(3):157–173.[CrossRef]
[12] Sayed Ahmed T. Omitting types for finite variable fragments of first order logic. Bulletin Section of Logic (2003) 32(3):115–120.
[13] Sayed Ahmed T. On Amalgamation of reducts of polyadic algebras. Algebra Universalis (2004) 51:301–359.[Web of Science]
[14] Sayed Ahmed T. A sufficient and necessary condition for omitting types. Bulletin of the Section of Logic (2005) 34(1):23–28.
[15] Sayed Ahmed T. Independence results in algebraic logic. Logic Journal of IGPL (2005) 14(1):87–96.[CrossRef]
[16] Sayed Ahmed T. Amalgamation theorems in algebraic logic, an overview. Logic Journal of IGPL (2005) 13:277–286.
[17] Sayed Ahmed T. An independence result in algebraic logic. Bulletin of the Section of Logic (2005) 34(1):29–36.
[18] Sayed Ahmed T. On amalgamation of algebras of logic. Studia Logica (2005) 81:61–77.[CrossRef]
[19] Sayed Ahmed T. Algebraic logic, where does it stand today? Bulletin of Symbolic Logic (2005) 11(4):465–516.[CrossRef][Web of Science]
[20] Sayed Ahmed T. Omitting types for algebraizable extensions of first order logic. Journal of Applied Non-classical Logics (2006) 15(4):465–487.
[21] Sayed Ahmed T. Some results on amalgamation in algebraic logic. Logic Journal of IGPL (2006) 14:623–627.
[22] Sayed Ahmed T. On neat reducts and amalgamation. Logic Journal of IGPL (2007) 15(1):33–39.
[23] Sayed Ahmed T. An interpolation theorem for first order logic with infinitary predicates. Logic Journal of IGPL (2007) 15(1):21–32.
[24] Sayed Ahmed T. A categorial approach to amalgamation theorems. Reports on Mathematical Logic. To appear.
[25] Sayed Ahmed T. Omitting types for first order logic with infinitary predicates. Mathematical Logic Quarterly. To appear.
[26] Sayed Ahmed T. On a Problem of Tarski, Henkin and Monk. Submitted.
[27] Sayed Ahmed T. Classes of algebras with the amalgamation property. Bulletin of the Section of Logic. To appear.
[28] Sayed Ahmed T. Reducts of Polyadic algebras without the amalgmation property. International Journal of Algebra. To appear.
[29] Sayed Ahmed T, Németi I. On neat reducts of algebras of logic. Studia Logica (2001) 62(2):229–262.[CrossRef]
[30] Sayed Ahmed T, Samir B. Neat embeddings and amalgamation. Bulletin Section of Logic (2006) 3(5):164–172.
[31] Madárasz J, Sayed Ahmed T. Amalgamation, interpolation and epimorphisms. Algebra Universalis (2007) 56(2):179–210.[CrossRef][Web of Science]
[32] Madárasz J, Sayed Ahmed T. Neat reducts and amalgamation retrospectively, a survey of results and some methods. Part I Results on neat reducts. Logic Journal of IGPL. doi: 10.1093/jigpal/JZP012.
[33] Henkin L. An extension of the Craig-Lyndon interpolation theorem. Journal of Symbolic Logic (1963) 28(3):201–216.[CrossRef]
[34] Henkin L, Monk JD, Tarski A. Cylindric Algebras Part I (1971) Amsterdam: North-Holland.
[35] Henkin L, Monk JD, Tarski A. Cylindric Algebras Part II (1985) Amsterdam: North-Holland.
[36] Keisler HJ. A complete first order logic with infinitary predicates Fund. Math (1963) 52:177–203.
[37] Hodges W. Model Theory, Encyclopedia of Mathematics and its Applications, (1993) 42. Cambridge University Press.
[38] Johnson JS. Non-finitizability of classes of representable polyadic algebras. Journal of Symbolic Logic (1969) 34:344–354.[CrossRef][Web of Science]
[39] Johnson JS. Amalgamation of polyadic algebras. Trans. Amer. Math. Soc. (1970) 17:834–1970.
[40] Madarász J. Interpolation and Amalgamation; Pushing the Limits. Part I. Studia Logica (1998) 61:316–345.
[41] Madarász J. Interpolation and amalgamation; pushing the limits. Part II. Studia Logica.
[42] Maksimova L. Amalgamation and interpolation in normal modal logics. Studia Logica (1991) 50:457–471.[CrossRef]
[43] Németi I. 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 (1983) 24(3):399–409.[CrossRef]
[44] Németi I. Algebraisation of quantifier logics, an introductory overview. Math.Inst.Budapest (1991) 50(4):465–569. Preprint, No 13–1996. A shortened version appeared in Studia Logica.
[45] Pigozzi D. Amalgamation, congruence extension, and interpolation properties in algebras. Algebra Universalis (1971) 1:269–349.[CrossRef]
[46] Sagi G, Shelah S. Weak and strong interpolation for algebraic logics. Journal of Symbolic Logic (2006) 71:104–118.[CrossRef][Web of Science]
[47] Sain I, Thompson R. Strictly finite schema axiomatization of quasi-polyadic algebras. In: Algebraic Logic. Amsterdam: North-Holland. 539–571.
[48] Sain I, Gyuris V. Finite schematizable algebraic logic. Logic journal of IGPL (1996) 5(5).
[49] Sain I. Searching for a finitizable algebraization of first order logic. Logic Journal of IGPL (2000) 8(4):495–589.
CiteULike 
Connotea 
Del.icio.us What's this?
| ||||||||||||||||||||||||||||||||||||||||||||||||