A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Formal Logical Fallacies

College Depth 81 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
430prerequisites beneath it
See this on the map →
Logical Form and Argument PatternsValidity and Soundness+2 more→→Logical Consistency and Contradiction
formal-fallacy deduction logical-form

Core Idea

Formal fallacies are errors that arise from the structure of an argument rather than its content. The three most common are affirming the consequent ('If P then Q; Q; therefore P'), denying the antecedent ('If P then Q; not P; therefore not Q'), and equivocation (shifting the meaning of a term mid-argument so the logical form breaks down). Unlike informal fallacies, these can be identified purely by inspecting the argument's symbolic structure without knowing what the terms refer to. Mastering formal fallacies sharpens the ability to distinguish valid from invalid inference patterns.

How It's Best Learned

Place each fallacy next to its valid counterpart: affirming the consequent beside modus ponens, denying the antecedent beside modus tollens. Symbolize real-world arguments and check whether the inference pattern is licensed. Practice with examples that sound persuasive but fail structurally.

Common Misconceptions

Explainer

From your study of logical form and validity, you know that a deductively valid argument is one where, necessarily, if all the premises are true, the conclusion must be true. Validity is a structural property — it depends entirely on the form of the argument, not the truth of its content. Formal fallacies exploit that structural character: they are argument patterns that look like valid inference forms but are not. You can identify them without knowing whether the premises are true, because the flaw is in the skeleton of the reasoning itself.

The most common formal fallacy is affirming the consequent. You know modus ponens: "If P then Q; P; therefore Q." This is valid — the conclusion follows necessarily. Affirming the consequent smuggles in an extra step: "If P then Q; Q; therefore P." This is invalid. An example: "If it is raining, the streets are wet. The streets are wet. Therefore, it is raining." The streets might be wet because a water main broke. The conditional tells you what follows from rain; it does not tell you that only rain can cause wet streets. The conclusion does not follow from the premises. Its valid counterpart — modus tollens ("If P then Q; not Q; therefore not P") — gives you information from the consequent only when the consequent is *absent*.

Denying the antecedent makes the symmetric error: "If P then Q; not P; therefore not Q." Example: "If you study hard, you will pass. You did not study hard. Therefore, you will not pass." Again invalid — the conditional says studying leads to passing, not that studying is the *only* path to passing. Its valid counterpart, modus tollens, negates the consequent to infer the negation of the antecedent — not the reverse.

Equivocation is the subtlest of the three because it masquerades as an issue of content but is really structural. When a key term shifts meaning between its occurrence in one premise and another, the argument form breaks down. A classic example: "A feather is light. What is light cannot be dark. Therefore, no feather can be dark." The word "light" means *low in weight* in the first premise and *bright* in the second. Once you disambiguate, the two premises don't connect. Symbolically, the apparent chain of inference contains two different terms treated as one. The lesson from all three formal fallacies is the same: the appearance of valid inference does not guarantee validity. Symbolizing arguments forces the structure into the open, where these patterns become visible.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Propositional Connectives → Propositional Semantics and Valuations → Truth Functions and Interpretation → Formula Evaluation and Truth Tables → Logical Equivalence of Formulas → Logical Equivalence in Propositional Logic → Conjunctive and Disjunctive Normal Forms → Sequent Calculus → Soundness and Completeness of Propositional Logic → Validity and Soundness → Logical Form and Argument Patterns → Formal Logical Fallacies

Longest path: 82 steps · 430 total prerequisite topics

Prerequisites (4)

Leads To (1)