Symbolic LogicRelations and Identity

Relational Predicates

A relational predicate links two or more objects in order: Lab says a likes b, which is not the same as Lba.

Not started Jump to practice

So far every predicate has said something about one thing: $Fa$. Many claims link two or more things: "Ava helps Ben", "7 is greater than 3", "the library is between the park and the school". Relational predicates handle them. They extend the translations of Translating Harder Quantified Sentences.

Key idea

A relational predicate has two or more places, filled in order. $Hab$ says $a$ helps $b$; $Hba$ says $b$ helps $a$. The order of the names is part of the meaning, and quantifiers can fill any of the places: $\forall x Hxb$ (everyone helps Ben), $\exists x Hbx$ (Ben helps someone).

Why it works

"Ava helps Ben" and "Ben helps Ava" are different facts: one can be true while the other is false. A one-place predicate cannot express that difference, since $Ha \land Hb$ says only that both are helpers. With a two-place predicate the order of the names records who does what to whom. That is also why many valid arguments, like "Ava is taller than Ben; Ben is taller than Cleo; so Ava is taller than Cleo" (with the right premise about "taller"), need relations at all.
An arrow from $x$ to $y$ means $x$ helps $y$. Each sentence is checked against the arrows.

Worked examples

Worked example: Order

Let $Lxy$: $x$ likes $y$; $a$: Ava; $b$: Ben. Translate "Ben likes Ava."
  1. The one who likes goes first, the one who is liked second.

Answer: $Lba$

Worked example: A quantifier in one place

Translate "Everyone likes Ava" and "Ava likes everyone."
  1. "Everyone likes Ava": for every $x$, $x$ likes $a$.
  2. "Ava likes everyone": for every $x$, $a$ likes $x$.

Answer: $\forall x Lxa$ and $\forall x Lax$

Worked example: With a negation

Translate "Nobody likes Ben."
  1. It is not the case that someone likes Ben.

Answer: $\neg \exists x Lxb$, or $\forall x\neg Lxb$

Common mistake

Ignoring the order of the names. "Ava helps Ben" is $Hab$, not $Hba$. When you set up a predicate, write its meaning with variables in order, like "$Hxy$: $x$ helps $y$", and then fill the places in exactly that order. Passive sentences reverse the English order: "Ben is helped by Ava" is still $Hab$.
Two-place predicate $Hxy$: $x$ helps $y$.
EnglishSymbols
Ava helps herself.$Haa$
Someone helps Ben.$\exists x Hxb$
Ben helps someone.$\exists x Hbx$
Ava helps Ben, but Ben does not help Ava.$Hab \land \neg Hba$

Relations can have more than two places. "The library is between the park and the school" uses a three-place predicate: $Blps$, with the order fixed by the key "$Bxyz$: $x$ is between $y$ and $z$". The same care applies: decide the order of the places once, write it down, and stick to it.

Relations with quantifiers in two places, like "everyone likes someone", need two quantifiers, and their order turns out to matter a great deal. That is the next lesson.

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.6, Relational Predicates and Overlapping Quantifiers
  • forall x: Calgary, an open introduction to formal logic (P. D. Magnus, Tim Button and others; Open Logic Project), chapter on multiple generality
@teddyrookbook GitHub