Is Each Boolean Algebra , B , h 2 ( B ) - Unsupported ?
نویسنده
چکیده
If κ is an infinite cardinal, a complete Boolean algebra B is called κ-supported if and only if for each sequence 〈bβ : β < κ〉 of elements of B there holds V α<κ W β>α bβ = W A∈[κ]κ V β∈A bβ. We consider the problem of the existence of a non-atomic complete Boolean algebra B which is h2(B)-supported, where h2(B) is the minimal cardinal κ such that B is not (κ, 2)-distributive.
منابع مشابه
DIRECTLY INDECOMPOSABLE RESIDUATED LATTICES
The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...
متن کاملSome Forcing Related Convergence Structures on Complete Boolean Algebras
Let convergences λi : B → P (B), i ≤ 4, on a complete Boolean algebra B be defined in the following way. For a sequence x = 〈xn : n ∈ ω〉 in B and the corresponding B-name for a subset of ω, τx = {〈ň, xn〉 : n ∈ ω}, let λi(x) = { {‖τx is infinite‖} if bi(x) = 1B, ∅ otherwise, where b1(x) = ‖τx is finite or cofinite‖, b2(x) = ‖τx is not unsupported‖, b3(x) = ‖τx is not a splitting real‖ and b4(x) ...
متن کاملIsomorphisms of Sums of Countable Boolean Algebras
Denote by nA the sum of n copies of a Boolean algebra A. We prove that, for any countable Boolean algebra A, nA at mA with m > n implies nA a (n + \)A. In [2], W. Hanf constructed a Boolean algebra H isomorphic to the direct product H X H X H but not to H X H. This result of Hanf was strengthened by J. Ketonen in [4]: there exists even a countable Boolean algebra with this property. In [1], P. ...
متن کاملReaping Numbers of Boolean Algebras
A subsetA of a Boolean algebra B is said to be (n,m)reaped if there is a partition of unity P ⊂ B of size n such that |{b ∈ P : b∧a 6= ∅}| ≥ m for all a ∈ A. The reaping number rn,m(B) of a Boolean algebra B is the minimum cardinality of a set A ⊂ B\ {0} such which cannot be (n,m)-reaped. It is shown that, for each n ∈ ω, there is a Boolean algebra B such that rn+1,2(B) 6= rn,2(B). Also, {rn,m(...
متن کاملUncountable Boolean Algebras, Number of Endomorphism and Width
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 car...
متن کامل