A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Propositional Connectives

College Depth 70 in the knowledge graph ☐ I know this ☆ Set as goal
983topics build on this
321prerequisites beneath it
See this on the map →
Propositional Logic SyntaxAnd/Or in Everyday Life+2 more→→Propositional Semantics and ValuationsTautologies, Contradictions, and Satisfiability+3 more
connectives negation conjunction disjunction implication biconditional truth-functional

Core Idea

The five standard propositional connectives — NOT (¬), AND (∧), OR (∨), IMPLIES (→), and IFF (↔) — are defined purely by their truth-functional behavior: the truth value of any compound formula is entirely determined by the truth values of its components. Each connective has a fixed truth table that serves as its semantic definition. Precedence conventions (¬ binds tightest, then ∧, then ∨, then →, then ↔) reduce the need for parentheses, but understanding this hierarchy is essential for correct parsing.

How It's Best Learned

Build the truth table for each connective from scratch, then combine them to evaluate compound formulas step by step. Pay special attention to material implication (→), whose truth table surprises most beginners: a false antecedent makes the conditional true regardless of the consequent.

Common Misconceptions

Explainer

From studying propositional syntax you know that formulas are built from atomic variables and connectives. Now we give those connectives their meanings — and the key idea is that meaning is purely truth-functional: the truth value of any compound formula is entirely determined by the truth values of its component formulas. There is no meaning "behind" the symbols, no causation, no time, no reference to content. Each connective is fully specified by a truth table.

Negation (¬P) flips truth to false and false to true — the simplest connective. Conjunction (P ∧ Q) is true only when both P and Q are true; it corresponds to "both." Disjunction (P ∨ Q) is true when at least one of P or Q is true — the inclusive "or." The logical OR differs from everyday English "or," which often carries an exclusive sense ("soup or salad" typically means one or the other, not both). The logical ∨ is satisfied by both P and Q being simultaneously true; keep this in mind when translating natural-language claims.

Material implication (P → Q) is the most counterintuitive connective. It is false only when P is true and Q is false — the one combination where a true premise yields a false conclusion. In all other cases, P → Q is true: when P is false (regardless of Q) and when Q is true (regardless of P). This feels wrong because natural language "if…then…" carries causal or temporal connotations. But material implication strips all of that away and says only: "it is not the case that P is true while Q is false." The statement "if the moon is made of cheese, then 2+2=5" is materially true, because the antecedent is false. This is the price of being purely truth-functional: the connective cannot track causation, only truth-value combinations. Learning to use P → Q correctly is the essential skill of this topic.

Biconditional (P ↔ Q) is true exactly when P and Q have the same truth value — both true or both false. It means "P if and only if Q." When writing logical equivalences, ↔ is the formal expression of "these formulas always agree." The precedence hierarchy — ¬ binds tightest, then ∧, then ∨, then →, then ↔ — is a notational convention that reduces parentheses. So P ∨ Q ∧ R is parsed as P ∨ (Q ∧ R) because ∧ binds before ∨. When in doubt, add parentheses; the grammar is more important than avoiding them.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Propositional Connectives

Longest path: 71 steps · 321 total prerequisite topics

Prerequisites (4)

Leads To (5)