Results 11 to 20 of about 1,728 (218)
A decomposition of complete Boolean algebras [PDF]
Denoting by |B| the cardinality of a Boolean algebra B and by S(B) the least cardinal k such that every family of mutually disjoint elements of B has cardinality less than k, we prove that: If B is a complete Boolean algebras, then there is a finite family B1…, Bnof complete Boolean algebra, such that B is isomorphic to the product B1× … × Bnand |Bi|s ...
Argyros, S.
openaire +4 more sources
Homomorphic images of 𝜎-complete Boolean algebras [PDF]
It is a well-known theorem of R. S. Pierce that, for every infinite cardinal α ,
Sabine Koppelberg
openaire +2 more sources
Gődel filters in residuated lattices
In this paper, in the spirit of [4], we study a new type of filters in residuated lattices : Gődel filters. So, we characterize the filters for which the quotient algebra that is constructed via these filters is a Gődel algebra and we establish the ...
Piciu Dana +2 more
doaj +1 more source
Complete Quotient Boolean Algebras [PDF]
For I I a proper, countably complete ideal on the power set
Kanamori, Akihiro, Shelah, Saharon
openaire +3 more sources
Fuzzy Annihilator Ideals of C-Algebra
In this paper, we introduce the concept of relative fuzzy annihilator ideals in C-algebras and investigate some its properties. We characterize relative fuzzy annihilators in terms of fuzzy points.
Wondwosen Zemene Norahun +2 more
doaj +1 more source
Simple complete Boolean algebras [PDF]
For every regular cardinal κ \kappa ...
Jech, Thomas, Shelah, Saharon
openaire +2 more sources
Algebraic theory of measure algebras
A. Horn and A. Tarski initiated the abstract theory of measure algebras. Independently V. Sushchansky, B. Oliynyk and P. Cameron studied the direct limits of Hamming spaces.
O.O. Bezushchak, B.V. Oliynyk
doaj +1 more source
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods [PDF]
It is well-known that some equational theories such as groups or boolean algebras can be defined by fewer equational axioms than the original axioms. However, it is not easy to determine if a given set of axioms is the smallest or not.
Mirai Ikebuchi
doaj +1 more source
Completeness for the coalgebraic cover modality [PDF]
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional
Clemens Kupke +2 more
doaj +1 more source
On countably closed complete Boolean algebras [PDF]
AbstractIt is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
Thomas Jech, Saharon Shelah
openaire +3 more sources

