نتایج جستجو برای: boolean algebra
تعداد نتایج: 89146 فیلتر نتایج به سال:
We introduce the notion of Boolean measure algebra. It can be described shortly using some standard notations and terminology. If B is any Boolean algebra, let B N denote the algebra of sequences (xn); xn 2 B: Let us write p k 2 B N the sequence such that p k (i) = 1 if i k and p k (i) = 0 if k < i: If x 2 B, denote by x 2 B N the constant sequence x = (x; x; x; : : :): We deene a Boolean measu...
This paper includes two main ideas. The first one, rewriting in an algebra, was introduced in [5]. The second one, boolean rewriting, can be found in many papers but we were never able to find a clear comparison with the classic one. We prefer rewriting in an algebra to term rewriting. This is our way to give a unique theory of rewriting. If the algebra is free, then we get the term rewriting. ...
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. ...
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A Cohen algebra is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of Cohen algebras: semi-Cohen algebras, pseudo-Cohen algebras and potentially Cohen algebras. These classes of Boolean algebras are closed under completion.
Boolean algebra is simpler than number algebra, with applications in programming, circuit design, law, specifications, mathematical proof, and reasoning in any domain. So why is number algebra taught in primary school and used routinely by scientists, engineers, economists, and the general public, while boolean algebra is not taught until university, and not routinely used by anyone? A large pa...
It is proved that the following conditions are equivalent: (a) there exists a complete, atomless, σ–centered Boolean algebra, which does not contain any regular, atomless, countable subalgebra, (b) there exists a nowhere dense ultrafilter on ω. Therefore the existence of such algebras is undecidable in ZFC. In ”forcing language” condition (a) says that there exists a non– trivial σ–centered for...
In this paper, we introduce the notion of fuzzy obstinate ideals in MV -algebras. Some properties of fuzzy obstinateideals are given. Not only we give some characterizations of fuzzy obstinate ideals, but also bring the extension theorem of fuzzy obstinate ideal of an MV -algebra A. We investigate the relationships between fuzzy obstinate ideals and the other fuzzy ideals of an MV -algebra. We ...
A <r-complete Boolean algebra is a Boolean algebra in which for every sequence of elements a$-, i = l, • • • , there is an element U?an, the countable union of the a», such that aiQU?an for every i, and such that if diQx for every i then U?anQx. The dual operation, countable intersection, can be introduced through complementation, and the distributive law afMJi*'a» = Uf {aC\an) and its dual can...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید