Truth Tables

Computational Thinking
principle

Also known as: truth table

Grade 9-12

View on concept map

A table listing every combination of boolean inputs and the resulting output for a logical expression. Truth tables are the foundation of digital logic, circuit design, and formal reasoning about program correctness.

Definition

A table listing every combination of boolean inputs and the resulting output for a logical expression.

💡 Intuition

Map out every possible True/False scenario to be sure you understand what a logical expression does.

🎯 Core Idea

Truth tables exhaustively verify logical expressions and can reveal equivalences between different expressions.

Example

AND table: T,T→T; T,F→F; F,T→F; F,F→F. Exactly one row gives True.

Formula

2^n rows for n boolean variables

Notation

\top (true) and \bot (false) are the two truth values. Common operators: \wedge (AND), \vee (OR), \neg (NOT), \to (implies), \leftrightarrow (iff).

🌟 Why It Matters

Truth tables are the foundation of digital logic, circuit design, and formal reasoning about program correctness. They are used by hardware engineers to design processors, by software engineers to verify complex conditions, and by students to learn how boolean logic works.

💭 Hint When Stuck

To build a truth table, list all input variables as columns, then add a column for the output expression. Fill in all possible True/False combinations for the inputs (2^n rows for n variables), then evaluate the expression for each row. Compare columns to check for logical equivalences.

Formal View

A truth table for a boolean function f: \{T,F\}^n \to \{T,F\} enumerates all 2^n input combinations and the corresponding output. Two expressions are logically equivalent iff their truth tables have identical output columns.

🚧 Common Stuck Point

With n variables there are 2ⁿ rows — 3 variables means 8 rows, 4 means 16.

⚠️ Common Mistakes

  • Forgetting to include all 2^n rows, missing some input combinations
  • Evaluating compound expressions without respecting operator precedence (NOT before AND before OR)
  • Assuming two expressions are equivalent after checking only a few rows instead of all possible combinations

Frequently Asked Questions

What is Truth Tables in CS Thinking?

A table listing every combination of boolean inputs and the resulting output for a logical expression.

What is the Truth Tables formula?

2^n rows for n boolean variables

When do you use Truth Tables?

To build a truth table, list all input variables as columns, then add a column for the output expression. Fill in all possible True/False combinations for the inputs (2^n rows for n variables), then evaluate the expression for each row. Compare columns to check for logical equivalences.

How Truth Tables Connects to Other Ideas

To understand truth tables, you should first be comfortable with boolean logic and logical operators.

← Back to Explorer