Paul R. Halmos. Algebraic logic, I. Monadic Boolean algebras. Compositio mathematica, vol. 12 (1955), p. 217–249.

1958 ◽  
Vol 23 (2) ◽  
pp. 219-222
Author(s):  
Roland Fraïssé
2011 ◽  
Vol 76 (4) ◽  
pp. 1261-1286 ◽  
Author(s):  
Tomasz Kowalski ◽  
Francesco Paoli ◽  
Matthew Spinks

AbstractVarieties like groups, rings, or Boolean algebras have the property that, in any of their members, the lattice of congruences is isomorphic to a lattice of more manageable objects, for example normal subgroups of groups, two-sided ideals of rings, filters (or ideals) of Boolean algebras. Abstract algebraic logic can explain these phenomena at a rather satisfactory level of generality: in every member A of a τ-regular variety the lattice of congruences of A is isomorphic to the lattice of deductive filters on A of the τ-assertional logic of . Moreover, if has a constant 1 in its type and is 1-subtractive, the deductive filters on A ∈ of the 1-assertional logic of coincide with the -ideals of A in the sense of Gumm and Ursini, for which we have a manageable concept of ideal generation.However, there are isomorphism theorems, for example, in the theories of residuated lattices, pseudointerior algebras and quasi-MV algebras that cannot be subsumed by these general results. The aim of the present paper is to appropriately generalise the concepts of subtractivity and τ-regularity in such a way as to shed some light on the deep reason behind such theorems. The tools and concepts we develop hereby provide a common umbrella for the algebraic investigation of several families of logics, including substructural logics, modal logics, quantum logics, and logics of constructive mathematics.


1972 ◽  
Vol 37 (4) ◽  
pp. 646-656 ◽  
Author(s):  
Daniel B. Demaree

It is well known that the laws of logic governing the sentence connectives—“and”, “or”, “not”, etc.—can be expressed by means of equations in the theory of Boolean algebras. The task of providing a similar algebraic setting for the full first-order predicate logic is the primary concern of algebraic logicians. The best-known efforts in this direction are the polyadic algebras of Halmos (cf. [2]) and the cylindric algebras of Tarski (cf. [3]), both of which may be described as Boolean algebras with infinitely many additional operations. In particular, there is a primitive operator, cκ, corresponding to each quantification, ∃υκ. In this paper we explore a version of algebraic logic conceived by A. H. Copeland, Sr., and described in [1], which has this advantage: All operators are generated from a finite set of primitive operations.Following the theory of cylindric algebras, we introduce, in the natural way, the classes of Copeland set algebras (SCpA), representable Copeland algebras (RCpA), and Copeland algebras of formulas. Playing a central role in the discussion is the set, Γ, of all equations holding in every set algebra. The reason for this is that the operations in a set algebra reflect the notion of satisfaction of a formula in a model, and hence an equation expresses the fact that two formulas are satisfied by the same sequences of objects in the model. Thus to say that an equation holds in every set algebra is to assert that a certain pair of formulas are logically equivalent.


1962 ◽  
Vol 27 (4) ◽  
pp. 469-470
Author(s):  
Aubert Daigneault

2018 ◽  
Vol 28 (5) ◽  
pp. 1021-1059 ◽  
Author(s):  
Marcelo E Coniglio ◽  
Aldo Figallo-Orellano ◽  
Ana Claudia Golzio

Abstract Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency (or LFIs) that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. Specifically, a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics (as independently introduced by M. Fidel and D. Vakarelov). This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI (which is closely connected with Kalman’s functor), suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics.


2020 ◽  
Vol 57 (3) ◽  
pp. 321-371
Author(s):  
Tarek Sayed Ahmed

AbstractFix 2 < n < ω and let CAn denote the class of cyindric algebras of dimension n. Roughly CAn is the algebraic counterpart of the proof theory of first order logic restricted to the first n variables which we denote by Ln. The variety RCAn of representable CAns reflects algebraically the semantics of Ln. Members of RCAn are concrete algebras consisting of genuine n-ary relations, with set theoretic operations induced by the nature of relations, such as projections referred to as cylindrifications. Although CAn has a finite equational axiomatization, RCAn is not finitely axiomatizable, and it generally exhibits wild, often unpredictable and unruly behavior. This makes the theory of CAn substantially richer than that of Boolean algebras, just as much as Lω,ω is richer than propositional logic. We show using a so-called blow up and blur construction that several varieties (in fact infinitely many) containing and including the variety RCAn are not atom-canonical. A variety V of Boolean algebras with operators is atom canonical, if whenever 𝔄 is atomic, then its Dedekind-MacNeille completion, sometimes referred to as its minimal completion, is also in V. From our hitherto obtained algebraic results we show, employing the powerful machinery of algebraic logic, that the celebrated Henkin-Orey omitting types theorem, which is one of the classical first (historically) cornerstones of model theory of Lω,ω, fails dramatically for Ln even if we allow certain generalized models that are only locallly clasfsical. It is also shown that any class K such that , where CRCAn is the class of completely representable CAns, and Sc denotes the operation of forming dense (complete) subalgebras, is not elementary. Finally, we show that any class K such that is not elementary, where Sd denotes the operation of forming dense subalgebra.


1986 ◽  
Vol 51 (4) ◽  
pp. 899-906 ◽  
Author(s):  
J. Donald Monk

One of the most extensive parts of Tarski's contributions to logic is his work on the algebraization of the subject. His work here involves Boolean algebras, relation algebras, cylindric algebras, Boolean algebras with operators, Brouwerian algebras, and closure algebras. The last two are less developed in his work, although his contributions are basic to other work in those subjects. At any rate, not being conversant with the latest developments in those fields, we shall concentrate on an exposition of Tarski's work in the first four areas, trying to put them in the perspective of present-day developments.For useful comments, criticisms, and suggestions, the author is indebted to Steven Givant, Leon Henkin, Wilfrid Hodges, Bjarni Jónsson, Roger Lyndon, and Robert Vaught.


1985 ◽  
Vol 50 (3) ◽  
pp. 689-700 ◽  
Author(s):  
I. Németi

In algebra, the properties of having the (strong) amalgamation property and epis being surjective are well investigated; see the survey [10]. In algebraic logic it is shown that to these algebraic properties there correspond interesting logical properties, see e.g. [15], [12], [4], and [8, p. 311, Problem 10 and the remark below it]. In the present paper we show that the varieties Crsα (of cylindric-relativised set algebras) and Boα (of Boolean algebras with operators) have the strong amalgamation property. These contrast to the following result proved in Pigozzi [15]: No class K with Gsα ⊆ K ⊆ CAα has amalgamation property. Note that Gsα ⊆ Crsα ⊆ Boα and CAα ⊆ Boα. For related results see [3], [1], [16], [11]. For more connections with logic and abstract model theory see [14] and §4.3 of [9].BA denotes the class of all Boolean algebras. Let α be any ordinal. From now on, throughout in the paper, α is an arbitrary but fixed ordinal. Recall from [7, p. 430, Definition 2.7.1] that an α-dimensional BA with operators, a Boα, is an algebra = 〈A, + −, ci, dij〉i, j ∈ α of the same similarity type as CAα's such that , is a BA and the operations ci (i ∈ α) are additive, i.e., ⊨ ci(x + y) = cix + ciy for all i ⊨ α. If ⊨ Boα then I is called the Boolean reduct of . Note that BA = Bo0. A Boα is said to be normal if {ci 0 = 0: i ∈ α} is valid in it, and a Boα is said to be extensive if {x ≤ cix: i ∈ α} is valid in it. Boα's were introduced in [17].The class Crsα of all cylindric-relativised set algebras is defined in Definition 1.1.1 (iii) of [8, p. 4]. We give a definition in the present paper, too—see Definition 5 below. It is shown in [13] that ICrsα is a variety.Our main result is (i) of Theorem 1 below, but we obtain (ii)–(vi), too, as a byproduct from the proof.


Sign in / Sign up

Export Citation Format

Share Document