Switch to: References

Add citations

You must login to add citations.
  1. Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts.Judit Madarász & Tarek Ahmed - 2009 - Logic Journal of the IGPL 17 (4):429-483.
    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 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On the definition and the representability of quasi‐polyadic equality algebras.Miklós Ferenczi - 2016 - Mathematical Logic Quarterly 62 (1-2):9-15.
    We show that the usual axiom system of quasi polyadic equality algebras is strongly redundant. Then, so called non‐commutative quasi‐polyadic equality algebras are introduced (), in which, among others, the commutativity of cylindrifications is dropped. As is known, quasi‐polyadic equality algebras are not representable in the classical sense, but we prove that algebras in are representable by quasi‐polyadic relativized set algebras, or more exactly by algebras in.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Neat embeddings and amalgamation.Tarek Sayed Ahmed & Basim Samir - 2006 - Bulletin of the Section of Logic 35 (4):163-171.
    Download  
     
    Export citation  
     
    Bookmark  
  • Finitary Polyadic Algebras from Cylindric Algebras.Miklós Ferenczi - 2007 - Studia Logica 87 (1):1-11.
    It is known that every α-dimensional quasi polyadic equality algebra (QPEA α ) can be considered as an α-dimensional cylindric algebra satisfying the merrygo- round properties . The converse of this proposition fails to be true. It is investigated in the paper how to get algebras in QPEA from algebras in CA. Instead of QPEA the class of the finitary polyadic equality algebras (FPEA) is investigated, this class is definitionally equivalent to QPEA. It is shown, among others, that from every (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The class of neat reducts is not Boolean closed.Tarek Sayed Ahmed - 2008 - Bulletin of the Section of Logic 37 (1):51-61.
    Download  
     
    Export citation  
     
    Bookmark