Steply

Truth table of q -> p

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

Step by step

The question

Question: make the truth table of q → p.

q → p

1 Rows for p and q

Each letter can be true or false.

Two letters give 2 × 2 = 4 rows: every way they can go.

= two letters: 2 × 2 = 4 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: T, F, T, F, down the column.

2 Column for q → p

We read the arrow as if, then.

→ = if ..., then ...

q → p is a promise: if q, then p.

It is broken only when q is true and p is false.

q → p: F only when q is T and p is F

So it is F only in row 3.

Careful!

If the if-part is false, the promise is not broken.

So F → F is T, and so is F → T.

Careful: not F → F = F ✗

The last column is the answer: when q → p is true.

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

= q → p: T, T, F, T

3 Check

Let's check row 3 by hand.

In row 3, p is false and q is true.

row 3: p = F, q = T

Put them in: T → F.

It gives F, as in the table.

Right!

T → F = F

Let's look back.

First: rows for p and q.

Then: column for q → p.

Last: check.

Answer
= q → p: T, T, F, T

Your turn

Try this one yourself, then check:

Make the truth table of q ↔ p
Show the answer
q ↔ p: T, F, F, T

More from Truth tables

The whole lesson: Truth tables →