Unit 2 Test Study Guide Logic And Proof

Unit 2 Test Study Guide: Logic and Proof

Mastering logic and proof is the cornerstone of advanced mathematical reasoning, computer science, and critical thinking. This unit 2 test study guide for logic and proof is designed to transform abstract concepts into a clear, actionable framework. Whether you're tackling propositional logic, predicate logic, or constructing formal proofs, understanding this foundational language empowers you to build sound arguments, detect flawed reasoning, and approach complex problems with precision. This guide breaks down the essential components, provides concrete examples, and offers strategic study methods to build both confidence and competence for your upcoming assessment.

The Foundation: Understanding Logical Statements and Connectives

At its heart, logic is the study of truth and the structure of arguments. Before writing a single proof, you must be fluent in the language of logic. This begins with propositions—declarative statements that are either true (T) or false (F), but not both. Examples include "2+2=4" (true) or "The sky is green" (false). Questions like "Is it raining?" are not propositions.

Propositions are combined using logical connectives to form more complex statements. The primary connectives you must know are:

• Negation (¬ or ~): "It is not raining." This simply flips the truth value.
• Conjunction (∧, "and"): "It is raining and it is cold." True only if both parts are true.
• Disjunction (∨, "or"): "It is raining or it is sunny." In logic, this is inclusive or—true if at least one part is true (including if both are true).
• Implication (→, "if...then"): "If it rains, then the ground gets wet." This is false only when the antecedent (P) is true and the consequent (Q) is false. The truth of P is not required for the implication to hold; a false antecedent makes the statement vacuously true.
• Biconditional (↔, "if and only if"): "A number is even if and only if it is divisible by 2." True when both sides have the same truth value (both T or both F).

Mastering truth tables is non-negotiable. Construct them for each connective and for compound statements. For example, the implication P → Q is logically equivalent to ¬P ∨ Q. Recognizing these equivalences is a key skill. Pay special attention to the converse (Q → P), inverse (¬P → ¬Q), and contrapositive (¬Q → ¬P) of an implication. Only the contrapositive is logically equivalent to the original statement—a crucial fact for proof techniques.

Quantifiers: From Specific to General

Moving beyond simple propositions, predicate logic introduces variables and quantifiers. The two primary quantifiers are:

• Universal Quantifier (∀): "For all x, P(x) is true." Example: ∀x (x² ≥ 0). To disprove a universal statement, you need only one counterexample.
• Existential Quantifier (∃): "There exists an x such that P(x) is true." Example: ∃x (x is prime and x is even). The number 2 is a witness to this statement.

The order of quantifiers matters critically. "∀x ∃y (x < y)" (for every x, there is a y greater than it) is true in the real numbers. "∃y ∀x (x < y)" (there is a y greater than all x) is false. This distinction is a common source of error on tests.

The Art of Proof: Strategies and Structures

A proof is a logical argument that establishes the truth of a theorem beyond doubt. Your unit will cover several standard proof methods. Knowing when to use each is half the battle.

1. Direct Proof

This is the most straightforward method. You assume the hypothesis (P) is true and use definitions, axioms, and previously proven theorems to logically deduce the conclusion (Q).

• Structure: Assume P. ... Therefore, Q.
• Best for: Statements with an implication in the form "If P, then Q." Example: Prove "If n is even, then n² is even." Assume n = 2k. Then n² = (2k)² = 4k² = 2(2k²), which is even.

2. Proof by Contrapositive

Instead of proving P → Q directly, you prove