Propositional Logic Symbols

Why This Matters

Propositional logic symbols are the alphabet of formal reasoning. Without fluency in these symbols, you can't read, write, or evaluate logical arguments. In Formal Logic II, you're expected to translate natural language into symbolic form, construct truth tables, and identify valid argument structures. Every proof technique you'll encounter, from direct proof to reductio ad absurdum, depends on your command of these fundamental connectives.

Don't just memorize what each symbol looks like. You need to understand how each connective transforms truth values, when statements using them are true or false, and how they relate to one another through logical equivalences. The difference between acing an exam and struggling through it often comes down to whether you can instantly recognize that $p \rightarrow q$ is logically equivalent to $\neg p \lor q$, or spot that $p \leftrightarrow q$ is really just $(p \rightarrow q) \land (q \rightarrow p)$ in disguise.

---

Building Blocks: Atomic Propositions and Constants

Before you can combine statements, you need the raw materials. These are the irreducible elements of propositional logic, the atoms from which all compound statements are built.

Atomic Propositions (p, q, r)

Atomic propositions are the simplest declarative statements in propositional logic. They can't be broken down into smaller logical components. Each one has exactly one truth value: either true or false, never both, never neither. Think of them as variables in a formula. They let you analyze argument structure without worrying about specific content.

For example, $p$ might stand for "It is raining" and $q$ for "The ground is wet." The logic doesn't care what the sentences say; it only tracks how truth values flow through the connectives.

Tautology (⊤)

A tautology is a proposition that is always true, no matter what truth values you assign to its components. The classic example is $p \lor \neg p$ ("either p or not p"). Every row of its truth table comes out true.

In proofs, tautologies represent logical validity itself. Any premise set trivially entails ⊤, and recognizing tautological forms helps you simplify expressions quickly.

Contradiction (⊥)

A contradiction is a proposition that is always false. No assignment of truth values can make it true. The standard example is $p \land \neg p$ ("p and not p").

Contradictions are central to proof by contradiction (reductio ad absurdum): if assuming some statement lets you derive ⊥, that assumption must be false.

---

Unary Operator: Negation

This is your only single-input connective. It operates on one proposition and flips its truth value.

Negation (¬)

Negation reverses the truth value of any proposition. If $p$ is true, $\neg p$ is false, and vice versa. Read $\neg p$ as "it is not the case that p."

Negation is the foundation for De Morgan's Laws, which you'll use constantly:

• $\neg(p \land q) \equiv \neg p \lor \neg q$
• $\neg(p \lor q) \equiv \neg p \land \neg q$

These equivalences let you push negation inside parentheses by flipping the connective between ∧ and ∨. Getting comfortable with this move is essential for natural deduction and simplification.

---

Binary Connectives: Combining Propositions

These operators take two propositions and produce a new compound statement. Each has a distinct truth-functional definition that determines exactly when the compound is true or false.

Conjunction (∧)

Conjunction is true only when both conjuncts are true. This makes it the strictest binary connective. $p \land q$ means "p and q," and both conditions must hold simultaneously.

Use conjunction when modeling requirements or necessary conditions. If a problem says "you must have a ticket and valid ID," that's $p \land q$.

Disjunction (∨)

Disjunction is true when at least one disjunct is true. This is inclusive or, meaning the compound is also true when both disjuncts are true. $p \lor q$ is only false when both $p$ and $q$ are false.

Disjunction appears in proof by cases (disjunction elimination): if you know $p \lor q$, and you can prove some conclusion $r$ from $p$ alone and also from $q$ alone, then $r$ follows.

Exclusive OR (⊕)

Exclusive OR is true when exactly one proposition is true, and false when both are true or both are false. $p \oplus q$ means "p or q, but not both."

You can express XOR using basic connectives: $p \oplus q \equiv (p \lor q) \land \neg(p \land q)$. This decomposition is useful for translation problems.

---

Conditional Connectives: Implication and Equivalence

These connectives express logical relationships between propositions. They're the backbone of argument structure and logical inference.

Conditional (→)

The conditional is false only when the antecedent is true and the consequent is false. In every other case, it's true. $p \rightarrow q$ reads as "if p, then q," or equivalently "p implies q" or "p only if q."

The tricky part: when $p$ is false, $p \rightarrow q$ is true regardless of $q$. This is called vacuous truth, and it trips people up. The conditional doesn't claim any causal connection; it only says "you won't find $p$ true with $q$ false."

The equivalence $p \rightarrow q \equiv \neg p \lor q$ is heavily tested. Know it cold. It's also the basis for the contrapositive: $p \rightarrow q \equiv \neg q \rightarrow \neg p$.

Biconditional (↔)

The biconditional is true when both propositions share the same truth value, either both true or both false. $p \leftrightarrow q$ means "p if and only if q" (often abbreviated "p iff q").

It's equivalent to $(p \rightarrow q) \land (q \rightarrow p)$. This tells you something important: to prove a biconditional, you must prove both directions of implication.

---

Structural Notation: Grouping and Precedence

Without clear structure, complex formulas become ambiguous. Parentheses impose order and eliminate interpretive confusion.

Parentheses ( )

Parentheses group propositions to specify which connectives apply first. They override the default precedence rules.

The standard operator precedence (from highest to lowest binding strength) is:

1. $\neg$ (negation)
2. $\land$ (conjunction)
3. $\lor$ (disjunction)
4. $\rightarrow$ (conditional)
5. $\leftrightarrow$ (biconditional)

But relying on precedence alone is risky. Consider: "p and q or r" could mean $(p \land q) \lor r$ or $p \land (q \lor r)$, and these have different truth tables.

---

Quick Reference Table

---

Self-Check Questions

1. Which two symbols represent propositions with fixed truth values regardless of their components, and how do their truth values differ?

2. Compare the truth conditions for ∨ and ⊕. In what specific case do they produce different truth values?

3. If $p \rightarrow q$ is true and $p$ is false, what can you conclude about $q$? Why does this sometimes seem counterintuitive?

4. How would you express $p \leftrightarrow q$ using only →, ∧, and the propositions p and q? What does this tell you about the relationship between conditionals and biconditionals?

5. Given the formula $\neg p \land q \lor r$, write two different parenthesized versions that would produce different truth values when $p$ is true, $q$ is false, and $r$ is true.