The big idea

Digital computers ultimately succeed or fail at one simple task: deciding whether an electrical signal should be interpreted as a 0 or a 1, and then combining millions of those decisions every second.

Logic refers to Boolean logic—the formal system that defines how true/false values (represented electronically as 1 and 0) can be combined and manipulated using logical operations such as AND, OR, and NOT. Boolean logic provides the mathematical rules that logic gates physically implement in hardware. It is the abstract foundation that determines how inputs map deterministically to outputs in every digital circuit.

Logic gates are the microscopic “decision-makers” that realise this idea in silicon. They implement Boolean logic, allowing hardware to evaluate true/false propositions at electronic speeds and to chain those evaluations together to form everything from adders and multipliers to CPUs and GPUs. Please read and understand the article about transistors to understand this more deeply. 

---

1. Purpose and use of logic gates

Aspect	Explanation
Fundamental abstraction	Each gate embodies a Boolean operator that maps one or more binary inputs to a single binary output.
Hardware realisation	Logic gates are built from small electronic switches called transistors. Each transistor can either let current flow or block current depending on its input. When several transistors are connected together in a particular pattern: If the input values match the rule of the gate (for example, both inputs are 1 for an AND gate), the transistors allow the output wire to be pulled up to the supply voltage (around VDD, representing binary 1). If the inputs do not match the rule, the transistors force the output down to 0 volts (binary 0). VDD stands for Voltage Drain (or Voltage Drain Drain), depending on the naming convention of the semiconductor family. VDD refers to the positive supply voltage that a logic gate uses to represent a binary 1. When the inputs of a gate satisfy its Boolean condition (for example, both inputs are 1 in an AND gate), the internal transistor network conducts, and the output node is electrically pulled up toward VDD. This is why the truth table’s “1” corresponds to a real physical voltage level: the gate connects its output to the positive power rail. So, in this topic: VDD = the voltage level corresponding to logical HIGH (1) VSS/GND = the voltage level corresponding to logical LOW (0) Logic gates operate by connecting or disconnecting their outputs from VDD or GND using transistor arrangements that enforce Boolean rules. VDD is the physical voltage that implements the logical value 1 inside a gate. So the physical behaviour is: Correct input combination → transistors conduct → output rises to VDD (1) Incorrect combination → transistors block → output falls to 0 V (0) The important idea is this: Boolean logic is implemented in hardware by arranging transistors so that the output becomes high or low only when the correct electrical conditions occur.
Composability	Gates are functionally complete—by wiring them together you can synthesise any combinational or sequential circuit, enabling hierarchical design from half-adders up to multi-core processors.
Interfacing	They form the electrical boundary between analog behaviour (continuous voltage swing) and digital abstraction (discrete 0/1), making reliable binary storage and transmission possible.

---

2. Functions and applications inside computer systems

Gate-level function	Typical system-level application
Combinational decision (AND, OR, NOT)	Arithmetic‐logic unit (ALU) bit-slice, address decoding, interrupt prioritisation
Conditioned inversion (NAND, NOR)	Fast, transistor-count-efficient realisation of any Boolean expression; universal building blocks for standard-cell libraries
Equality/inequality (XOR, XNOR)	Parity generation & checking, cryptographic primitives, error-correcting codes, adder carry chains
Clocked storage (built from gates + feedback)	Latches, flip-flops and, by extension, register files and caches

Because every instruction a processor executes decomposes into elementary Boolean expressions, reliable and fast gates are the bedrock of all digital subsystems—control path, datapath, and memory alike.

---

3. Role in binary computing

1. Binary encoding → Voltage above the switching threshold represents 1; below it represents 0.
2. Boolean algebra provides a mathematically complete language for manipulating those symbols.
3. Logic-gate implementation ties the algebra to physics, allowing algebraic optimisation (K-maps, Quine-McCluskey) to translate directly into cheaper, faster, lower-power silicon layouts.
4. Sequential extension (combinational logic + storage) adds the element of time, giving rise to finite-state machines and the von Neumann execution model.

---

4. Canonical Boolean operators table

 

<note: all logic gate symbols taken from here: https://en.wikipedia.org/wiki/Logic_gate></note>

 

Functional completeness: Any Boolean expression can be built exclusively from NAND or exclusively from NOR gates, which is why real IC libraries often favour those two for physical efficiency.

 

Boolean Logic Symbols (not assessed by the IB, but you may encounter these in truth tables)

Operation	Symbol(s) Used	Meaning	Typical Expression Form
AND	⋅ , ∧	Output is 1 only if both inputs are 1	A ⋅ B
OR	+ , ∨	Output is 1 if any input is 1	A + B
NOT	¬ , ̅A (overline)	Flips the input: 1→0, 0→1	¬A
NAND	↑ , ⊼	NOT-AND: output is 0 only when both inputs are 1	A ↑ B
NOR	↓ , ⊽	NOT-OR: output is 1 only when both inputs are 0	A ↓ B
XOR	⊕	Exclusive OR: output is 1 when inputs are different	A ⊕ B
XNOR	⊙ , ⊕̅	Exclusive NOR: output is 1 when inputs are the same	A ⊙ B

---

If you want, I can also produce a matching truth-table set for all seven operations.

 

 

 

 

 

5. Five Examples 

1. “Can I Go Out?” — Parent Permission + Weather Check

Real-world scenario: You only go outside if a parent says yes and the weather is good OR you have an umbrella.
Gate chain:

• OR gate: WeatherGood OR HaveUmbrella
• AND gate: ParentPermission AND (OR output)
  Decision:
  You may go out only if:
  ParentPermission = 1 AND (WeatherGood = 1 OR HaveUmbrella = 1).
  This models combining safety rules with real conditions.

 

2. “Laptop Login” — Password + No Lockout Timer

Real-world scenario: You can log in if your password is correct and you are not currently locked out.
Gate chain:

• NOT gate: invert LockoutActive
• AND gate: PasswordCorrect AND (NOT LockoutActive)
  Decision:
  Even if the password is correct, login fails when the lockout gate outputs 1.
  This mirrors actual OS authentication systems.

 

3. “Group Project Approval” — Majority Vote

Real-world scenario: A group of three students decides to approve an idea only if at least two members agree.
Gate chain:

• AND gates: (A AND B), (A AND C), (B AND C)
• OR gate: combine the three outputs
  Decision:
  Approval = 1 if two or more group members vote yes.
  This reflects reality: a democratic team-based decision.

 

4. “Bike Rental Lock” — Code + Card + No Damage Alert

Real-world scenario: A rented bike will unlock only when:

• You enter the correct PIN code, and
• Your student card is valid, and
• The bike is not flagged as damaged.
  Gate chain:
• NOT gate: invert DamageAlert
• AND gates: PinCorrect AND CardValid AND (NOT DamageAlert)
  Decision:
  The lock releases only when all three conditions are met.
  This models chained authentication conditions in physical systems.

 

5. “Classroom Attendance Scanner” — Two Inputs Must Match

Real-world scenario: A digital attendance system checks:

• Student number from card swipe, and
• Student number typed on keypad
  The system marks you present only if the two inputs match exactly.
  Gate chain:
• XNOR gate for each bit pair: XNOR(bit_swipe, bit_keypad)
• AND gate across all XNOR outputs
  Decision:
  Attendance = 1 only when all bits match.
  This mirrors how equality comparators work inside processors.

 

Take-aways

• Logic gates translate Boolean algebra into fast, deterministic hardware operations.
• Their universality allows any digital function—memory, arithmetic, control—to be reduced to combinations of just a handful of gate types.
• Mastery involves not only knowing each gate’s truth table but also being able to describe how and why those gates are deployed within real computer architectures.

Keep this hierarchy in mind: voltage → bit → Boolean algebra → logic gate → circuit → architecture → programs. Every digital system you will study builds upward from the humble gate.