Boolean Algebras and Circuits
W. D. Wallis
Abstract
W. D. Wallis
Abstract
Observe the similarities between the algebra of sets and the algebra of propositions: the universal set plays the same role as T , the empty set Ø corresponds to F , ⋃ is like ⋁ and ⋂ is like ⋀. This similarity is exploited by defining an object, called a Boolean algebra , such that the algebra of all subsets of a fixed set is a Boolean algebra, and a well-defined set of propositions also forms a Boolean algebra.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Observe the similarities between the algebra of sets and the algebra of propositions: the universal set plays the same role as T , the empty set Ø corresponds to F , ⋃ is like ⋁ and ⋂ is like ⋀. This similarity is exploited by defining an object, called a Boolean algebra , such that the algebra of all subsets of a fixed set is a Boolean algebra, and a well-defined set of propositions also forms a Boolean algebra.
Key concepts: Free Boolean algebra, Two-element Boolean algebra, Complete Boolean algebra, Stone's representation theorem for Boolean algebras, Boolean algebra, Boolean algebras canonically defined, Set (abstract data type), Mathematics