Switch to: Citations

Add references

You must login to add references.
  1. Algebraic Logic.Paul Richard Halmos - 2014 - New York, NY, USA: Chelsea.
    2014 Reprint of 1962 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. In "Algebraic Logic" Halmos devised polyadic algebras, an algebraic version of first-order logic differing from the better known cylindric algebras of Alfred Tarski and his students. An elementary version of polyadic algebra is described in monadic Boolean algebra. This book addresses some of the problems of mathematical logic and the theory of polyadic Boolean algebras in particular. It is intended to be an efficient (...)
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • Finitary Polyadic Algebras from Cylindric Algebras.Miklós Ferenczi - 2007 - Studia Logica 87 (1):1-11.
    It is known that every α-dimensional quasi polyadic equality algebra (QPEA α ) can be considered as an α-dimensional cylindric algebra satisfying the merrygo- round properties . The converse of this proposition fails to be true. It is investigated in the paper how to get algebras in QPEA from algebras in CA. Instead of QPEA the class of the finitary polyadic equality algebras (FPEA) is investigated, this class is definitionally equivalent to QPEA. It is shown, among others, that from every (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Complexity of equations valid in algebras of relations part II: Finite axiomatizations.Hajnal Andréka - 1997 - Annals of Pure and Applied Logic 89 (2-3):211-229.
    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   4 citations  
  • Nonfinitizability of classes of representable cylindric algebras.J. Donald Monk - 1969 - Journal of Symbolic Logic 34 (3):331-343.
    Download  
     
    Export citation  
     
    Bookmark   34 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  
  • Cylindric modal logic.Yde Venema - 1995 - Journal of Symbolic Logic 60 (2):591-623.
    Treating the existential quantification ∃ν i as a diamond $\diamond_i$ and the identity ν i = ν j as a constant δ ij , we study restricted versions of first order logic as if they were modal formalisms. This approach is closely related to algebraic logic, as the Kripke frames of our system have the type of the atom structures of cylindric algebras; the full cylindric set algebras are the complex algebras of the intended multidimensional frames called cubes. The main (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • On Cylindric Algebras Satisfying Merry-go-round Properties.Miklós Ferenczi - 2007 - Logic Journal of the IGPL 15 (2):183-197.
    Three classes are introduced which are closely related to the class included in the title. It is proven that the class obtained from by replacing axiom C4 by the commutativity of single substitutions can be considered as the abstract class in the Resek–Thompson theorem, thus it is representable by set algebras. Then the class is defined and it is shown that the necessary and sufficient condition for neat embeddability of an algebra in CAα into is the validity of the merry-go-round (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Modal Logic For Quantification And Substitution.Yde Venema - 1994 - Logic Journal of the IGPL 2 (1):31-45.
    The aim of this paper is to study the n-variable fragment of first order logic from a modal perspective. We define a modal formalism called cylindric mirror modal logic, and show how it is a modal version of first order logic with substitution. In this approach, we can define a semantics for the language which is closely related to algebraic logic, as we find Polyadic Equality Algebras as the modal or complex algebras of our system. The main contribution of the (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Nonfinitizability of classes of representable polyadic algebras.James S. Johnson - 1969 - Journal of Symbolic Logic 34 (3):344-352.
    Download  
     
    Export citation  
     
    Bookmark   20 citations