Results 81 to 90 of about 1,294 (213)

A method for bi-decomposition of partial Boolean functions

open access: yesInformatika, 2019
The problem of bi-decomposition of a Boolean function is to represent a given Boolean function in the form of a given logic algebra operation over two Boolean functions and so is reduced to specification of these functions.
Yu. V. Pottosin
doaj  

THE INTERNAL IDEAL LATTICE IN THE TOPOS OF M-SETS [PDF]

open access: yesJournal of Sciences, Islamic Republic of Iran, 1994
We believe that the study of the notions of universal algebra modelled in an arbitarry topos rather than in the category of sets provides a deeper understanding of the real features of the algebraic notions.
doaj  

Conditional Probability on $\Sigma$-Complete Boolean Algebras

open access: yesThe Annals of Mathematical Statistics, 1969
Probability as measure on a Boolean algebra was presented by Kappos [5], but a treatment of conditional probability relative to a subalgebra is missing. The Stone space of a $\sigma$-complete Boolean algebra (see [10], p. 24) enables one to apply the concepts of conditional probability for a $\sigma$-algebra of subsets of some space (see [2], pp. 15-28)
openaire   +2 more sources

Using Whales to Complete a Boolean Algebra

open access: yesMissouri Journal of Mathematical Sciences, 2002
Let \(B\) be a Boolean algebra and \(A\) be a subset of \(B\). Then \(A\) is called a whale of \(B\) if (1) \(a\in A,\) \(b\in B\) and \(b \leq a\) imply \(b\in A\); (2) sup\(\{a \mid a\in A\}=1\). The author uses the whales of \(B\) to construct the completion of \(B\).
openaire   +3 more sources

Home - About - Disclaimer - Privacy