Switch to: References

Add citations

You must login to add citations.
  1. Weakly associative relation algebras with polyadic composition operations.Vera Stebletsova - 2000 - Studia Logica 66 (2):297-323.
    In this paper we introduced various classes of weakly associative relation algebras with polyadic composition operations. Among them is the class RWA of representable weakly associative relation algebras with polyadic composition operations. Algebras of this class are relativized representable relation algebras augmented with an infinite set of operations of increasing arity which are generalizations of the binary relative composition. We show that RWA is a canonical variety whose equational theory is decidable.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Omitting types for algebraizable extensions of first order logic.Tarek Sayed Ahmed - 2005 - Journal of Applied Non-Classical Logics 15 (4):465-489.
    We prove an Omitting Types Theorem for certain algebraizable extensions of first order logic without equality studied in [SAI 00] and [SAY 04]. This is done by proving a representation theorem preserving given countable sets of infinite meets for certain reducts of ?- dimensional polyadic algebras, the so-called G polyadic algebras (Theorem 5). Here G is a special subsemigroup of (?, ? o) that specifies the signature of the algebras in question. We state and prove an independence result connecting our (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations