Logic & ProofsTopic #1 of 40

Propositional Logic

Propositions, logical connectives (AND, OR, NOT, XOR), truth tables, and compound statements.

Propositions

A proposition is a declarative statement that is either true (T) or false (F), but not both.

Examples

  • "2 + 2 = 4" is a proposition (true)
  • "The sky is green" is a proposition (false)
  • "What time is it?" is NOT a proposition (question)
  • "x+1=2x + 1 = 2" is NOT a proposition (depends on xx)

Logical Connectives

SymbolNameMeaning
¬\negNegationNOT
∧\landConjunctionAND
∨\lorDisjunctionOR
⊕\oplusExclusive ORXOR
→\rightarrowImplicationIF...THEN
↔\leftrightarrowBiconditionalIF AND ONLY IF

Truth Tables

Negation (¬p\neg p)

pp¬p\neg p
TF
FT

Conjunction (p∧qp \land q)

ppqqp∧qp \land q
TTT
TFF
FTF
FFF

Disjunction (p∨qp \lor q)

ppqqp∨qp \lor q
TTT
TFT
FTT
FFF

Exclusive OR (p⊕qp \oplus q)

ppqqp⊕qp \oplus q
TTF
TFT
FTT
FFF

Implication (p→qp \rightarrow q)

ppqqp→qp \rightarrow q
TTT
TFF
FTT
FFT

Note: An implication is false only when the hypothesis is true and the conclusion is false.

Biconditional (p↔qp \leftrightarrow q)

ppqqp↔qp \leftrightarrow q
TTT
TFF
FTF
FFT

Operator Precedence

From highest to lowest:

  1. ¬\neg (negation)
  2. ∧\land (conjunction)
  3. ∨\lor (disjunction)
  4. →\rightarrow (implication)
  5. ↔\leftrightarrow (biconditional)

Compound Propositions

Example

Let pp: "It is raining" and qq: "I carry an umbrella"

  • p∧qp \land q: "It is raining AND I carry an umbrella"
  • p→qp \rightarrow q: "IF it is raining, THEN I carry an umbrella"
  • ¬p∨q\neg p \lor q: "It is NOT raining OR I carry an umbrella"

Tautology, Contradiction, Contingency

  • Tautology: Always true (e.g., p∨¬pp \lor \neg p)
  • Contradiction: Always false (e.g., p∧¬pp \land \neg p)
  • Contingency: Sometimes true, sometimes false

Logical Equivalence

Two propositions are logically equivalent (≡\equiv) if they have the same truth values:

p≡q means (p↔q) is a tautologyp \equiv q \text{ means } (p \leftrightarrow q) \text{ is a tautology}

Key Equivalences

p→q≡¬p∨qp \rightarrow q \equiv \neg p \lor q

p↔q≡(p→q)∧(q→p)p \leftrightarrow q \equiv (p \rightarrow q) \land (q \rightarrow p)

Converse, Inverse, Contrapositive

For the implication p→qp \rightarrow q:

FormStatementEquivalent to Original?
Originalp→qp \rightarrow q—
Converseq→pq \rightarrow pNo
Inverse¬p→¬q\neg p \rightarrow \neg qNo
Contrapositive¬q→¬p\neg q \rightarrow \neg pYes

p→q≡¬q→¬pp \rightarrow q \equiv \neg q \rightarrow \neg p