Results 21 to 30 of about 2,011 (184)
Notre Dame Journal of Formal Logic, 2011 We prove a Theorem about the relationship between the Depth of the ultraproduct of Boolean algebras, divided by an ultrafilter, and the products of the depths of each component. This answers (partly) an open problem of Monk.
Shimon Garti, Saharon Shelah
openaire +3 more sources
Interpolative Boolean algebra based multicriteria routing algorithm [PDF]
Yugoslav Journal of Operations Research, 2015 In order to improve the quality-of-service of distributed applications, we propose a multi-criteria algorithm based on interpolative Boolean algebra for routing in an overlay network.
Jeremić Marina +2 more
doaj +1 more source
On (⊙, ∨)-derivation for BL-algebras [PDF]
Journal of Hyperstructures, 2013 In this paper, we define the concept of (⊙, ∨)-derivations for BL-algebras and discuss some related results. We study this derivation on boolean center B(A) of a BL-algebra A.
L. Torkzadeh, L. Abbasian
doaj +1 more source
On Boolean reliability algebra
CoRR, 2023 In this paper we consider systems which consist of binary components with known reliabilities. We discuss their algebraic properties and define the corresponding algebraic structure, which we call the reliability algebra. We prove that the reliability algebra is a Boolean algebra.
Branislav R. Boricic +2 more
openaire +2 more sources
Some Types of Filters in Equality Algebras [PDF]
Categories and General Algebraic Structures with Applications, 2017 Equality algebras were introduced by S. Jenei as a possible algebraic semantic for fuzzy type theory. In this paper, we introduce some types of filters such as (positive) implicative, fantastic, Boolean, and prime filters in equality algebras and we ...
Rajabali Borzooei +2 more
doaj
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.
Janusz Brzozowski, Baiyu Li, Yuli Ye
doaj +1 more source
Playful Boolean algebras [PDF]
Transactions of the American Mathematical Society, 1986 We show that for an atomless complete Boolean algebra B \mathcal {B} of density ≤ 2 ℵ 0 \leq {2^{{\aleph _0}}} , the Banach-Mazur, the split ...
openaire +2 more sources
Information and logical transformations in Schaeffer and Pierce Bases in Maple [PDF]
ITM Web of ConferencesOne of the tasks of synthesis and analysis of the functioning of combinational devices is the representation of a Boolean function in various bases. The absolute completeness of the use and implementation of various transformations of Boolean functions ...
Olenev Aleksandr +3 more
doaj +1 more source
Gelfand theorem implies Stone representation theorem of Boolean rings
International Journal of Mathematics and Mathematical Sciences, 1995 Stone Theorem about representing a Boolean algebra in terms of open-closed subsets of a topological space is a consequence of the Gelfand Theorem about representing a B∗- algebra as the algebra of continuous functions on a compact Hausdorff space.
Parfeny P. Saworotnow
doaj +1 more source
L-Fuzzy Prime Spectrums of ADLs
Advances in Fuzzy Systems, 2021 The notion of an Almost Distributive Lattice (ADL) is a common abstraction of several lattice theoretic and ring theoretic generalizations of Boolean algebra and Boolean rings.
Natnael Teshale Amare +2 more
doaj +1 more source