A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation theory for the complete and atomless subalgebras of Souslin algebras is established (building on ideas of Jech and Jensen). With this we obtain some basic results on the possible types of subalgebras and their interrelation. The second part (...) begins with a review of some generalizations of results from descriptive set theory concerning Baire category which are then used in non-trivial Souslin tree constructions that yield Souslin algebras with a remarkable subalgebra structure. In particular, we use this method to prove that under the diamond principle there is a bi-embeddable though not isomorphic pair of homogeneous Souslin algebras. (shrink)

Assuming Jensen's principle ◊+ we construct Souslin algebras all of whose maximal chains are pairwise isomorphic as total orders, thereby answering questions of Koppelberg and Todorčević.

We prove that every homogeneously Souslin set is coanalytic provided that either (a) 0long does not exist, or else (b) V = K, where K is the core model below a μ-measurable cardinal.

We show it is consistent that there is a Souslin tree S such that after forcing with S, S is Kurepa and for all clubs $$C \subset \omega _1$$ C ⊂ ω 1, $$S\upharpoonright C$$ S ↾ C is rigid. This answers the questions in Fuchs (Arch Math Logic 52(1–2):47–66, 2013). Moreover, we show it is consistent with $$\diamondsuit $$ ♢ that for every Souslin tree T there is a dense $$X \subseteq T$$ X ⊆ T which does (...) not contain a copy of T. This is related to a question due to Baumgartner in Baumgartner (Ordered sets (Banff, Alta., 1981), volume 83 of NATO Adv. Study Inst. Ser. C: Math. Phys. Sci., Reidel, Dordrecht-Boston, pp 239–277, 1982). (shrink)

1. Consistent inequality [We prove the consistency of irr $(\displaystyle\prod_{i < \kappa} B_i/D) < \displaystyle\prod_{i < \kappa}$ irr(B i )/D where D is an ultrafilter on κ and each B i is a Boolean algebra and irr(B) is the maximal size of irredundant subsets of a Boolean algebra B, see full definition in the text. This solves the last problem, 35, of this form from Monk's list of problems in [M2]. The solution applies to many other properties, e.g. (...) Souslinity.] 2. Consistency for small cardinals [We get similar results with κ=ℵ1 (easily we cannot have it for κ=ℵ0) and Boolean algebras B i (i<κ) of cardinality $< \beth_{\omega_1}$ .] This article continues Magidor Shelah [MgSh:433] and Shelah Spinas [ShSi:677], but does not rely on them: see [M2] for the background. (shrink)

This is the third edition of a book originally published in the 1970s; it provides a systematic and nicely organized presentation of the elegant method of using Boolean-valued models to prove independence results. Four things are new in the third edition: background material on Heyting algebras, a chapter on ‘Boolean-valued analysis’, one on using Heyting algebras to understand intuitionistic set theory, and an appendix explaining how Boolean and Heyting algebras look from the perspective of category theory. The book presents results (...) from a number of set theorists and includes an insightful and informative foreword by Dana Scott. Bell's presentation is lively and pleasant to read, and the material is given in a nicely cohesive way.One obvious reason to be interested in independence proofs is that they concern the important question, what is the set-theoretic hierarchy like? The proofs in Bell's book cover some of the most basic and fundamental independence results, such as those concerning the size of the continuum, the independence of the Axiom of Choice from ZF, cardinal collapsing, Souslin's hypothesis, and Martin's Axiom.Since Gödel's incompleteness theorem, it has been known that for any serious candidate list of set-theoretic axioms, there will be statements neither provable nor disprovable from those axioms. What is really interesting, however, and what the independence proofs discussed here show, is how many of the most natural questions about sets are not decided by the standard axioms of ZFC, and how …. (shrink)

We prove thatµ=µ <µ , 2 µ =µ + and “there is a non-reflecting stationary subset ofµ + composed of ordinals of cofinality <μ” imply that there is a μ-complete Souslin tree onµ +.

We define the notion of Souslin forcing, and we prove that some properties are preserved under iteration. We define a weaker form of Martin's axiom, namely MA(Γ + ℵ 0 ), and using the results on Souslin forcing we show that MA(Γ + ℵ 0 ) is consistent with the existence of a Souslin tree and with the splitting number s = ℵ 1 . We prove that MA(Γ + ℵ 0 ) proves the additivity of measure. (...) Also we introduce the notion of proper Souslin forcing, and we prove that this property is preserved under countable support iterated forcing. We use these results to show that ZFC + there is an inaccessible cardinal is equiconsistent with ZFC + the Borel conjecture + Σ 1 2 -measurability. (shrink)

In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known ⋄-based constructions of Souslin trees with various additional properties may be rendered as applications of our approach. In this paper, we show that constructions following the same approach may be carried out even in the absence of ⋄. In particular, we obtain a new weak sufficient condition for the existence of Souslin trees at the level of a strongly (...) inaccessible cardinal. We also present a new construction of a Souslin tree with an ascent path, thereby increasing the consistency strength of such a tree's nonexistence from a Mahlo cardinal to a weakly compact cardinal. Section 2 of this paper is targeted at newcomers with minimal background. It offers a comprehensive exposition of the subject of constructing Souslin trees and the challenges involved. (shrink)

We investigate various strong notions of rigidity for Souslin trees, separating them under ♢ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♢ that there is a group whose automorphism tower is highly malleable by forcing.

Orthologic is defined by weakening the axioms and rules of inference of the classical propositional calculus. The resulting Lindenbaum-Tarski quotient algebra is an orthoimplication algebra which generalizes the author's implication algebra. The associated order structure is a semi-orthomodular lattice. The theory of orthomodular lattices is obtained by adjoining a falsity symbol to the underlying orthologic or a least element to the orthoimplication algebra.

We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show that inquisitive (...) algebras determine Medvedev’s logic of finite problems. In addition to the algebraic characterization of H(B), we give a topological characterization of H(B) in terms of the recently introduced choice-free duality for Boolean algebras using so-called upper Vietoris spaces (UV-spaces). In particular, while a Boolean algebra B is realized as the Boolean algebra of compact regular open elements of a UV-space dual to B, we show that H(B) is realized as the algebra of compact open elements of this space. This connection yields a new topological semantics for inquisitive logic. (shrink)

Volume I provides a detailed analysis of cylindric algebras, starting with a formulation of their axioms and a development of their elementary properties, and proceeding to a deeper study of their interrelationships by means of general algebraic notions such as subalgebras, homomorphisms, direct products, free algebras, reducts and relativized algebras.

In A. Kumar, & M. Banerjee [(2012). Definable and rough sets in covering-based approximation spaces. In T. Li. (eds.), Rough sets and knowledge technology (pp. 488–495). Springer-Verlag], A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], authors proposed a pair of lower and upper approximation operators based on granules generated by quasiorders. This work is an extension of algebraic results presented therein. A characterisation has been presented for those (...) quasiorder-generated covering-based approximation spaces whose corresponding collections of definable and rough sets form Stone algebras. The notion of rough lattice was proposed in A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], A. Kumar [(2020). A Study of Algebras and Logics of Rough Sets Based on Classical and Generalized Approximation Spaces. In Transactions on Rough Sets XXII, LNCS (Vol. 12485, pp. 123–251). Springer]. Some special rough lattices are introduced in this work, viz. rough Stone algebra, ∼1-complemented and ∼2-complemented rough lattices. Representations of these algebras in terms of rough sets are obtained. Moreover, logics for these algebras are shown to be sound and complete with respect to rough set semantics. (shrink)

This volume is not restricted to papers presented at the 1988 Colloquium, but instead aims to provide the reader with a (relatively) coherent reading on Algebraic Logic, with an emphasis on current research. To help the non-specialist reader, the book contains an introduction to cylindric and relation algebras by Roger D. Maddux and an introduction to Boolean Algebras by Bjarni Joacute;nsson.

We show that the conceptual distance between any two theories of first-order logic is the same as the generator distance between their Lindenbaum–Tarski algebras of concepts. As a consequence of this, we show that, for any two arbitrary mathematical structures, the generator distance between their meaning algebras (also known as cylindric set algebras) is the same as the conceptual distance between their first-order logic theories. As applications, we give a complete description for the distances between meaning algebras corresponding to structures (...) having at most three elements and show that this small network represents all the possible conceptual distances between complete theories. As a corollary of this, we will see that there are only two non-trivial structures definable on three-element sets up to conceptual equivalence (i.e., up to elementary plus definitional equivalence). (shrink)

This unique textbook states and proves all the major theorems of many-valued propositional logic and provides the reader with the most recent developments and trends, including applications to adaptive error-correcting binary search. The book is suitable for self-study, making the basic tools of many-valued logic accessible to students and scientists with a basic mathematical knowledge who are interested in the mathematical treatment of uncertain information. Stressing the interplay between algebra and logic, the book contains material never before published, such (...) as a simple proof of the completeness theorem and of the equivalence between Chang's MV algebras and Abelian lattice-ordered groups with unit - a necessary prerequisite for the incorporation of a genuine addition operation into fuzzy logic. Readers interested in fuzzy control are provided with a rich deductive system in which one can define fuzzy partitions, just as Boolean partitions can be defined and computed in classical logic. Detailed bibliographic remarks at the end of each chapter and an extensive bibliography lead the reader on to further specialised topics. (shrink)

We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudomonadic algebras serve as algebraic models of doxastic modal system KD45. The main results of the paper are: Characterization of subdirectly irreducible and simple pseudomonadic algebras, as well as Tokarz's proper filter algebras; Ordertopological representation of pseudomonadic algebras; Complete description of the lattice of subvarieties of the variety of (...) pseudomonadic algebras. (shrink)

The aim of this paper is to show that every topological space gives rise to a wealth of topological models of the modal logic S4.1. The construction of these models is based on the fact that every space defines a Boolean closure algebra (to be called a McKinsey algebra) that neatly reflects the structure of the modal system S4.1. It is shown that the class of topological models based on McKinsey algebras contains a canonical model that can be (...) used to prove a completeness theorem for S4.1. Further, it is shown that the McKinsey algebra MKX of a space X endoewed with an alpha-topologiy satisfies Esakia's GRZ axiom. (shrink)

In classical logic, the proposition expressed by a sentence is construed as a set of possible worlds, capturing the informative content of the sentence. However, sentences in natural language are not only used to provide information, but also to request information. Thus, natural language semantics requires a logical framework whose notion of meaning does not only embody informative content, but also inquisitive content. This paper develops the algebraic foundations for such a framework. We argue that propositions, in order to embody (...) both informative and inquisitive content in a satisfactory way, should be defined as non-empty, downward closed sets of possibilities, where each possibility in turn is a set of possible worlds. We define a natural entailment order over such propositions, capturing when one proposition is at least as informative and inquisitive as another, and we show that this entailment order gives rise to a complete Heyting algebra, with meet, join, and relative pseudo-complement operators. Just as in classical logic, these semantic operators are then associated with the logical constants in a first-order language. We explore the logical properties of the resulting system and discuss its significance for natural language semantics. We show that the system essentially coincides with the simplest and most well-understood existing implementation of inquisitive semantics, and that its treatment of disjunction and existentials also concurs with recent work in alternative semantics. Thus, our algebraic considerations do not lead to a wholly new treatment of the logical constants, but rather provide more solid foundations for some of the existing proposals. (shrink)

Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive. A variation of the double-negation translation is also discussed: if ϕ is provable classically, then ¬(¬ϕ)nf is provable in minimal logic, where θnf denotes the negation-normal form of θ. The translation is used to show that cut-elimination theorems for classical logic can be viewed as special (...) cases of the cut-elimination theorems for intuitionistic logic. (shrink)

We present a variation of the forcing S max as presented in Woodin [4]. Our forcing is a P max -style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T G which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," with T G being (...) this minimal tree. In particular, in the extension this Souslin tree has the property that forcing with it gives a model of Souslin's Hypothesis. (shrink)

An ℵ1-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an ℵ1-Souslin tree. In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a λ+-Souslin tree. This class includes Prikry, Magidor, and Radin forcing.

Provability, Computability and Reflection.

The invention of symbolic algebra in the sixteenth and seventeenth centuries fundamentally changed the way we do mathematics. If we want to understand this change and appreciate its importance, we must analyze it on two levels. One concerns the compositional function of algebraic symbols as tools for representing complexity; the other concerns the referential function of algebraic symbols, which enables their use as tools for describing objects (such as polynomials), properties (such as irreducibility), relations (such as divisibility), and operations (...) (such as factorization). The reconstruction of both the compositional function and the referential function of algebraic symbols requires the use of different analytic tools and the taking of different temporal perspectives. In this chapter, we offer both: a reconstruction of the compositional function of algebraic symbols, and a reconstruction of their referential function. (shrink)

By a sentential logic we understand a pair, where S is a sentential language, i.e. an absolutely free algebra freely generated by an infinite set p, q, r,... of sentential variables and endowed with countably many finitary connectives §1, §2,... and C is a consequence operation on S, the underlying set of S, satisfying the condition of structurality: eC ⊆ C, for every endomorphism e of S and for every X ⊆ S. If no confusion is likely we shall (...) identify a logic with its consequence operation C. A logic C is standard if C = [ {C : Y ⊆ X & Y is finite}, for all X ⊆ S. (shrink)

This book is intended for mathematicians. Its origins lie in a course of lectures given by an algebraist to a class which had just completed a sub stantial course on abstract algebra. Consequently, our treatment ofthe sub ject is algebraic. Although we assurne a reasonable level of sophistication in algebra, the text requires little more than the basic notions of group, ring, module, etc. A more detailed knowledge of algebra is required for some of . the exercises. (...) We also assurne a familiarity with the main ideas of set theory, including cardinal numbers and Zorn's Lemma. In this book, we carry out a mathematical study of the logic used in mathematics. We do this by constructing a mathematical model oflogic and applying mathematics to analyse the properties of the model. We therefore regard all our existing knowledge of mathematics as being applicable to the analysis of the model, and in particular we accept set theory as part of the meta-Ianguage. We are not attempting to construct a foundation on which all mathematics is to be based-rather, any conclusions to be drawn about the foundations of mathematics co me only by analogy with the model, and are to be regarded in much the same way as the conclusions drawn from any scientific theory. (shrink)

It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in all Heyting (...) algebras, unless they are already equivalent to a formula of intuitionistic calculus. These facts relativize to connectives over intermediate logics. In particular, the intermediate logic with values in the chain of length n may be "completed" conservatively by adding a single unary connective, so that the expanded system does not allow further axiomatic extensions by new connectives. (shrink)

This comprehensive text shows how various notions of logic can be viewed as notions of universal algebra providing more advanced concepts for those who have an introductory knowledge of algebraic logic, as well as those wishing to delve into more theoretical aspects.

Einstein algebras have been suggested (Earman 1989) and rejected (Rynasiewicz 1992) as a way to avoid the hole argument against spacetime substantivalism. In this article, I debate their merits and faults. In particular, I suggest that a gauge‐invariant interpretation of Einstein algebras that avoids the hole argument can be associated with one approach to quantizing gravity, and, for this reason, is at least as well motivated as sophisticated substantivalist and relationalist interpretations of the standard tensor formalism.

The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary (...) set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian. (shrink)

We generalize the double negation construction of Boolean algebras in Heyting algebras to a double negation construction of the same in Visser algebras. This result allows us to generalize Glivenko’s theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras.

Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra up to isomorphism. In (...) this paper we analyze the complexity of the question "Does B have invariant x?" For each x ∈ In we define a complexity class Γx that could be either Σⁿ, Πⁿ, Σⁿ ∧ Πⁿ, or Πω+1 depending on x, and we prove that the set of indices for computable Boolean algebras with invariant x is complete for the class Γx. Analogs of many of these results for computably enumerable Boolean algebras were proven in earlier works by Selivanov. In a more recent work, he showed that similar methods can be used to obtain the results for computable ones. Our methods are quite different and give new results as well. As the algebras we construct to witness hardness are all dense, we establish new similar results for the complexity of various isomorphism problems for dense Boolean algebras. (shrink)

Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is currently lacking, and the theory of Nelson algebras remains largely unknown to most logicians. This paper aims to fill this gap by focussing on the essential developments in the field over the past two decades. Additionally, we explore generalisations of Nelson algebras, such as N4-lattices which (...) correspond to the paraconsistent version of Nelson's logic, as well as their applications to other areas of interest to logicians, such as duality and rough set theory. A general representation theorem states that each Nelson algebra is isomorphic to a subalgebra of a rough set-based Nelson algebra induced by a quasiorder. Furthermore, a formula is a theorem of Nelson logic if and only if it is valid in every finite Nelson algebra induced by a quasiorder. (shrink)

The Algebra of Revolution is the first book to study Marxist method as it has been developed by the main representatives of the classical Marxist tradition, namely Marx and Engels, Luxembourg, Lenin, Lukacs, Gramsci, and Trotsky. This book provides the only single volume study of major Marxist thinkers' views on the crucial question of the dialectic, connecting them with pressing contemporary, political and theoretical questions. This title available in eBook format. Click here for more information . Visit our eBookstore (...) at: www.ebookstore.tandf.co.uk. (shrink)

A Hilbert algebra with supremum is a Hilbert algebra where the associated order is a join-semilattice. This class of algebras is a variety and was studied in Celani and Montangie . In this paper we shall introduce and study the variety of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras, which are Hilbert algebras with supremum endowed with a modal operator $${\Diamond}$$ ◊ . We give a topological representation for these algebras using the topological spectral-like representation for Hilbert algebras with supremum (...) given in Celani and Montangie . We will consider some particular varieties of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras. These varieties are the algebraic counterpart of extensions of the implicative fragment of the intuitionistic modal logic $${\mathbf{IntK}_{\Diamond}}$$ IntK ◊ . We also determine the congruences of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras in terms of certain closed subsets of the associated space, and in terms of a particular class of deductive systems. These results enable us to characterize the simple and subdirectly irreducible $${H_{\Diamond}^{\vee }}$$ H ◊ ∨ -algebras. (shrink)

The Belnap–Dunn logic is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point of (...) view ofAlgebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies. (shrink)

We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to 0 can be recovered from the corresponding algebra in a canonical way. This method also establishes links between proof-theoretic ordinal analysis and the work (...) which has been done in the last two decades on provability logic and reflection principles. Because of its abstract algebraic nature, we hope that it will also be of interest for non-prooftheorists. (shrink)