Results 101 to 110 of about 5,885 (231)
Notes on Majority Boolean Algebra [PDF]
A Majority-Inverter Graph (MIG) is a homogeneous logic network, where each node represents the majority function. Recently, a logic optimization package based on the MIG data-structure, with 3-input majority node (M3) has been proposed [2], [30].
De Micheli, Giovanni +9 more
core +1 more source
Archimedean Atomic Lattice Effect Algebras with Complete Lattice of Sharp Elements
We study Archimedean atomic lattice effect algebras whose set of sharp elements is a complete lattice. We show properties of centers, compatibility centers and central atoms of such lattice effect algebras.
Zdenka Riecanová
doaj +1 more source
from Boolean algebra to unified algebra
Boolean algebra is simpler than number algebra, with applications in programming, circuit design, law, specifications, mathematical proof, and reasoning in any domain.
Eric C. R. Hehner
core
We define Boolean algebras in the linear context and study its symmetric powers. We give explicit formulae for products in symmetric Boolean algebras of various dimensions. We formulate symmetric forms of the inclusion-exclusion principle.
Díaz, Rafael, Rivas, Mariolys
openaire +3 more sources
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras [PDF]
© 2016 Springer Science+Business Media New YorkIt is proved that for every computable ordinal α, the Turing degree 0(α) is a degree of autostability of some computable Boolean algebra and is also a degree of autostability relative to strong ...
Bazhenov N.
core
Pan-Boolean Algebra for PID Control Method
In this paper, pan-Boolean algebra for PID control concepts, methods and principles is proposed based on theory of Pan-Boolean algebra, Take the deviation of the control system, of the deviation, integral of the deviation as a pan-Boolean algebra PID ...
Jin Chen +4 more
core +1 more source
Judgment aggregators and Boolean algebra homomorphisms [PDF]
The theory of Boolean algebras can be fruitfully applied to judgment aggregation: assuming universality, systematicity and a sufficiently rich agenda, there is a correspondence between (i) non-trivial deductively closed judgment aggregators and (ii ...
Herzberg, Frederik
core +1 more source
Boolean matrices ... neither Boolean nor matrices
Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra.
RICCI, Gabriele
core +1 more source
Judgement aggregators and boolean algebra homomorphism [PDF]
The theory of Boolean algebras can be fruitfully applied to judgment aggregation: Assuming universality, systematicity and a sufficiently rich agenda, there is a correspondence between (i) non-trivial deductively closed judgment aggregators and (ii ...
Herzberg, Frederik
core
Judgment aggregators and Boolean algebra homomorphisms
Herzberg F. Judgment aggregators and Boolean algebra homomorphisms. JOURNAL OF MATHEMATICAL ECONOMICS. 2010;46(1):132-140.The theory of Boolean algebras can be fruitfully applied to judgment aggregation: assuming universality, systematicity and a ...
Herzberg, Frederik ; https://orcid.org/ +1 more
core +1 more source

