10 Boolean Algebra
In this chapter, you’ll learn how to create truth tables using Python and how to simplify logical functions by using the SymPy module.
When George Boole formulated the algebra named after him in 1854, no one yet thought of the importance this subfield called discrete mathematics and how it would impact the entire evolution of technology. Boolean algebra forms the theoretical foundation of all modern automation and computer systems. In Boolean algebra, variables have only two states: 0 (false) and 1 (true). Only three logical operations are applicable to these variables: the logical AND operation (conjunction), the logical OR operation (disjunction), and the negation.
The representation of functions y = 𝑓(x) known from analysis ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access