Foundations of Logic

TL;DR

Foundations of Logic is about understanding how to build valid arguments and prove statements using precise rules. You'll learn to translate everyday language into symbolic logic to analyze its structure. This helps you determine if an argument is sound and if a statement is true under given conditions.

1. The Mental Model

Think of logic as the blueprint for reasoning. It gives you tools to break down complex statements and arguments into their basic components, like Lego bricks, and then apply rules to see if they fit together correctly and make a stable structure.

2. The Core Material

Foundations of Logic introduces you to the basic building blocks and rules that let you formally analyze arguments and statements.

2.1 Propositions and Connectives

Photo by Aleks Magnusson on Pexels

A proposition is a declarative sentence that is either true or false, but not both. For example, "The sky is blue" is a proposition, but "What time is it?" is not.

We use letters like p, q, r to represent propositions. We combine them using logical connectives:

• Negation (¬): "not p". If p is true, ¬p is false.
• Conjunction (∧): "p and q". True only if both p and q are true.
• Disjunction (∨): "p or q". True if at least one of p or q is true (inclusive or).
• Implication (→): "if p then q" (or "p implies q"). False only if p is true and q is false.
• Biconditional (↔): "p if and only if q" (or "p iff q"). True if p and q have the same truth value.

Truth tables are essential for understanding connectives. They show every possible combination of truth values for propositions and the resulting truth value of the compound proposition.

2.2 Tautologies, Contradictions, and Contingencies

Photo by A. G. Rosales on Pexels

• A tautology is a proposition that is always true, regardless of the truth values of its components (e.g., p ∨ ¬p).
• A contradiction is a proposition that is always false (e.g., p ∧ ¬p).
• A contingency is a proposition that is neither a tautology nor a contradiction; its truth value depends on the truth values of its components.

2.3 Logical Equivalence

Photo by Ivan S on Pexels

Two compound propositions are logically equivalent if they always have the same truth value for all possible truth values of their component propositions. We write this as P ≡ Q. You can prove equivalence using truth tables or by applying a series of known logical equivalences (like De Morgan's Laws).

2.4 Arguments and Validity

Photo by Tara Winstead on Pexels

An argument in logic is a sequence of propositions called premises that lead to a conclusion. An argument is valid if, whenever all the premises are true, the conclusion must also be true. Validity doesn't mean the conclusion is actually true, only that it follows logically from the premises.

We can analyze argument validity using truth tables or rules of inference.

flowchart TD
    A["Identify Propositions (p, q, r, ...)"] --> B["Translate into Symbolic Form"];
    B --> C{"Is it a Compound Proposition or Argument?"};
    C -- Compound Proposition --> D["Build Truth Table"];
    D --> E["Determine Tautology, Contradiction, or Contingency"];
    C -- Argument --> F["Identify Premises and Conclusion"];
    F --> G["Check for Validity (Truth Table or Rules of Inference)"];
    G --> H["Assess Logical Soundness (Validity + True Premises)"];

2.5 Predicate Logic (Briefly)

While propositional logic deals with propositions as atomic units, predicate logic goes a step further, allowing you to analyze the internal structure of propositions using predicates, variables, and quantifiers (like "for all" ∀ and "there exists" ∃). This allows for much more detailed and nuanced logical analysis, but you'll usually start with propositional logic.

3. Worked Example

Let's determine if the argument "If it rains, the ground is wet. The ground is wet. Therefore, it rained." is valid.

1. Identify Propositions:

   • p: It rains.
   • q: The ground is wet.

2. Translate into Symbolic Form:

   • Premise 1: p → q
   • Premise 2: q
   • Conclusion: p

3. Formulate the Implication for Validity Check: An argument is valid if (Premise 1 ∧ Premise 2) → Conclusion is a tautology. So we need to check if ((p → q) ∧ q) → p is a tautology.

4. Build a Truth Table:

5. Analyze the Result: In the third row, p is False, q is True. Both premises (p → q and q) are True, but the conclusion (p) is False. This means that it's possible for the premises to be true and the conclusion to be false.

Therefore, the argument is invalid. This is a common fallacy called "affirming the consequent."

4. Key Takeaways

• Propositions are statements that are definitively true or false.
• Logical connectives (¬, ∧, ∨, →, ↔) combine propositions into more complex statements, with truth tables defining their behavior.
• Truth tables are fundamental for determining the truth values of compound propositions and checking logical equivalence.
• A valid argument guarantees that if its premises are true, its conclusion must also be true, regardless of the actual truth of the premises.
• A tautology is always true, a contradiction is always false, and a contingency can be either.

• Logical equivalence means two statements always have the same truth value under the same conditions.

• Common Mistakes to Avoid:

  • Confusing validity (logical structure) with soundness (validity + true premises).
  • Misinterpreting "inclusive or" for "exclusive or" in disjunction.
  • Incorrectly applying the truth table for implication (p → q is only false when p is true and q is false).
  • Assuming a conclusion is true just because the argument seems plausible in natural language.

5. Now Try It

Consider the statement: "If you study hard and attend lectures, then you will pass the exam."
1. Translate this statement into symbolic logic using p for "you study hard," q for "you attend lectures," and r for "you will pass the exam."
2. Construct a truth table for your symbolic statement.
3. Based on your truth table, if you don't study hard, but do attend lectures, and do pass the exam, does that contradict the original statement?

Success looks like a correctly translated symbolic expression, a complete truth table, and a reasoned answer to the contradiction question that aligns with the truth table.