2. Theory

Boolean algebra can be presented by axioms, or by explicit models (parts of a set, binary vectors, Boolean applications) of these axioms. In all cases, we arrive at the same result, since any Boolean algebra is isomorphic to that of the parts of a set.

2.1 Parts of a set

Boolean algebra is the structure of the set $2^{E} = {a : a \subseteq E}$ of parts (subsets) of a set E. The parts a, b ∊ 2 ^E of...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors

+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year

From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Theory

Previous
page Motivations and background

Practice

Bibliography

KNUTH (D.E.) - The Art of Computer Programming - Volume 4, sections 7.1.3 « Bitwise Tricks and Techniques » et 7.1.4 « Binary Decision Diagrams » (2008).