3.2: Truth Tables and Propositions Generated by a Set

Summary of Logic Notation

Be sure to review this notation summary since these terms will be used throughout this unit.

The notation for logic operations has been gradually introduced as our study proceeds. Here is a summary:

∊     element of, x ∊ Y, x is an element of Set Y

∉     not an element of, x ∉ Y, x is not an element of Set Y

∧     and, conjunction, p ∧ q, p and q

∨     or, disjunction, p ∨ q, p or q

ᆨ     not, ᆨp, not p; sometimes you will see the letter with a line over it, other times, you may see a preceding minus sign

⟶    conditional implication, p ⟶ q, if p then q

↔     biconditional implication, p ↔ q, p if and only if q

Truth Tables and Propositions Generated by a Set

What is in a set and what is not in a set leads to some interesting ways of analyzing truth or falsehood. In this section we use 0 for false (no) and 1 for true (yes). One can also speak in terms of "do-not" or "do", "do not perform this action" or "do this action". It is a matter of interpretation, an interpretation that must be established and remain consistent. We can write equations to express these ideas so that many factors can be considered and operated upon in a standard way. This section starts you down that path.

3.2 Truth Tables and Propositions Generated by a Set

3.2.1 Truth Tables

Consider the compound proposition \(c= (p \wedge q) \vee (\neg q \wedge r)\), where p , q , and  r are propositions. This is an example of a proposition generated by p , q , and r.  We will define this terminology later in the section. Since each of the three simple propositions has two possible truth values, it follows that there are eight different combinations of truth values that determine a value for c . These values can be obtained from a truth table for c . To construct the truth table, we build c from p , q , and r and from the logical operators. The result is the truth table below. Strictly speaking, the first three columns and 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 \wedge q) \vee (\neg q \wedge r)\)

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^n\) rows with the first n columns being an enumeration of the n digit binary integers. In our example, 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.

3.2.2 Propositions Generated by a Set

Definition 3.2.2: Proposition Generated by a Set.

 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,

1. If \(p \epsilon \text{ } S\), then p is a proposition generated by S, and
2. If x and y are propositions generated by S, then so are (x), \(\neg x\), \( x \vee y\), and \( x \wedge y\).

Note: 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 \wedge q \vee r\) is taken to mean \((p \wedge q) \vee r\). These precedence rules are universal and are exactly those used by computer languages to interpret logical expressions.

Example 3.2.3: Examples of the Hierarchy of Logical Operations

A few shortened expressions and their fully parenthesized versions:

1. \(p \wedge q \wedge r\) is \((p \wedge q) \wedge r\).
2. \(\neg p \vee \neg r\) is \((\neg p) \vee (\neg r)\).
3. \(\neg \neg p\) is \(\neg(\neg p)\).
4. \(p \leftrightarrow q \wedge r \to s\) is \(p \leftrightarrow ((q \wedge r) \to s)\)

A proposition generated by a set S need not include each element of S in its expression. For example, \(\neg q \wedge r\) is a proposition generated by p, q, and r.