What Is Predicate Logic? Quantifiers & Variables Explained

Direct Answer

Predicate logic — also called first-order logic or the predicate calculus — is the formal system that analyzes statements into their internal structure: predicates (properties and relations), terms (names and variables), and quantifiers ("for all," ∀, and "there exists," ∃). Where propositional logic treats "Socrates is mortal" as an unanalyzed unit, predicate logic represents it as Mortal(s) — the predicate is mortal applied to the object Socrates.

The gain in expressive power is enormous. Predicate logic can represent:

• Relations: Loves(John, Mary) — a two-place relation that no syllogism could express.
• Quantified claims: ∀x(Number(x) → ∃y(Successor(y, x))) — "every number has a successor," with nested quantifiers.
• General laws: ∀x∀y((x < y) → ∃z(x < z ∧ z < y)) — density of the ordering, the kind of statement mathematics is made of.

Validity is defined semantically: an argument is valid if every model (every interpretation of the predicates over a domain of objects) that makes the premises true also makes the conclusion true. This is the logic of mathematics, of much of analytic philosophy, and of automated theorem proving.

Historical Context

Predicate logic was invented, almost at a stroke, by Gottlob Frege in his Begriffsschrift ("concept-script") of 1879. Frege replaced the subject-predicate grammar of traditional logic with a function-argument structure borrowed from mathematics, introduced the universal quantifier, and showed how existential claims could be defined in terms of it. His purpose was logicism: to prove that arithmetic is a branch of logic. The Begriffsschrift made this possible for the first time.

Frege's notation was forbidding and his work was largely ignored until Bertrand Russell publicized it. Russell and Whitehead's Principia Mathematica (1910–1913) built on Frege's system, and by the 1920s first-order logic had become the standard framework of the new mathematical logic. The decisive semantic advance came from Alfred Tarski, whose model-theoretic definition of truth (1933) and logical consequence (1936) made precise what it means for a sentence to be true in a structure — the foundation of model theory. Kurt Godel's completeness theorem (1930) then showed that first-order logic is complete: every valid formula is provable, and every provable formula is valid.

Philosophical Significance

Predicate logic reshaped philosophy of language and metaphysics. Frege's analysis showed that the grammatical form of a sentence — subject and predicate — is not its logical form; "the morning star is the evening star" has one logical form (a = b) but two grammatical subjects. This insight, deepened in Russell's theory of definite descriptions, became the template of analytic philosophy: use logical form to dissolve philosophical confusion.

First-order logic also frames the great limits of knowledge. Godel's incompleteness theorems showed that no consistent formal system strong enough for arithmetic can prove all its truths; Tarski's theorem showed that truth for a language cannot be defined within that language. These results, which presuppose the very precision predicate logic provides, are among the deepest constraints on the human pursuit of knowledge. And because first-order logic is decidable in the sense of being complete but not decidable in general (Church and Turing, 1936), it marks the boundary of what computation can decide.

Examples

Translating English:

• "All philosophers are human" → ∀x(Philosopher(x) → Human(x))
• "Some philosopher is wise" → ∃x(Philosopher(x) ∧ Wise(x))
• "Everyone loves someone" → ∀x∃y Loves(x, y)
• "Someone loves everyone" → ∃x∀y Loves(x, y)

Note how the order of quantifiers changes the meaning: the first is true in most romantic worlds, the second is true only for the universally beloved.

A valid argument in predicate logic:

• ∀x(Human(x) → Mortal(x))
• Human(Socrates)
• Therefore, Mortal(Socrates)

This is the single most famous inference in the history of logic, expressible at full generality for the first time by Frege's system.

Related Concepts

Predicate logic extends propositional logic, which it presupposes; together they define logical consequence and the modern notion of a valid argument. Its semantics were formalized by Tarski, its limits were mapped by Godel, and its philosophical uses run through analytic philosophy and the philosophy of language.

Further Learning

The Stanford Encyclopedia entries "Frege's Logic" and "First-Order Logic" provide authoritative history and theory; the Internet Encyclopedia's "Predicate Logic" entry is an accessible technical introduction. For the primary source, Frege's Begriffsschrift (in From Frege to Godel, edited by Jean van Heijten) is a revelation. For practice with quantifiers, forall x by P. D. Magnus and Language, Proof and Logic by Barwise and Etchemendy are excellent.