Results 1 to 10 of about 1,992 (165)
A Boolean algebra for genetic variants. [PDF]
AbstractMotivationBeyond identifying genetic variants, we introduce a set of Boolean relations, which allows for a comprehensive classification of the relations of every pair of variants by taking all minimal alignments into account. We present an efficient algorithm to compute these relations, including a novel way of efficiently computing all minimal
Vis JK +3 more
europepmc +7 more sources
A generically embedded Boolean algebra is studied. Several results about infinite complete Boolean algebras are shown to be independent of ZF.
exaly +2 more sources
Lattices of (Generalized) Fuzzy Ideals in Double Boolean Algebras [PDF]
This paper develops the notion of fuzzy ideal and generalized fuzzy ideal on double Boolean algebra (dBa). According to Rudolf Wille, a double Boolean algebra $\underline{D}:=(D, \sqcap, \sqcup, \neg, \lrcorner, \bot, \top)$ is an algebra
Fernand Kuiebove Pefireko
doaj +1 more source
Overlap Algebras: a Constructive Look at Complete Boolean Algebras [PDF]
The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set.
Francesco Ciraulo, Michele Contente
doaj +1 more source
Using Vaggione's concept of central element in a double pointed algebra, weintroduce the notion of Boolean like variety as a generalisation ofBoolean algebras to an arbitrary similarity type. Appropriately relaxing therequirement that every element be central in any member of the variety, weobtain the more general class of semi-Boolean like varieties ...
Salibra, A +3 more
openaire +6 more sources
A Category of Ordered Algebras Equivalent to the Category of Multialgebras
It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (\(\textit{CABA}\)s) taking a set to its power-set and, conversely, a complete, atomic Boolean algebra to its set of atomic elements.
Marcelo Esteban Coniglio +1 more
doaj +1 more source
Digital Circuit Design Utilizing Equation Solving over ‘Big’ Boolean Algebras [PDF]
A task frequently encountered in digital circuit design is the solution of a two-valued Boolean equation of the form h(X,Y,Z)=1, where h: B_2^(k+m+n)→ B_2 and X,Y, and Z are binary vectors of lengths k, m, and n, representing inputs, intermediary values,
Ali Muhammad Ali Rushdi, Waleed Ahmad
doaj +1 more source
Fuzzy n-fold obstinate ideals in mv -algebras [PDF]
. In this paper, we introduce the notion of n-fold Boolean ideals of an MV -algebra and consider the quotient algebras induced by n-fold Boolean ideals. Also we prove that I is a n-fold Boolean ideal of an MV -algebra if and only if A/I is a n+1-bounded ...
Fereshteh Forouzesh
doaj +1 more source
The three types of normal sequential effect algebras [PDF]
A sequential effect algebra (SEA) is an effect algebra equipped with a $\textit{sequential product}$ operation modeled after the Lüders product $(a,b)\mapsto \sqrt{a}b\sqrt{a}$ on C$^*$-algebras.
Abraham Westerbaan +2 more
doaj +1 more source
Boolean Algebras in Visser Algebras [PDF]
We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser ...
Majid Alizadeh +2 more
openaire +2 more sources

