Switch to: References

Add citations

You must login to add citations.
  1. 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.
    We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Polyadic and cylindric algebras of sentences.Mohamed Amer & Tarek Sayed Ahmed - 2006 - Mathematical Logic Quarterly 52 (5):444-449.
    In this note we give an interpretation of cylindric algebras as algebras of sentences of first order logic. We show that the isomorphism types of such algebras of sentences coincide with the class of neat reducts of cylindric algebras. Also we show how this interpretation sheds light on some recent results. This is done by likening Henkin's Neat Embedding Theorem to his celebrated completeness proof.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Algebras of sentences.Tarek Sayed Ahmed - 2006 - Bulletin of the Section of Logic 35 (1):1-10.
    Download  
     
    Export citation  
     
    Bookmark