For I a proper, countably complete ideal on P(X) for some set X, can the quotient Boolean algebra P(X)/I be complete? This question was raised by Sikorski in 1949. By a simple projection argument as for measurable cardinals, it can be assumed that X is an uncountable cardinal kappa, and that I is a kappa-complete ideal on P(kappa) containing all singletons. In this paper we provide consequences from and consistency results about completeness.
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number of subalgebras is not smaller than the number of endomorphisms, and other related inequalities. Lastly we deal with the obtainment of the supremum of the cardinalities of sets of pairwise incomparable elements of a Boolean algebra.
In this article, we introduce a lattice congruence with respect to a nonempty ideal $I$ of a distributive lattice $L$ and a derivation $d$ on $L$ denoted by $θ_I^d$. We investigate some necessary and sufficient conditions for the quotient algebra $L/θ_I^d$ to become a Boolean algebra.
The structure of quotient Boolean algebras in terms of cardinal invariants is investigated. Some results of Gitik and Shelah regarding atomless ideals are reproved and proofs are significantly simplified.
It is shown that there exists a complete, atomless, sigma-centered Boolean algebra, which does not contain any regular countable subalgebra if and only if there exist a nowhere dense ultrafilter. Therefore the existence of such algebras is undecidable in ZFC.
We prove that any Boolean algebra with the subsequential completeness property contains an independent family of size continuum. This improves a result of Argyros from the 80ties which asserted the existence of an uncountable independent family. In fact we prove it for a bigger class of Boolean algebras satisfying much weaker properties. It follows that the Stone spaces of all such Boolean algebras contains a copy of the Cech-Stone compactification of the integers and the Banach space of contnuous functions on them has $l_\infty$ as a quotient. Connections with the Grothendieck property in Ban…
We study a two-parameter generalization of the Freese-Nation Property of boolean algebras and its order-theoretic and topological consequences. For every regular infinite κ, the (κ,κ)-FN, the (κ^+,κ)-FN, and the κ-FN are known to be equivalent; we show that the family of properties (λ,μ)-FN for λ>μform a true two-dimensional hierarchy that is robust with respect to coproducts, retracts, and the exponential operation. The (κ,\aleph_0)-FN in particular has strong consequences for base properties of compacta (stronger still for homogeneous compacta), and these consequences have natural duals in t…
We introduce and examine order convergence and the interval topology on partially ordered sets in general. Problem 76 of Birkhoff's "Lattice Theory" asks whether for complete Boolean algebras the order topology and the interval topology coincide. We answer this question in the negative.
We give a necessary and sufficient condition for an atomless Boolean algebra to be countably generated, and use it to give new proofs of some some know facts due to Gaifman-Hales and Solovay and also due to Jech, Kunen and Magidor. We also show that Jensen's coding theorem can be used to provide cardinal preserving countably generated complete Boolean algebras of arbitrary large cardinality. This answers a question of Jech [5] from 1976.
We apply the Dual Ramsey Theorem of Graham and Rothschild to prove the Ramsey property for classes of finite Boolean algebras with distinguished ideals. This allows us to compute the universal minimal flow of the group of automorphisms of $\mathcal{P}(ω_1)/\rm{fin},$ should it be isomorphic to $\mathcal{P}(ω)/\rm{fin}$ or not, and of other quotients of power set algebras. Taking Fraïssé limits of these classes, we can compute universal minimal flows of groups of homeomorphisms of the Cantor set fixing some closed subsets.
We investigate the sequential topology $τ_s$ on a complete Boolean algebra $B$ determined by algebraically convergent sequences in $B$. We show the role of weak distributivity of $B$ in separation axioms for the sequential topology. The main result is that a necessary and sufficient condition for $B$ to carry a strictly positive Maharam submeasure is that $B$ is ccc and that the space $(B,τ_s)$ is Hausdorff. We also characterize sequential cardinals.
We prove the decidability for a class of languages which extend BST and NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with powerset fall in this last subclass.
We prove the following completeness result about classical realizability: given any Boolean algebra with at least two elements, there exists a Krivine-style classical realizability model whose characteristic Boolean algebra is elementarily equivalent to it. This is done by controlling precisely which combinations of so-called "angelic" (or "may") and "demonic" (or "must") nondeterminism exist in the underlying model of computation.
The following results are proved: (a) In a model obtained by adding aleph_2 Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact cardinal, the existence of a c.c.c. complete Boolean algebras without the weak Freese-Nation property consistent with GCH. (c) Under some consequences of the negation of 0^#, the weak Freese-Nation property of (P(omega),subseteq) is equivalent to the weak Freese-Nation property of any of C(kappa) or R(kappa) for uncountable kappa. (d) Modulo consistency of (aleph_…
I show that assuming PFA, every proper Scott set is the standard system of a model of PA. A Scott set X is proper if it is arithmetically closed and the quotient Boolean algebra X/Fin is a proper partial order.
We prove a compactness theorem for full Boolean-valued models. As an application, we show that if $T$ is a complete countable theory and $\mathcal{B}$ is a complete Boolean algebra, then $λ^+$-saturated $\mathcal{B}$-valued models of $T$ exist. Moreover, if $\mathcal{U}$ is an ultrafilter on $T$ and $\mathbf{M}$ is a $λ^+$-saturated $\mathcal{B}$-valued model of $T$, then whether or not $\mathbf{M}/\mathcal{U}$ is $λ^+$-saturated just depends on $\mathcal{U}$ and $T$; we say that $\mathcal{U}$ $λ^+$-saturates $T$ in this case. We show that Keisler's order can be formulated as follows: $T_0 \tr…
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof of completeness theorem in propositional logic will be given using Stone's theorem from Boolean algebra.
We present a new approach to ternary Boolean algebras in which negation is derived from the ternary operation. The key aspect is the replacement of complete commutativity by other axioms that do not require the ternary operation to be symmetric.
This paper deals with conditions under which the quotient of $L$-fuzzy up-sets forms a complete lattice by using terminologies of closure operators. It first gives a condition that a family of some subsets of a nonempty set can be represented by $L$-fuzzy up-sets, which is then used to formulate a necessary and sufficient condition under which the quotient of $L$-fuzzy up-sets forms a complete lattice. This paper finally shows that the quotient of a kind of $L$-fuzzy up-sets is isomorphic to an interval generated by an $L$-fuzzy up-set.
We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $λ$ for which there is $μ< λ\leq 2^μ$, we construct a regular ultrafilter D on $λ$ such that (i) for any model $M$ of a stable theory or of the random graph, $M^λ/D$ is $λ^+$-saturated but (ii) if $Th(N)$ is not simple or not low then $N^λ/D$ is not $λ^+$-saturated. The non-saturation result relies on the notion of flexible ultrafilters. To prove the saturation result we develop a property of a class of simple theories, called…
We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms, whence we recover the definition of BGL. Naturally, it is conservative over usual Boolean logic. Our contributions are the following: (1) We give a natural semantics of BGL based on Boolean relations, i.e. it is a multivalued semantics, and show adequacy of this semantics for the corresponding notions of entailment. (2) We show that the complexity of evaluation …
These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean valued models and full details of all proofs are given. We focus our presentation using the boolean algebra language and defining an iteration system as a directed and commutative system of complete and injective homomorphisms between complete and atomless boolean algebras. It is well known that the boolean algebra approach to forcing and iterations is fully e…
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings exhibit a large cardinal nature, and the Boolean ultrapower construction thereby unifies two central themes of set theory---forcing and large cardinals---by revealing them to be two facets of a single underlying construction, the Boolean ultrapower.
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment by a predicate for the ideal of finite sets, and a novel one involves predicates giving congruence conditions on the cardinality of finite sets. We focus on three examples, and classify them by expressive power.
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting. Furthermore, we discuss the relation with Tukey reducibility and prove that, assuming the Continuum Hypothesis, there exist ultrafilters on the Cohen algebra which are RK-equivalent in the generalized sense but Tukey-incomparable, in stark contrast with the classical setting.
We show that there are semi-Cohen Boolean algebras which cannot be completely embedded into Cohen Boolean algebras. Using the ideas from this proof, we give a simpler argument for a theorem of S. Koppelberg and S. Shelah, stating that there are complete subalgebras of Cohen algebras which are not Cohen themselves.
We give a description of the Tripos To Topos construction in terms of four free constructions. We prove that these compose up to give a free construction from the category of triposes and logical morphisms to the category of toposes and logical functors. Then we show that other similar constructions, i.e. the one given by Frey in \cite{frey} and that of Carboni in \cite{carbons} are instances of this one.
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model theory utilizing only irreducible Boolean algebras (which are all isomorphic to the two-element Boolean algebra). In this paper, we prove an analogous result for any first-order logic with an algebraic semantics satisfying certain minimal assumptions, and we then apply our result to first-order quantum logic.
