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  
  • A proof system for contact relation algebras.Ivo Düntsch & Ewa Orłowska - 2000 - Journal of Philosophical Logic 29 (3):241-262.
    Contact relations have been studied in the context of qualitative geometry and physics since the early 1920s, and have recently received attention in qualitative spatial reasoning. In this paper, we present a sound and complete proof system in the style of Rasiowa and Sikorski (1963) for relation algebras generated by a contact relation.
    Download  
     
    Export citation  
     
    Bookmark   7 citations