Symbolic LogicPredicate Logic: Translation and Truth

The Quantifiers ∀ and ∃

∀x Fx says everything is F; ∃x Fx says at least one thing is F. A variable is bound when a quantifier covers it.

Not started Jump to practice

Names let us talk about particular things (Predicates and Names). Quantifiers let us talk about all things, or some, without naming them. That is what "All dogs are mammals" and "Some birds cannot fly" need.

Key idea

$\forall x Fx$ (read "for all $x$, $x$ is $F$") says everything is $F$. $\exists x Fx$ ("there is an $x$ such that $x$ is $F$") says at least one thing is $F$. A variable like $x$ is bound when a quantifier covers it.

Why it works

A variable is a placeholder, like a pronoun: $Fx$ alone says "it is $F$" without saying what "it" is, so it is neither true nor false. A quantifier fixes how to read the placeholder: $\forall x$ means "whatever you pick", $\exists x$ means "for at least one choice". The domain, the collection of things we are talking about, is fixed in advance: people in a club, shapes in a picture.
Where the $\neg$ goes changes the claim.
EnglishSymbols
Everything is red.$\forall x Rx$
Something is red.$\exists x Rx$
Nothing is red.$\neg \exists x Rx$, or $\forall x\neg Rx$
Not everything is red.$\neg \forall x Rx$, or $\exists x\neg Rx$
Something is not red.$\exists x\neg Rx$
Shapes: $C$ circle, $S$ square, $T$ triangle, $R$ red, $B$ blue, $L$ large. Tap a shape to change it and watch the truth values.

Worked examples

Worked example: Evaluate in a world

In the world above, is $\forall x Rx$ true?
  1. Check every object: $a$ red, $b$ red, $c$ blue.
  2. One counterexample, $c$, is enough to make it false.

Answer: False

Worked example: Some

Is $\exists x Rx$ true?
  1. One witness is enough: $a$ is red.

Answer: True

Worked example: Nothing

Translate "Nothing is a triangle" ($T$: is a triangle).
  1. "Nothing" denies that something is: $\neg \exists x Tx$.
  2. Equivalently, everything is not a triangle: $\forall x\neg Tx$.

Answer: $\neg \exists x Tx$

Common mistake

Reading "some" as "some but not all". $\exists x Fx$ means at least one thing is $F$, and it stays true when everything is $F$. If every shape in a world is red, $\exists x Rx$ is true. To say "some but not all", write both parts: $\exists x Rx \land \exists x\neg Rx$.

Worked example: Not everything

Translate "Not everything is large" ($L$: is large), and check it in the world above.
  1. Deny the universal: $\neg \forall x Lx$.
  2. In the world, $a$ is not large, so $\forall x Lx$ is false and its negation is true.

Answer: $\neg \forall x Lx$, true here.

Any variable will do: $\forall x Rx$ and $\forall y Ry$ say exactly the same thing, since the variable only marks which places the quantifier governs. We use $x$, $y$ and $z$ for variables and keep $a$, $b$, $c$ for names, so a reader can always tell a placeholder from a particular object.

Watch the scope of a quantifier: it covers only what comes right after it. In $\exists x Fx \land Gx$ the $\exists x$ covers only $Fx$, and the $x$ in $Gx$ is left free, so the formula is not a complete sentence. Use parentheses, $\exists x(Fx \land Gx)$, to make the quantifier cover both.

More on Teddy Rook BookQuantifiers

Practice

Pass with 3 right answers, the last 2 in a row. Each right answer earns 2 XP.

Loading practice…

Builds on

Leads to

Sources and further reading

  • Patrick J. Hurley and Lori Watson, A Concise Introduction to Logic, 13th ed., section 8.1
  • forall x: Calgary, an open introduction to formal logic (P. D. Magnus, Tim Button and others; Open Logic Project), chapter on quantifiers
@teddyrookbook GitHub