首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
We describe the countably saturated models and prime models (up to isomorphism) of the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal such that the supremum of the ideal exists. We prove that there are infinitely many completions of the theory of Boolean algebras with a distinguished ideal that do not have a countably saturated model. Also, we give a sufficient condition for a model of the theory TX of Boolean algebras with distinguished ideals to be elementarily equivalent to a countably saturated model of TX.  相似文献   

2.
Computable Homogeneous Boolean Algebras and a Metatheorem   总被引:1,自引:0,他引:1  
We consider computable homogeneous Boolean algebras. Previously, countable homogeneous Boolean algebras have been described up to isomorphism and a simple criterion has been found for the existence of a strongly constructive (decidable) isomorphic copy for such. We propose a natural criterion for the existence of a constructive (computable) isomorphic copy. For this, a new hierarchy of -computable functions and sets is introduced, which is more delicate than Feiner's. Also, a metatheorem is proved connecting computable Boolean algebras and their hyperarithmetical quotient algebras.  相似文献   

3.
The main purpose of this paper is to exhibit the decisive role that order continuity plays in the structure of locally compact Boolean algebras as well as in that of atomic topological Boolean algebras. We prove that the following three conditions are equivalent for a topological Boolean algebra B: (1) B is compact; (2) B is locally compact, Boolean complete, order continuous; (3) B is Boolean complete, atomic and order continuous. Note that under the discrete topology any Boolean algebra is locally compact.  相似文献   

4.
We study properties of different convergences in JW-algebras with a faithful normal state. The relationship between these convergences and similar convergences in enveloping von Neumann algebras is established. Based on this, ergodic theorems are proved.  相似文献   

5.
The Rudin‐Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised in terms of elementary embeddings of Boolean ultrapowers. The result is applied to show that the Rudin‐Keisler poset of some atomless complete Boolean algebras is nontrivial.  相似文献   

6.
本文研究了完备布尔代数L的商格Q(L),建立 L上q-集构成的集合Q′(L)与Q(L)之间的同构,得出了完备布尔代数的商格仍是完备布尔代数,并给出了完备布尔代数范畴的某些性质.  相似文献   

7.
We answer a question of J. Rosický and W. Tholen by showing that the class of complete Boolean algebras (which is a prereflective subcategory of the category of frames) is not an intersection of reflective subcategories of the category of frames. In order to deduce this result, we first prove the following observation (using some basic facts about congruence frames): the three-element chain belongs to every reflective subcategory of the category of frames which contains the class of complete Boolean algebras.Supported by the Categorical Topology Research Group at the University of Cape Town, under funding from the Foundation for Research Development and the University of Cape Town.  相似文献   

8.
We consider the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal where the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal where the supremum of the ideal exists. First, we find elementary invariants for Thprin and Thsa. If T is a theory in a first order language and α is a linear order with least element, then we let Sentalg(T) be the Lindenbaum-Tarski algebra with respect to T, and we let intalg(α) be the interval algebra of α. Using rank diagrams, we show that Sentalg(Thprin) ? intalg(ω4), Sentalg(Thmax) ? intalg(ω3) ? Sentalg(Thac), and Sentalg(Thsa) ? intalg(ω2 + ω2). For Thmax and Thac we use Ershov's elementary invariants of these theories. We also show that the algebra of formulas of the theory Tx of Boolean algebras with finitely many ideals is atomic.  相似文献   

9.
In this paper, the (weak) Boolean representation of R0‐algebras are investigated. In particular, we show that directly indecomposable R0‐algebras are equivalent to local R0‐algebras and any nontrivial R0‐algebra is representable as a weak Boolean product of local R0‐algebras (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

10.
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.  相似文献   

11.
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(X)/I, where I is a κ-complete κ-dense ideal on X. Mathematics Subject Classification: 06E05, 03C20.  相似文献   

12.
In this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set. At the end of the paper we show that the sentence “There is no non-trivial free group which is a set” is consistent with AST.  相似文献   

13.
We prove that all infinite Boolean rings (algebras) have the property PNP according to the digital (binary) nondeterminism.  相似文献   

14.
15.
Lynne Baur  Lutz Heindorf 《Order》1997,14(1):21-38
We investigate a new class of Boolean algebra, called initial chain algebras on pseudotrees. We discuss the relationship between this class and other classes of Boolean algebras. Every interval algebra, and hence every countable Boolean algebra, is an initial chain algebra. Every initial chain algebra on a tree is a superatomic Boolean algebra, and every initial chain algebra on a pseudotree is a minimally-generated Boolean algebra.We show that a free product of two infinite Boolean algebras is an initial chain algebra if and only if both factors are countable.  相似文献   

16.
17.
We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

18.
We study the quantum logics which satisfy the Riesz Interpolation Property. We call them the RIP logics. We observe that the class of RIP logics is considerable large—it contains all lattice quantum logics and, also, many (infinite) non‐lattice ones. We then find out that each RIP logic can be enlarged to an RIP logic with a preassigned centre. We continue, showing that the “nearly” Boolean RIP logics must be Boolean algebras. In a somewhat surprising contrast to this, we finally show that the attempt for the σ‐complete formulation of this result fails: We show by constructing an example that there is a non‐Boolean nearly Boolean σ‐RIP logic. As a result, there are interesting σ‐RIP logics which are intrinsically close to Boolean σ‐algebras. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

19.
We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom (DS) implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

20.
In this paper, every monadic implication algebra is represented as a union of a unique family of monadic filters of a suitable monadic Boolean algebra. Inspired by this representation, we introduce the notion of a monadic implication space, we give a topological representation for monadic implication algebras and we prove a dual equivalence between the category of monadic implication algebras and the category of monadic implication spaces.   相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号