A complete Boolean algebra that has no proper atomless complete subalgebra
英文摘要:
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Thomas Jech, Saharon Shelah
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of Ben-Yaacov [4], the former case of independence can be seen as the discrete version of the latter.
The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra
本文证明随机有序图是规范有序无原子布尔代数的半收缩,回答了Bartošová和Scow的公开问题。
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and embeddings between them.
Oscillating subalgebras of the atomless countable Boolean algebra
该研究证明了具有3个原子的布尔代数在可数无原子布尔代数中的大拉姆齐度为无穷,推进了拉姆齐理论在布尔代数领域的相关研究
In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.
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.
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 show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subset A such that 2^{|A|} = 2^{|B|}. This implies in particular that B has 2^{|B|} subalgebras. We also discuss some more general problems about subalgebras and free subsets of an algebra. The result on the number of subalgebras in a Boolean algebra solves a question of Monk. The paper is intended to be accessible as far as possible to a general audience, in particular we have confined the more technical material to a ``black box'' at the end. The proof involves a vari…
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) = smm(A) < u(A), answering questions raised by [Mon08] and [Mon11].
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 ar…
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
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…
We investigate reflection-type problems on the class SPM, of Boolean algebras carrying strictly positive finitely additive measures. We show, in particular, that in the constructible universe there is a Boolean algebra $\mathfrak A$ which is not in SPM but every subalgebra of $\mathfrak A$ of cardinality $\mathfrak c$ admits a strictly positive measure. This result is essentially due to Farah and Velickovic.
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional subalgebra as equivalent to a corresponding boolean propositional algebra. It is also shown that the images of a homomorphic function on a boolean propositional algebra have the relationship of boolean propositional algebra and its subalgebra. The necessary and sufficient conditions for that homomorphic function to be onto-order preserving, and also an extensi…
Moisil logic, having as algebraic counterpart Łukasiewicz-Moisil algebras, provide an alternative way to reason about vague information based on the following principle: a many-valued event is characterized by a family of Boolean events. However, using the original definition of Łukasiewicz-Moisil algebra, the principle does not apply for subalgebras. In this paper we identify an alternative and equivalent definition for the $n$-valued Łukasiewicz-Moisil algebras, in which the determination principle is also saved for arbitrary subalgebras, which are characterized by a Boolean algebra and a fa…
The completeness and congruences of quasi-Boolean algebras
本文研究拟布尔代数的完备性与同余关系,刻画了有限不可约拟布尔代数,证明了标准完备性及同余扩张性质,并完整描述了同余的扩张方式。
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.
The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly regular measure are metrically isomorphic to a subalgebras of the Jordan algebra with the Lebesgue measure. We give some partial analogues to be used for a classification of algebras that support a finitely additive non-atomic measure with a higher uniform regularity number. We show that some naturally induced equivalence relations connected to metric isomorphis…
We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise Boolean domains equipped with an orientation, or as full structure sheaves on piecewise Boolean domains.
Let $L$ be a complete orthomodular lattice. There is a one to one correspondence between complete boolean subalgebras of $L$ contained in the center of $L$ and endomorphisms $j$ of $L$ satisfying the Borceux-Van den Bossche conditions.
We show that, consistently, for some regular cardinals theta<lambda, there exists a Boolean algebra B such that B=lambda^+ and for every subalgebra B' of B of size lambda^+ we have Depth(B')=theta.
An algebra $\mathbb A$ is called a perfect extension of its subalgebra $\mathbb B$ if every congruence of $\mathbb B$ has a unique extension to $\mathbb A$. This terminology was used by Blyth and Varlet [1994]. In the case of lattices, this concept was described by Grätzer and Wehrung [1999] by saying that $\mathbb A$ is a congruence-preserving extension of $\mathbb B$. Not many investigations of this concept have been carried out so far. The present authors in another recent study faced the question of when a de Morgan algebra $\mathbb M$ is perfect extension of its Boolean subalgebra $B(\mat…
We show that an atomic orthomodular lattice L can be reconstructed up to isomorphism from the poset B(L) of Boolean subalgebras of L. A motivation comes from quantum theory and the so-called topos approach, where one considers the poset of Boolean sublattices of L=P(H), the projection lattice of the algebra B(H) of bounded operators on Hilbert space.
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.
Filtered Boolean powers of finite simple non-abelian Mal'cev algebras
本文研究有限单非阿贝尔Mal'cev代数关于可数无原子布尔代数的过滤布尔幂,给出其Fraïssé极限与自由代数同余类表示,并证明其自同构群具有小指标性质、强不可数共尾性和Bergman性质。
We prove in ZFC that for mu >= aleph_2 there is a sigma --ideal I on mu and a Boolean sigma --subalgebra B of the family of subsets of mu which includes I such that the natural homomorphism from B onto B/I cannot be lifted.
We consider $ω^n$-automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length $ω^n$ for some integer $n\geq 1$. We show that all these structures are $ω$-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for $ω^2$-automatic (resp. $ω^n$-automatic for $n>2$) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) is not determined by the axiomatic system ZFC. We infer from the proof of the above…
Inspired by the fundamental results obtained by P. Halmos and A. Monteiro, concerning equivalence relations and monadic Boolean algebras, we recall the `concrete' Rauszer Boolean algebra pointed out by C. Rauszer (1971), via un preorder R. On this algebra we can consider one of the several binary operations defined, in an abstract way, by A. Monteiro (1971). The Heyting-Brouwer subalgebra of constants (fixpoints), allows us to give a general framework to find representations of several special algebraic structures related to logic.
An interval algebra is a Boolean algebra which is isomorphic to the algebra of finite unions of half-open intervals, of a linearly ordered set. An interval algebra is hereditary if every subalgebra is an interval algebra. We answer a question of M. Bekkali and S. Todorčević, by showing that it is consistent that every $σ$-centered interval algebra of size $\mathfrak{b}$ is hereditary. We also show that there is, in ZFC, an hereditary interval algebra of cardinality $\aleph_1.$
We study (von Neumann) regular $^*$-subalgebras of $B(H)$, which we call R$^*$-algebras. The class of R$^*$-algebras coincides with that of "E$^*$-algebras that are pre-C$^*$-algebras" in the sense of Z. Szűcs and B. Takács. We give examples, properties and questions of R$^*$-algebras. We observe that the class of unital commutative R$^*$-algebras has a canonical one-to-one correspondence with the class of Boolean algebras. This motivates the study of R$^*$-algebras as that of noncommutative Boolean algebras. We explain that seemingly unrelated topics of functional analysis, like AF C$^*$-alge…
We prove that for every singular cardinal mu of cofinality omega, the complete Boolean algebra compP_mu(mu) contains as a complete subalgebra an isomorphic copy of the collapse algebra Comp Col(omega_1,mu^{aleph_0}). Consequently, adding a generic filter to the quotient algebra P_mu(mu)=P(mu)/[mu]^{<mu} collapses mu^{aleph_0} to aleph_1. Another corollary is that the Baire number of the space U(mu) of all uniform ultrafilters over mu is equal to omega_2. The corollaries affirm two conjectures by Balcar and Simon. The proof uses pcf theory.
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…
Complete Boolean algebras proved to be an important tool in topology and set theory. Two of the most prominent examples are B(kappa), the algebra of Borel sets modulo measure zero ideal in the generalized Cantor space {0,1}^kappa equipped with product measure, and C(kappa), the algebra of regular open sets in the space {0,1}^kappa, for kappa an infinite cardinal. C(kappa) is much easier to analyse than B(kappa) : C(kappa) has a dense subset of size kappa, while the density of B(kappa) depends on the cardinal characteristics of the real line; and the definition of C(kappa) is simpler. Indeed, C…
Monk asks (problems 13, 15 in his list; pi is the algebraic density):''For a Boolean algebra B, aleph_0 <= theta <= pi (B), does B have a subalgebra B' with pi (B')= theta ?'' If theta is regular the answer is easily positive, we show that in general it may be negative, but for quite many singular cardinals - it is positive; the theorems are quite complementary. Next we deal with pi-chi and we show that the pi-chi of an ultraproduct of Boolean algebras is not necessarily the ultraproduct of the pi-chi 's. We also prove that for infinite Boolean algebras A_i (i< kappa) and a non-principal ultra…
Let S be a set of states of a physical system and p(s) be the probability of the occurrence of an event when the system is in state s. A function p from S to [0,1] is called a numerical event or alternatively an S-probability. If a set P:={p(s)|s in S} is ordered by the order of real functions such that certain plausible requirements are fulfilled, P becomes an orthomodular poset in which properties can be described by the addition and comparison of functions. P is then called an algebra of S-probabilities or algebra of numerical events. We first answer the question under which circumstances i…
The Nikodym and Grothendieck properties of Boolean algebras and rings related to ideals
研究布尔代数和理想相关环的Nikodym和Grothendieck性质,证明若布尔代数不具有Nikodym性质则不具有Grothendieck性质,同时构造了具有Nikodym性质但不具有Grothendieck性质的布尔子代数和非分析布尔代数。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。