Results 151 to 160 of about 296,040 (177)
Some of the next articles are maybe not open access.

Hierarchies of Boolean algebras

Journal of Symbolic Logic, 1970
A denumerable structure is said to be recursive iff its universe is a recursive subset of the natural numbers and its relations and operations are recursive. For example, the standard model of number theory is recursive. A structure is said to be recursively presentable iff it is isomorphic to a recursive structure.
openaire   +1 more source

Parallel Processing in Boolean Algebra

IEEE Transactions on Computers, 1972
A processor called Boolean analyzer has been presented at the 1968 IFIP Congress to introduce parallel processing of Boolean expressions [1]. The present paper shows how to increase its speed many times by making its processing more parallel. The applications of the Boolean analyzer are limited to few but important problems.
openaire   +3 more sources

Closure Algebras and Boolean Algebras

Mathematical Logic Quarterly, 1977
openaire   +2 more sources

A Characterization of Boolean Algebras

The Annals of Mathematics, 1939
Birkhoff, Garrett, Ward, Morgan
openaire   +2 more sources

Disturbance decoupling control design for Boolean control networks: a Boolean algebra approach

IET Control Theory and Applications, 2020
Carmen del Vecchio   +2 more
exaly  

On the Sequence of Consecutive Powers of a Matrix in a Boolean Algebra

SIAM Journal on Matrix Analysis and Applications, 1999
Bart de Schutter
exaly  

A software tool for uncertainty modeling using Interpolative Boolean algebra

Knowledge-Based Systems, 2014
Bratislav Petrović, Pavle Milosevic
exaly  

Home - About - Disclaimer - Privacy