Switch to: References

Add citations

You must login to add citations.
  1. Algebraic Logic, Where Does It Stand Today?Tarek Sayed Ahmed - 2005 - Bulletin of Symbolic Logic 11 (3):465-516.
    This is a survey article on algebraic logic. It gives a historical background leading up to a modern perspective. Central problems in algebraic logic (like the representation problem) are discussed in connection to other branches of logic, like modal logic, proof theory, model-theoretic forcing, finite combinatorics, and Gödel’s incompleteness results. We focus on cylindric algebras. Relation algebras and polyadic algebras are mostly covered only insofar as they relate to cylindric algebras, and even there we have not told the whole story. (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • An autobiography of polyadic algebras.Paul R. Halmos - 2000 - Logic Journal of the IGPL 8 (4):383-392.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Complexity of equational theory of relational algebras with standard projection elements.Szabolcs Mikulás, Ildikó Sain & András Simon - 2015 - Synthese 192 (7):2159-2182.
    The class $$\mathsf{TPA}$$ TPA of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of $$\mathsf{TPA}$$ TPA nor the first order theory of $$\mathsf{TPA}$$ TPA are decidable. Moreover, we show that the set of all equations valid in $$\mathsf{TPA}$$ TPA is exactly on the $$\Pi ^1_1$$ Π 1 1 level. We consider the class $$\mathsf{TPA}^-$$ (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Complexity of equational theory of relational algebras with projection elements.Szabolcs Mikulás, Ildikó Sain & Andras Simon - 1992 - Bulletin of the Section of Logic 21 (3):103-111.
    The class \ of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of \ nor the first order theory of \ are decidable. Moreover, we show that the set of all equations valid in \ is exactly on the \ level. We consider the class \ of the relation algebra reducts of \ ’s, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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