Truth Tables – A Step-By-Step Example, Lecture notes of Discrete Mathematics

Suppose we are asked to do the truth table for the following statement form: ... instance of disjunction will be our 'final answer' – our goal is to fill in ...

Typology: Lecture notes

2021/2022

Uploaded on 08/05/2022

hal_s95
hal_s95 🇵🇭

4.4

(655)

10K documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Truth-Table Example 1
Truth Tables – A Step-By-Step Example
In what follows, the latest additions to the table are given in boldface.
Suppose we are asked to do the truth table for the following statement form:
(1) Q v (P Æ (~Q v ~P))
What follows is a breakdown of the process of building the table for (1).
Step 1: Create the blank table.
There are two atomic statements, P and Q, so the table will have four rows and three columns,
like so (see end of document for more information):
P Q
Q v (P Æ (~Q v ~P))
T T
T F
F T
F F
Step 2: Determine the main connective.
The main connective of (1) is the first occurrence of disjunction (“v”). So the column under this
instance of disjunction will be our ‘final answer’ – our goal is to fill in this column.
Now, in order to figure out what belongs in that main column (under the main connective), we
need to figure out the values for the two disjuncts.
Step 3: Fill in the table.
Figuring out the value for the left disjunct (Q) is easy, because we already have it listed to the
left. So we can simply copy the values over:
P Q
Q v (P Æ (~Q v ~P))
T T
T
T F
F
F T
T
F F
F
Turning now to the right disjunct, we see that it is a compound statement, “P Æ (~Q v ~P)”.
Since it is a conditional, we need to figure out the values for its antecedent and consequent. The
antecedent is easy – it’s just P, and we have the values for P to the left. The consequent is a
disjunction, we need to figure out the values for its two disjuncts, “~Q” and “~P”. Both of these
are negations, so they simply switch True to False and vice versa.
pf3

Partial preview of the text

Download Truth Tables – A Step-By-Step Example and more Lecture notes Discrete Mathematics in PDF only on Docsity!

Truth Tables – A Step-By-Step Example

In what follows, the latest additions to the table are given in boldface.

Suppose we are asked to do the truth table for the following statement form:

(1) Q v (P Æ (~Q v ~P))

What follows is a breakdown of the process of building the table for (1).

Step 1: Create the blank table.

There are two atomic statements, P and Q, so the table will have four rows and three columns, like so (see end of document for more information):

P Q (^) Q v (P Æ (~Q v ~P)) T T T F F T F F

Step 2: Determine the main connective.

The main connective of (1) is the first occurrence of disjunction (“v”). So the column under this instance of disjunction will be our ‘final answer’ – our goal is to fill in this column.

Now, in order to figure out what belongs in that main column (under the main connective), we need to figure out the values for the two disjuncts.

Step 3: Fill in the table.

Figuring out the value for the left disjunct (Q) is easy, because we already have it listed to the left. So we can simply copy the values over:

P Q Q v (P Æ (~Q v ~P)) T T T T F F F T T F F F

Turning now to the right disjunct, we see that it is a compound statement, “P Æ (~Q v ~P)”. Since it is a conditional, we need to figure out the values for its antecedent and consequent. The antecedent is easy – it’s just P, and we have the values for P to the left. The consequent is a disjunction, we need to figure out the values for its two disjuncts, “~Q” and “~P”. Both of these are negations, so they simply switch True to False and vice versa.

So, first, copy the values of Q and P from the left hand columns:

P Q Q v (P --> (~Q v ~P)) T T T T T T T F F T F T F T T F T F F F F F F F

Next, figure out the values of the two disjuncts in the consequent of the conditional:

P Q Q v (P --> (~Q v ~P)) T T T T F T F T T F F T T F F T F T T F F T T F F F F F T F T F

Now we have the information we need to determine the values for the disjunction in the consequent of the conditional. Consulting the characteristic truth table for disjunction, we get:

P Q Q v (P --> (~Q v ~P)) T T T T FT F FT T F F T TF T FT F T T F FT T TF F F F F TF T TF

So far, so good. We now have the values for both the antecedent and the consequent of the conditional, so, consulting the characteristic truth table for conditionals, we can fill in the values for the conditional:

P Q Q v (P --> (~Q v ~P)) T T T T F FT F FT T F F T T TF T FT F T T F T FT T TF F F F^ F^ T^ TF^ T^ TF

Finally, we have all the information we need to figure out the values for the main column:

P Q Q v (P --> (~Q v ~P)) T T T T T F FT F FT T F F T T T TF T FT F T T T F T FT T TF F F F T F T TF T TF

So, it turns out that any statement with this form is always true.