Logic and Boolean Algebra
by Kathleen Levitz, Hilbert Levitz · Kathleen Levitz, Hilbert Levitz
A compact study guide covering propositional logic, truth tables, quantifiers and proof, followed by the laws of Boolean algebra and their use with sets and switching circuits. Readers learn to manipulate logical expressions and check arguments for validity.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Boolean Algebra
Wolfram MathWorld
MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading.
plato.stanford.edu
The Stanford Encyclopedia of Philosophy is a peer‑reviewed online encyclopedia of philosophy featuring in‑depth, scholarly articles written and regularly updated by experts, including comprehensive coverage of logic topics.
AllAboutCircuits Boolean Algebra
A chapter from Tony Kuphaldt's open textbook Lessons in Electric Circuits, hosted by All About Circuits. It walks through the rules for simplifying Boolean expressions, with worked examples tied to logic gate circuits, so readers can reduce digital logic designs by hand.
Mathematics for Computer Science (MIT 6.042J)
Discrete mathematics for computer science with an emphasis on definitions and proofs: logic, induction, sets and relations, graph theory, modular arithmetic, asymptotics, counting and discrete probability. 25 lecture videos, problem sets and exams with solutions build fluency in writing proofs.
Boolean Algebra and Its Applications
A short Dover textbook that builds Boolean algebra from sets and propositional logic, then derives its axioms and theorems. Later chapters apply the theory to switching circuits, relay networks and probability, giving readers a rigorous footing for digital logic design.
Discrete Mathematics
Dominik Scheder's proof-based course on sets, functions and relations, enumerative combinatorics, graph theory, and network flows and matchings, each concept paired with a fully proved non-trivial result. Learners read formal statements and write rigorous proofs of their own.