Determine validity of arguments using logical rules

Historical Context & Motivation

The question of what constitutes a valid argument has occupied thinkers for well over two millennia, originating in the philosophical traditions of ancient Greece. Before formal logic existed, disputes about governance, ethics, and natural philosophy were settled through rhetoric — persuasion rather than proof. The development of formal deductive reasoning transformed this landscape by providing a mechanical method to determine whether a conclusion genuinely follows from its premises, independent of the subject matter or the speaker's charisma.

Today, determining argument validity is not merely an exercise in philosophy; it underpins software verification, database query optimization, automated theorem proving, and the design of artificial intelligence systems. The central question this lesson addresses is precise: given a set of premises and a proposed conclusion, how do we rigorously determine whether the argument is valid using the standard rules of propositional and predicate logic?

Core Principles & Definitions

Before applying any rule of inference, it is essential to fix the terminology precisely. An argument is a finite sequence of propositions — the premises — followed by a single proposition called the conclusion. We say the argument is valid if and only if it is impossible for every premise to be true while the conclusion is false. Validity concerns form, not factual accuracy; an argument can be valid yet have false premises, and conversely, every premise and the conclusion can be true while the argument remains invalid.

Visual Explanation — Rules of Inference Map

The diagram above presents the eight rules as modular building blocks. In practice, you will chain several of these rules together to form a formal proof — a sequence of statements where each statement is either a premise or follows from previous statements by exactly one rule. The elimination rules are especially powerful in the early steps of a proof when you need to 'unpack' conditional and disjunctive premises, while the introduction rules become important toward the end when you must assemble the target conclusion from simpler pieces you have derived.

Mathematical Framework

An argument with premises P₁, P₂, …, Pₙ and conclusion C is formally written as P₁, P₂, …, Pₙ ∴ C. The argument is valid if and only if the conditional (P₁ ∧ P₂ ∧ … ∧ Pₙ) → C is a tautology. Equivalently, there exists no truth-value assignment under which all premises are true and the conclusion is false. Two principal methods exist for establishing validity: exhaustive truth-table verification and constructive formal proof using rules of inference.

Beyond these primary rules, logical equivalences serve as rewriting tools that allow you to transform premises into more useful forms without altering their truth value. De Morgan's laws (¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q), the law of contraposition (p → q ≡ ¬q → ¬p), and the material conditional identity (p → q ≡ ¬p ∨ q) are the most frequently deployed equivalences in proof construction. Think of equivalences as interchangeable machine parts that maintain the argument's logical integrity while reshaping it into a form where an inference rule can fire.

Common Fallacies & Classification

Recognizing invalid argument forms is as important as mastering valid ones. Two formal fallacies are particularly insidious because they superficially resemble valid rules. The fallacy of affirming the consequent (p → q, q ∴ p) looks like modus ponens but affirms the wrong component; knowing that rain implies wet streets does not let you conclude from wet streets that it rained — a sprinkler could be responsible. Similarly, the fallacy of denying the antecedent (p → q, ¬p ∴ ¬q) resembles modus tollens but denies the wrong component; knowing that studying leads to passing does not let you conclude from not studying that you will fail, since other factors could suffice.

Worked Example — Constructing a Formal Proof

Consider the following argument. We are given three premises and must derive the conclusion r using only the standard rules of inference and logical equivalences.

Note the proof strategy: we recognized that the second premise, though phrased as a disjunction, is equivalent to a conditional, and this rewriting allowed us to cascade two applications of modus ponens to reach the goal. Identifying such rewriting opportunities is a critical skill in constructing efficient proofs. An alternative approach would have been to use hypothetical syllogism on lines 1 and 5 to get p → r, then applying modus ponens with line 3 — arriving at the same result in the same number of steps.

Proof Methods — Strengths & Limitations

There are several methods for determining argument validity, each with distinct trade-offs. The truth-table method is exhaustive and mechanical: construct a truth table for all propositional variables, evaluate the premises and conclusion in every row, and check whether there is any row in which all premises are true but the conclusion is false. If no such row exists, the argument is valid. This method is conceptually simple but grows exponentially — with n variables, you must evaluate 2ⁿ rows. The formal proof method uses inference rules to derive the conclusion from the premises, typically requiring far fewer steps, but it demands strategic insight to select the right rules. A third approach, proof by contradiction (indirect proof), assumes the negation of the conclusion alongside the premises and derives a contradiction, thereby establishing validity.

Connections to Advanced Theory

The rules of inference studied in propositional logic are the foundation upon which more expressive logical systems are built. In first-order predicate logic, the same propositional rules apply, augmented by four additional rules for handling quantifiers: universal instantiation (∀x P(x) ⊢ P(c)), universal generalization (P(c) for arbitrary c ⊢ ∀x P(x)), existential instantiation (∃x P(x) ⊢ P(c) for a fresh constant c), and existential generalization (P(c) ⊢ ∃x P(x)). Mastery of propositional inference is prerequisite to working fluently in this richer setting.

Beyond first-order logic, the inference-rule paradigm extends into natural deduction systems (developed by Gentzen and Jaśkowski in the 1930s), sequent calculi, and type theory — the latter forming the foundation of modern proof assistants like Coq, Lean, and Isabelle. In all these systems, the core idea remains unchanged: validity is established by applying certified transformation rules to derive a conclusion from premises. The propositional rules you learn here are the atoms from which these more powerful systems are constructed.

Practice Problems

Summary & Review