We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable separable positive measure was suggested by Talagrand in 1980, which is that the Stone space K of (...) the algebra satisfies that its space M(K) of measures is weakly separable, equivalently that C(K) embeds into l∞. We show that there is a ZFC example of a Boolean algebra (so of a compact space) which satisfies this condition and does not support a separable strictly positive measure. However, we use this property as a tool in a proof which shows that under MA+⇁ CH every atomless ccc Boolean algebra of size < c carries a nonatomic strictly positive measure. Examples are given to show that this result does not hold in ZFC. Finally, we obtain a characterisation of Boolean algebras that carry a strictly positive nonatomic measure in terms of a chain condition, and we draw the conclusion that under MA+⇁ CH every atomless ccc Boolean algebra satisfies this stronger chain condition. (shrink)

We consider a classM of Boolean algebras with strictly positive, finitely additive measures. It is shown thatM is closed under iterations with finite support and that the forcing via such an algebra does not destroy the Lebesgue measure structure from the ground model. Also, we deduce a simple characterization of Martin's Axiom reduced to the classM.

This work concerns constructive aspects of measure theory. By considering metric completions of Boolean algebras – an approach first suggested by Kolmogorov – one can give a very simple construction of e.g. the Lebesgue measure on the unit interval. The integration spaces of Bishop and Cheng turn out to give examples of such Boolean algebras. We analyse next the notion of Borel subsets. We show that the algebra of such subsets can be characterised in a (...) pointfree and constructive way by an initiality condition. We then use our work to define in a purely inductive way the measure of Borel subsets. (shrink)

In this article, we shall show the generalized notions of distributivity of Boolean algebras have essential relations with several axioms and properties of set theory, say the Axiom of Choice, the Axiom of Dependence Choice, the Prime Ideal Theorems, Martin's axioms, Lebesgue measurability and so on.

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow (...) and Fremlin’s result stating that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)

On our ordinary representations of space, space is composed of indivisible, dimensionless points; extended regions are understood as infinite sets of points. Region-based theories of space reverse this atomistic picture, by taking as primitive several relations on extended regions, and recovering points as higher-order abstractions from regions. Over the years, such theories have focused almost exclusively on the topological and geometric structure of space. We introduce to region-based theories of space a new primitive binary relation (‘qualitative probability’) that is tied (...) to _measure_. It expresses that one region is _smaller than or equal in size_ to another. Algebraic models of our theory are _separation_ _σ_-_algebras with qualitative probability_: \((\mathbb {B}, \ll, \preceq )\), where \(\mathbb {B}\) is a Boolean _σ_-algebra, ≪ is a separation relation on \(\mathbb {B}\), and ≼ is a qualitative probability on \(\mathbb {B}\). We show that from algebraic models of this kind we can, in an interesting class of cases, recover a compact Hausdorff topology _X_, together with a countably additive measure _μ_ on a _σ_-field of Borel subsets of that topology, and that \((\mathbb {B}, \ll, \preceq )\) is isomorphic to a ‘standard model’ arising out of the pair (_X_, _μ_). It follows from one of our main results that any closed ball in Euclidean space, \(\mathbb {R}^{n}\), together with Lebesgue measure arises in this way from a separation _σ_-algebra with qualitative probability. (shrink)

Deontic logic is devoted to the study of logical properties of normative predicates such as permission, obligation and prohibition. Since it is usual to apply these predicates to actions, many deontic logicians have proposed formalisms where actions and action combinators are present. Some standard action combinators are action conjunction, choice between actions and not doing a given action. These combinators resemble boolean operators, and therefore the theory of boolean algebra offers a well-known athematical framework to study the (...) properties of the classic deontic operators when applied to actions. In his seminal work, Segerberg uses constructions coming from boolean algebras to formalize the usual deontic notions. Segerberg’s work provided the initial step to understand logical properties of deontic operators when they are applied to actions. In the last years, other authors have proposed related logics. In this chapter we introduce Segerberg’s work, study related formalisms and investigate further challenges in this area. (shrink)

Starting from an abstract setting for the Lüders-von Neumann quantum measurement process and its interpretation as a probability conditionalization rule in a non-Boolean event structure, the author derived a certain generalization of operator algebras in a preceding paper. This is an order-unit space with some specific properties. It becomes a Jordan operator algebra under a certain set of additional conditions, but does not own a multiplication operation in the most general case. A major objective of the present paper (...) is the search for such examples of the structure mentioned above that do not stem from Jordan operator algebras; first natural candidates are matrix algebras over the octonions and other nonassociative rings. Therefore, the case when a nonassociative commutative multiplication exists is studied without assuming that it satisfies the Jordan condition. The characteristics of the resulting algebra are analyzed. This includes the uniqueness of the spectral resolution as well as a criterion for its existence, subalgebras that are Jordan algebras, associative subalgebras, and more different levels of compatibility than occurring in standard quantum mechanics. However, the paper cannot provide the desired example, but contribute to the search by the identification of some typical differences between the potential examples and the Jordan operator algebras and by negative results concerning some first natural candidates. The possibility that no such example exists cannot be ruled out. However, this would result in an unexpected new characterization of Jordan operator algebras, which would have a significant impact on quantum axiomatics since some customary axioms (e.g., power-associativity or the sum postulate for observables) might turn out to be redundant then. (shrink)

We address the classification of the possible finitely-additive probability measures on the Boolean algebra of definable subsets of M which are invariant under the natural action of $\operatorname{Aut}(M)$ . This pursuit requires a generalization of Shelah's forking formulas [8] to "essentially measure zero" sets and an application of Myer's "rank diagram" [5] of the Boolean algebra under consideration. The classification is completed for a large class of ℵ 0 -categorical structures without the independence property including (...) those which are stable. (shrink)

We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on proof terms and equality predicate on terms. Moreover, the completeness theorem and certain generalizations of Stone’s representation theorem are obtained for all proposed algebras.

In this paper we consider properties, related to model-completeness, of the theory of integrally closed commutative regular rings. We obtain the main theorem claiming that in a Boolean algebra B, the truth of a prenex Σn-formula whose parameters ai partition B, can be determined by finitely many conditions built from the first entry of Tarski invariant T(ai)'s, n-characteristic D(n, ai)'s and the quantities S(ai, l) and S'(ai, l) for $l < n$. Then we derive two important theorems. One (...) claims that for any Boolean algebras A and B, an embedding of A into B preserving D(n, a) for all a ∈ A is a Σn-extension. The other claims that the theory of n-separable Boolean algebras admits elimination of quantifiers in a simple definitional extension of the language of Boolean algebras. Finally we translate these results into the language of commutative regular rings. (shrink)

I flesh out the sense in which the informational approach to interpreting quantum mechanics, as defended by Pitowsky and Bub and lately by a number of other authors, is (neo-)Bohrian. I argue that on this approach, quantum mechanics represents what Bohr called a “natural generalisation of the ordinary causal description” in the sense that the idea (which philosophers of science like Stein have argued for on the grounds of practical and epistemic necessity) that understanding a theory as a theory of (...) physics requires that one be able to “schematise the observer” within it is elevated in quantum mechanics to the level of a postulate in the sense that interpreting the outcome of a measurement interaction, as providing us with information about the world, requires as a matter of principle, the specification of a schematic representation of an observer in the form of a ‘Boolean frame’—the Boolean algebra representing the yes-or-no questions associated with a given observable representative of a given experimental context. I argue that the approach’s central concern is with the methodological question of how to assign physical properties to what one takes to be a system in a given experimental context, rather than the metaphysical question of what a given state vector represents independently of any context, and I show how the quantum generalisation of the concept of an open system may be used to assuage Einstein’s complaint that the orthodox approach to quantum mechanics runs afoul of the supposedly fundamental methodological requirement to the effect that one must always be able, according to Einstein, to treat spatially separated systems as isolated from one another. (shrink)

We show that for every uncountable regular κ and every κ-complete Boolean algebra B of density ≤ κ there is a filter F ⊆ B such that the number of partitions of length < modulo κF is ≤2<κ. We apply this to Boolean algebras of the form P/I, where I is a κ-complete κ-dense ideal on X.

An observable on a quantum structure is any σ-homomorphism of quantum structures from the Borel σ-algebra of the real line into the quantum structure which is in our case a monotone σ-complete effect algebra with the Riesz Decomposition Property. We show that every observable is a smearing of a sharp observable which takes values from a Boolean σ-subalgebra of the effect algebra, and we prove that for every element of the effect algebra there corresponds a (...) spectral measure. (shrink)

The game is played on a complete Boolean algebra in ω-many moves. At the beginning White chooses a non-zero element p of and, in the nth move, White chooses a positive pn

Boolean (...) class='Hi'>algebra carries a strictly positive Maharam submeasure or contains a countable dense subset, then Black has a winning strategy in the game played on . A Suslin algebra on which the game is undetermined is constructed and the game is compared with the well-known cut-and-choose games , and introduced by Jech. (shrink)

Contrary to what is stated in Lemma 7.1 of [8], it is shown that some Boolean algebras of finitary logic admit finitely additive probabilities that are not σ-additive. Consequences of Lemma 7.1 are reconsidered. The concept of a C-σ-additive probability on B (where B and C are Boolean algebras, and $\mathscr{B} \subseteq \mathscr{C}$ ) is introduced, and a generalization of Hahn's extension theorem is proved. This and other results are employed to show that every S̄(L)-σ-additive probability on s̄(L) (...) can be extended (uniquely, under some conditions) to a σ-additive probability on S̄(L), where L belongs to a quite extensive family of first order languages, and S̄(L) and s̄(L) are, respectively, the Boolean algebras of sentences and quantifier free sentences of L. (shrink)

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra $\mathcal {B}$ to each formula. We show some basic results regarding the effect of the properties of $\mathcal {B}$ on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author’s result about counting types, as well as the notion of a (...) smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transferred to measures—in particular, giving an alternative proof of the fact that every measure in a dependent theory can be extended to a smooth one. We also study the stable case. We consider this paper as an invitation for more research into the topic of Boolean types. (shrink)

We give some results concerning various generalized continuum cardinals. The results answer some natural questions which have arisen in preparing a new edition of 5. To make the paper self-contained we define all of the cardinal functions that enter into the theorems here. There are many problems concerning these new functions, and we formulate some of the more important ones.

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic (...) logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject. (shrink)

The recently developed technique of Bohrification associates to a (unital) C*-algebra Athe Kripke model, a presheaf topos, of its classical contexts;in this Kripke model a commutative C*-algebra, called the Bohrification of A;the spectrum of the Bohrification as a locale internal in the Kripke model. We propose this locale, the ‘state space’, as a (n intuitionistic) logic of the physical system whose observable algebra is A.We compute a site which externally captures this locale and find that externally its (...) points may be identified with partial measurement outcomes. This prompts us to compare Scott-continuity on the poset of contexts and continuity with respect to the C*-algebra as two ways to mathematically identify measurement outcomes with the same physical interpretation. Finally, we consider the not-not-sheafification of the Kripke model on classical contexts and obtain a space of measurement outcomes which for commutative C*-algebras coincides with the spectrum. The construction is functorial on the category of C*-algebras with commutativity reflecting maps. (shrink)

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)

We prove completeness of the propositional modal logic S 4 for the measure algebra based on the Lebesgue-measurable subsets of the unit interval, [0, 1]. In recent talks, Dana Scott introduced a new measure-based semantics for the standard propositional modal language with Boolean connectives and necessity and possibility operators, and . Propositional modal formulae are assigned to Lebesgue-measurable subsets of the real interval [0, 1], modulo sets of measure zero. Equivalence classes of Lebesgue-measurable subsets form (...) a measure algebra, , and we add to this a non-trivial interior operator constructed from the frame of ‘open’ elements—elements in with an open representative. We prove completeness of the modal logic S 4 for the algebra . A corollary to the main result is that non-theorems of S 4 can be falsified at each point in a subset of the real interval [0, 1] of measure arbitrarily close to 1. A second corollary is that Intuitionistic propositional logic (IPC) is complete for the frame of open elements in. (shrink)

One kind of generalized measures called quantum measures on finite effect algebras, which fulfil the grade-2 additive sum rule, is considered. One basis of vector space of quantum measures on a finite effect algebra with the Riesz decomposition property (RDP for short) is given. It is proved that any diagonally positive symmetric signed measure \(\lambda \) on the tensor product \(E\otimes E\) can determine a quantum measure \(\mu \) on a finite effect algebra \(E\) with the (...) RDP such that \(\mu (x)=\lambda (x\otimes x)\) for any \(x\in E\) . Furthermore, some conditions for a grade-2 additive measure \(\mu \) on a finite effect algebra \(E\) are provided to guarantee that there exists a unique diagonally positive symmetric signed measure \(\lambda \) on \(E\otimes E\) such that \(\mu (x)=\lambda (x\otimes x)\) for any \(x\in E\) . At last, it is showed that any grade- \(t\) quantum measure on a finite effect algebra \(E\) with the RDP is essentially established by the values on a subset of \(E\). (shrink)

It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.

We construct a sheaf-theoretic representation of quantum probabilistic structures, in terms of covering systems of Boolean measure algebras. These systems coordinatize quantum states by means of Boolean coefficients, interpreted as Boolean localization measures. The representation is based on the existence of a pair of adjoint functors between the category of presheaves of Boolean measure algebras and the category of quantum measure algebras. The sheaf-theoretic semantic transition of quantum structures shifts their physical significance from (...) the orthoposet axiomatization at the level of events, to the sheaf-theoretic gluing conditions at the level of Boolean localization systems. (shrink)

A Boolean algebra B that has a well-founded sublattice L which generates B is called a well-generated Boolean algebra. If in addition, L is generated by a complete set of representatives for B , then B is said to be canonically well-generated .Every WG Boolean algebra is superatomic. We construct two basic examples of superatomic non well-generated Boolean algebras. Their cardinal sequences are 1,0,1,1 and 0,0,20,1.Assuming MA , we show that every algebra (...) with one of the cardinal sequences , α<1, λ<20, or 0,20,1,1 is CWG.Assuming CH, or alternatively assuming MA , we determine which cardinal sequences admit only WG Boolean algebras.We find a necessary and sufficient condition for the canonical well-generatedness of algebras whose cardinal sequence has the form , α<1. We conclude that if such an algebra is CWG, then all of its quotients are CWG. We show that the above is not true for general Boolean algebras. We also conclude that if the cardinality of such an algebra is less than the cardinal defined below, then it is CWG. The cardinal is the least cardinality of an unbounded subset of {f f : ω → ω}.We investigate questions concerning embeddability, quotients and subalgebras of WG and CWG Boolean algebras, and construct various counter-examples. (shrink)

Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure. They were introduced and studied by Maharam [D. Maharam, An algebraic characterization of measure algebras, Ann. of Math. 48 154–167] in relation to Von Neumann’s problem on the characterization of measure algebras. The question whether every Maharam algebra is a measure algebra has been the main open problem in this area for around 60 years. It was finally resolved by Talagrand [M. Talagrand, Maharam’s (...) problem, preprint, 31 pages, 2006] who provided the first example of a Maharam algebra which is not a measure algebra. In this paper we survey some recent work on Maharam algebras in relation to the two conditions proposed by Von Neumann: weak distributivity and the countable chain condition. It turns out that by strengthening either one of these conditions one obtains a ZFC characterization of Maharam algebras. We also present some results on Maharam algebras as forcing notions showing that they share some of the well-known properties of measure algebras. (shrink)

We prove that the poset algebra of every scattered poset with finite width is embeddable in the poset algebra of a well ordered poset.

We consider the sets definable in the countable models of a weakly o-minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic , in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, (...) within expansions of Boolean lattices, every weakly o-minimal theory is p-ω-categorical. (shrink)

We study L∞κ-freeness in the variety of Boolean algebras. It is shown that some of the theorems on L∞κ-free algebras which are known to hold in varieties such as groups, abelian groups etc. are also true for Boolean algebras. But we also investigate properties such as the ccc of L∞κ-free Boolean algebras which have no counterpart in the varieties above.

We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has αth-jump degree d if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of A with universe ω (...) in which the functions and relations have degree at most c. We show that every degree d ≥ 0 (ω) is the ωth jump degree of a Boolean algebra, but that for $n no Boolean algebra has nth-jump degree $\mathbf{d} > 0^{(n)}$ . The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribed properties. (shrink)