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

Vagueness and Borderline Cases

College Depth 81 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
424prerequisites beneath it
See this on the map →
Vagueness and the Sorites ParadoxLogical Form and Argument Patterns→→Vagueness in Language and Argument Clarity
vagueness sorites semantics logic

Core Idea

Vagueness is ubiquitous (is someone with 1,000,001 hairs bald?), yet traditional logic assumes precise truth-conditions. Sorites arguments show how innocent-seeming principles lead to paradox. Supervaluationism, degree semantics, and epistemicism offer competing solutions with different implications for meaning and logic.

Explainer

You already understand the Sorites paradox: take a heap of sand, remove one grain — still a heap. Repeat a thousand times. At no point does a single grain make the difference between heap and non-heap, yet we end with one grain and the argument forces us to call it a heap. The paradox arises because "heap" is vague: there is no sharp boundary between heaps and non-heaps, and cases in the middle — a hundred grains, perhaps — are borderline cases where it is genuinely unclear whether the term applies. The challenge is to explain what's happening in borderline cases without accepting the paradox.

The simplest response is epistemicism, defended by Timothy Williamson. Vague predicates actually have perfectly sharp extensions — there really is a precise number of hairs below which someone is bald — but we cannot know where the boundary falls because our concepts are not precise enough to detect it. On this view, classical logic is fully preserved: every statement is either true or false; it's just that we can't always know which. The counterintuitive implication is that removing a single hair sometimes makes someone bald, we just can't tell when. Epistemicism saves logic at the cost of making meaning radically inaccessible.

Supervaluationism takes a different route. A vague predicate like "tall" can be "precisified" — made arbitrarily sharp — in many different ways. Someone 5'10" might count as tall on some precisifications and not tall on others. Supervaluationism says a sentence is supertrue if it is true on all precisifications, superfalse if false on all, and indeterminate (neither true nor false) if it varies. Classical tautologies like "John is tall or not tall" remain supertrue — true on every precisification — even when "John is tall" is indeterminate. This preserves classical logical laws while allowing truth-value gaps at borderline cases. The cost: some instances of classical inference fail; you can have a disjunction that is supertrue even though neither disjunct is true.

Degree semantics (developed by Kamp, Fine, and others) assigns sentences involving vague predicates degrees of truth between 0 and 1, rather than just true or false. "John is tall" might have a degree of 0.7 if he's 5'11". Logical connectives then operate on degrees: "not" inverts, "and" takes the minimum, "or" takes the maximum. Borderline cases are cases with intermediate degree, not missing truth values. The challenge for degree semantics is explaining what these degrees represent — are they objective features of the world, facts about our dispositions, or something else? — and handling higher-order vagueness: the boundary between "clearly tall" and "borderline tall" is itself vague, threatening an infinite regress of borderlines. Each theory reveals something important: vagueness is not merely a linguistic imprecision to be cleaned up, but a deep feature of how language engages with a continuous world.

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 → Vagueness and Borderline Cases

Longest path: 82 steps · 424 total prerequisite topics

Prerequisites (2)

Leads To (1)