Switch to: Citations

Add references

You must login to add references.
  1. Finitary Algebraic Logic.Roger D. Maddux - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):321-332.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On varieties of cylindric algebras with applications to logic.I. Németi - 1987 - Annals of Pure and Applied Logic 36:235-277.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Finitary algebraic logic II.Roger D. Maddux - 1993 - Mathematical Logic Quarterly 39 (1):566-569.
    This is a supplement to the paper “Finitary Algebraic Logic” [1]. It includes corrections for several errors and some additional results. MSC: 03G15, 03G25.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Arrow logic and infinite counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.
    We consider arrow logics (i.e., propositional multi-modal logics having three -- a dyadic, a monadic, and a constant -- modal operators) augmented with various kinds of infinite counting modalities, such as 'much more', 'of good quantity', 'many times'. It is shown that the addition of these modal operators to weakly associative arrow logic results in finitely axiomatizable and decidable logics, which fail to have the finite base property.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
    Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have the `finite base property' and have decidable universal theories, and that any finite algebra in each class is representable on a finite set.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • 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  
  • Finitary Algebraic Logic.Roger D. Maddux - 1989 - Mathematical Logic Quarterly 35 (4):321-332.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On the calculus of relations.Alfred Tarski - 1941 - Journal of Symbolic Logic 6 (3):73-89.
    The logical theory which is called thecalculus of (binary) relations, and which will constitute the subject of this paper, has had a strange and rather capricious line of historical development. Although some scattered remarks regarding the concept of relations are to be found already in the writings of medieval logicians, it is only within the last hundred years that this topic has become the subject of systematic investigation. The first beginnings of the contemporary theory of relations are to be found (...)
    Download  
     
    Export citation  
     
    Bookmark   75 citations