ConceptEngineering
Boolean algebra
A branch of algebra where the values of the variables are the truth values true and false, denoted 1 and 0, used to design and minimize digital logic circuits.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
17The first 12 are shown.
- Digital Design and Computer Architecture - L3: Sequential Logic
- Sequential Logic II, Labs, Verilog
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Symbolic Execution
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Bi-interpretation of Weak Set Theories
- Digital Design and Computer Architecture - L1: Intro: Fundamentals, Transistors, Gates
- Digital Design and Computer Architecture - L5: HDL, Verilog II, Timing & Verification
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
- Ultrafilters on Omega Versus Forcing
- Deobfuscation of a Real World Binary Obfuscator
- Probabilistic Computation, BPP
Connections
25The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Combinational logic
- Logic gates
- Finite state machine
- Uniting theorem
- Behavioral HDL
- Boolean algebra axioms
Show 1 moreShow fewer
Lectures18
- Digital Design and Computer Architecture - L2: Combinational Logic
- Digital Design and Computer Architecture - L3: Sequential Logic
- Sequential Logic II, Labs, Verilog
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Symbolic Execution
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
Show 12 moreShow fewer
- Bi-interpretation of Weak Set Theories
- Digital Design and Computer Architecture - L1: Intro: Fundamentals, Transistors, Gates
- Digital Design and Computer Architecture - L5: HDL, Verilog II, Timing & Verification
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
- Ultrafilters on Omega Versus Forcing
- Deobfuscation of a Real World Binary Obfuscator
- Probabilistic Computation, BPP
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
- (Re)imagining Mathematics in a World of Reasoning Machines
- The Continuum Hypothesis and Other Set-Theoretic Ideas for Non-Set-Theorists (Part 1)
- Clean Code III: Functions
- Aesthetics, Mathematics, and Philosophy: Is There an Intersection?