Steply

Truth table of p or (q and r)

Step by step, with the reason for every step · Truth tables · Discrete Math

Step by step

The question

Question: make the truth table of p ∨ (q ∧ r).

p ∨ (q ∧ r)

1 Rows for p, q and r

Each letter can be true or false.

Three letters give 2 × 2 × 2 = 8 rows: every way they can go.

= three letters: 2 × 2 × 2 = 8 rows

We make a table: a column for each letter, then a column for each part, from the inside out.

We write T for true and F for false.

T = true, F = false

p: the first half T, the second half F.

This way no row is missed.

q: two T, two F, and again.

r: T, F, T, F, down the column.

2 Column for q ∧ r

We read this sign as and.

∧ = and

q ∧ r is true only when q and r are both true.

q ∧ r: T only when both are T

So it is T only in rows 1 and 5.

3 Column for p ∨ (q ∧ r)

We read this sign as or.

∨ = or

p ∨ (q ∧ r) is true when at least one of them is true.

It is false only when both are false.

p ∨ (q ∧ r): F only when both are F

So it is F only in rows 6, 7 and 8.

Careful!

Or includes both.

When both are true, T ∨ T is T.

Careful: not T ∨ T = F ✗

The last column is the answer: when p ∨ (q ∧ r) is true.

Top to bottom: T, T, T, T, T, F, F, F.

= p ∨ (q ∧ r): T, T, T, T, T, F, F, F

4 Check

Let's check row 6 by hand.

In row 6, p is false, q is true and r is false.

row 6: p = F, q = T, r = F

Put them in: F ∨ (T ∧ F).

The inside first.

It gives F, as in the table.

Right!

F ∨ (T ∧ F) = F ∨ F = F

Let's look back.

First: rows for p, q and r.

Then: column for q ∧ r.

Then: column for p ∨ (q ∧ r).

Last: check.

Answer
= p ∨ (q ∧ r): T, T, T, T, T, F, F, F

Your turn

Try this one yourself, then check:

Make the truth table of p ∧ (q ∧ r)
Show the answer
p ∧ (q ∧ r): T, F, F, F, F, F, F, F

More from Truth tables

The whole lesson: Truth tables →