Truth Table Symbols

---

Why This Matters

Truth table symbols are the alphabet of formal logic. Without fluency in these symbols, you can't read, write, or evaluate logical arguments. You're being tested not just on recognizing what each symbol means, but on understanding how they transform truth values and when specific combinations yield true or false results. The five connectives you'll learn here (conjunction, disjunction, negation, conditional, and biconditional) show up in every proof, every argument analysis, and every validity question you'll encounter.

Don't just memorize the symbols. Know the truth conditions for each connective and understand why certain combinations produce the results they do. When you see $p \rightarrow q$, you should immediately think about what makes it false, not just what it "means" in English.

---

Truth Values: The Building Blocks

Before you can evaluate any compound statement, you need the two fundamental truth values that every proposition must take. In classical logic, every statement is either true or false. Never both, never neither.

True (T)

• Indicates a proposition is correct or satisfied. This is the baseline "yes" value in any logical evaluation.
• Represented as T, 1, or ⊤ depending on notation style. All mean the same thing in truth tables.
• Combines with connectives to determine the output of compound statements.

False (F)

• Indicates a proposition is incorrect or unsatisfied. This is the baseline "no" value.
• Represented as F, 0, or ⊥ depending on your textbook's notation conventions.
• Critical for identifying invalidity. Arguments fail when premises are true but the conclusion is false.

---

Unary Connective: Negation

Negation is the only connective that operates on a single proposition. It flips the truth value, nothing more.

Negation (¬)

• Inverts the truth value of any proposition. If $A$ is true, $\neg A$ is false. If $A$ is false, $\neg A$ is true.
• Also written as ~, !, or NOT depending on notation. The tilde (~) is common in many intro logic textbooks.
• Double negation cancels out. $\neg \neg A$ is logically equivalent to $A$. This equivalence comes up frequently in simplification.

---

Conjunctive Connectives: Requiring Agreement

These connectives yield true only when their component propositions align in specific ways. Conjunction demands both be true; biconditional demands both match.

Conjunction (∧)

• True only when both propositions are true. This is the strictest binary connective, yielding T in just 1 of 4 rows.
• Represents logical "AND." Think of it as a checklist where every item must be satisfied.
• Symbol variations include & and •, but ∧ (wedge pointing up) is standard in formal logic.

Biconditional (↔)

• True when both propositions share the same truth value. Both T or both F yields T; mixed values yield F.
• Represents "if and only if" (abbreviated iff). This establishes that two statements are logically equivalent.
• Equivalent to $(A \rightarrow B) \land (B \rightarrow A)$. Understanding this breakdown helps you verify biconditional truth tables by thinking of it as "the conditional running in both directions."

---

Disjunctive Connective: Requiring At Least One

Disjunction is the most permissive binary connective. It only fails when everything fails.

Disjunction (∨)

• True when at least one proposition is true. False only when both are false, making it the "easiest" connective to satisfy.
• Represents inclusive "OR." Both propositions can be true simultaneously (unlike exclusive or, which you may encounter later).
• The symbol points down (∨). A classic mnemonic: "∨" stands for "vel," the Latin word for "or."

---

Conditional Connective: The Tricky One

The conditional causes more confusion than any other connective because its truth conditions don't match everyday "if-then" intuitions. Focus on the one case that makes it false.

Conditional (→)

• False only when the antecedent is true and the consequent is false. This is the single F row; all other combinations yield T.
• Represents "if...then" or implication. $A \rightarrow B$ means "A implies B" or "A is sufficient for B."
• Vacuously true when the antecedent is false. If $A$ is false, $A \rightarrow B$ is automatically true regardless of $B$. This is the part that trips people up. It feels wrong, but the logic is: a conditional only makes a promise about what happens when the antecedent holds. If the antecedent doesn't hold, the promise isn't broken.

---

Quick Reference Table

---

Self-Check Questions

1. Which two connectives yield true when both propositions are true AND when both are false? How do they differ in the mixed cases?

2. You're building a truth table for $\neg(p \lor q)$. How many rows do you need, and in which row(s) will the final column show T?

3. Compare the conditional (→) and biconditional (↔): if $p$ is false and $q$ is true, what truth value does each connective produce? Why?

4. A classmate claims that $p \rightarrow q$ and $q \rightarrow p$ are logically equivalent. Using truth table reasoning, explain why this is incorrect and identify what these two statements actually represent.

5. Which connective is the only unary operator, and how does this affect the structure of its truth table compared to binary connectives?