Professional Documents
Culture Documents
3.2TruthTablesandPropositionsGeneratedbyaSet-MathematicsLibreTexts_1708554840153
3.2TruthTablesandPropositionsGeneratedbyaSet-MathematicsLibreTexts_1708554840153
3.2TruthTablesandPropositionsGeneratedbyaSet-MathematicsLibreTexts_1708554840153
the last column make up the truth table for c. The other columns are work space needed to build up to c.
Table 3.2.1 : Truth Table for c = (p ∧ q) ∨ (¬q ∧ r)
p q r p ∧ q ¬q ¬q ∧ r (p ∧ q) ∨ (¬q ∧ r)
0 0 0 0 1 0 0
0 0 1 0 1 1 1
0 1 0 0 0 0 0
0 1 1 0 0 0 0
1 0 0 0 1 0 0
1 0 1 0 1 1 1
1 1 0 1 0 0 1
1 1 1 1 0 0 1
Note that the first three columns of the truth table are an enumeration of the eight three-digit binary integers. This
standardizes the order in which the cases are listed. In general, if c is generated by n simple propositions, then the truth
table for c will have 2 rows with the first n columns being an enumeration of the n digit binary integers. In our example,
n
we can see at a glance that for exactly four of the eight cases, c will be true. For example, if p and r are true and q is false
(the sixth case), then c is true.
Let S be any set of propositions. We will give two definitions of a proposition generated by S. The first is a bit imprecise, but
should be clear. The second definition is called a recursive definition. If you find it confusing, use the first definition and
return to the second later.
Let S be any set of propositions. A proposition generated by S is any valid combination of propositions in S with
conjunction, disjunction, and negation. Or, to be more precise,
a. If p ∈ S, then p is a proposition generated by S, and
b. If x and y are propositions generated by S, then so are (x), ¬x, x ∨ y , and x ∧ y.
Note 3.2.1
We have not included the conditional and biconditional in the definition because they can both be generated from
conjunction, disjunction, and negation, as we will see later.
If S is a finite set, then we may use slightly different terminology. For example, if S = {p, q, r}, we might say that a
proposition is generated by p, q, and r instead of from {p, q, r}.
It is customary to use the following hierarchy for interpreting propositions, with parentheses overriding this order:
First: Negation
Second: Conjunction
Third: Disjunction
Fourth: The conditional operation
Fifth: The biconditional operation
Within any level of the hierarchy, work from left to right. Using these rules, p ∧ q ∨ r is taken to mean (p ∧ q) ∨ r. These
precedence rules are universal, and are exactly those used by computer languages to interpret logical expressions.
Example 3.2.1: Examples of the Hierarchy of Logical Operations
A proposition generated by a set S need not include each element of S in its expression. For example, ¬q ∧ r is a proposition
generated by p, q, and r.
3.2.3: Exercises
Exercise 3.2.1
Answer
p p ∨ p
a. 0 0
1 1
p ¬p p ∧ (¬p)
b. 0 1 0
1 0 0
p ¬p p ∨ (¬p)
c. 0 1 1
1 0 1
p p ∧ p
d. 0 0
1 1
Exercise 3.2.2
Exercise 3.2.3
Answer
a. ¬(p ∧ r) ∨ s
b. (p ∨ q) ∧ (r ∨ q)
Exercise 3.2.4
Determine the number of rows in the truth table of a proposition containing four variables p, q, r, and s.
Answer
2
4
= 16 rows.
Exercise 3.2.6
If there are 45 lines on a sheet of paper, and you want to reserve one line for each line in a truth table, how large could
|S| be if you can write truth tables of propositions generated by S on the sheet of paper?
This page titled 3.2: Truth Tables and Propositions Generated by a Set is shared under a CC BY-NC-SA 3.0 license and was authored,
remixed, and/or curated by Al Doerr & Ken Levasseur via source content that was edited to the style and standards of the LibreTexts
platform; a detailed edit history is available upon request.