Philosophy I / The Language of Propositional Logic
Practice question · Put in order

Arrange these compounds so that each is true in strictly more of the four assignments than the one before it.

Hints
  1. Count the rows of a four-row table in which each sentence comes out true.
  2. The counts are 0, 1, 3 and 4 respectively.
Show the answer
  1. P and not-P
  2. P and Q
  3. P or Q
  4. if P then P
Why

True in 0, 1, 3 and 4 rows respectively. Counting satisfying rows orders sentences by logical strength: a contradiction excludes everything, a tautology excludes nothing, and the informative sentences lie in between.

Read the lesson: The Language of Propositional Logic →

Practise The Language of Propositional Logic

The app has 4 more questions on this lesson, and keeps your place in the course. Philosophy I is free to start.

More questions on The Language of Propositional Logic