Rules of Logic

Section 1.3 Rules of Logic

Objectives

After completing this section, you should be able to do the following.

Use truth tables to determine whether two statements are logically equivalent.
🔗

🔗
Use truth tables to determine whether a deduction rule is valid.
🔗

🔗
Use logical equivalence and deduction rules to simplify statements and make deductions.
🔗

🔗

Subsection Section Preview

Investigate!

Holmes always wears one of the two vests he owns: one tweed and one mint green. He always wears either the green vest or red shoes. Whenever he wears a purple shirt and the green vest, he chooses to not wear a bow tie. He never wears the green vest unless he is also wearing either a purple shirt or red shoes. Whenever he wears red shoes, he also wears a purple shirt. Today, Holmes wore a bow tie. What else did he wear?

🔗

Try it 1.3.1.

Spend a few minutes thinking about the Investigate! question above. Of the six statements in the puzzle, only one is atomic. Use this atomic statement and one other statement to deduce a new statement about what Holmes might (or might not) be wearing. Explain why you think your new statement is true.

🔗

Hint.

The atomic statement is, “Holmes wore a bow tie.” Only one of the molecular statements has this as one of its atoms.

🔗

Logic studies the ways statements can interact with each other. More precisely, we consider the way the logical form statements can interact. The study of logic does not care about the content of the atomic statements or the meaning of predicates. For example, the claims, “If spiders have six legs, then Sam walks with a limp,” and, “If the moon is made of cheese, then cheddar is a type of cheese,” are identical from a logical perspective. Logic doesn’t care about whether Sam is a spider or the culinary makeup of the moon. Both statements have the same form: They are implications,

P \to Q .

🔗

Of course, in mathematics we often do know some relationship between various atomic statements. For example, we know a relationship between being even and being a multiple of 10. That relationship allows us to make claims such as, “If the number I’m thinking of is a multiple of 10, then it is even.” Suppose I also told you that I am now thinking of a number that is not even. We can deduce that I am not thinking of a multiple of 10! Crucially, if we accept the truth of the statements here, we can make this deduction without thinking about the nature of numbers. It can feel very liberating and provide much-needed clarity when trying to understand complicated reasoning if we can separate the content from the logical form of arguments.

🔗

Our goal in this section is to establish some procedures for analyzing how the truth or falsity of statements interact, based on their logical form. We will see that some molecular statements must be true regardless of whether their atomic parts are true or false, while some statements must always be false. For other statements, it can be that two statements are always true or false together, or that whenever one statement is true, another statement must also be true.

🔗

The main method for establishing these relationships will be truth tables. There is a very clear procedure for constructing and analyzing truth tables, but for complicated arguments that contain many atomic statements, the truth tables become very large and unwieldy. We will therefore use truth tables to understand some basic equivalences and deductions that can be applied in a sequence of reasoning to construct larger arguments.

🔗

Worksheet Preview Activity
A4 US

1.

Consider the statement, “Whenever Holmes wears a purple shirt and the green vest, he chooses to not wear a bow tie.” Let

P

be the statement, “Holmes wears a purple shirt,”

G

be the statement, “Holmes wears the green vest,” and

B

be the statement, “Holmes wears a bow tie.” Which of the following is the best translation of the statement into propositional logic?

🔗

$(P \land G) \to \neg B$
🔗
$(P \land G) \to B$
🔗
$(P \lor G) \to \neg B$
🔗
$P \land (G \to B)$
🔗

🔗

2.

Consider the statement, “Holmes never wears the green vest unless he is also wearing either a purple shirt or red shoes.” With

P

and

G

as in the previous question, and

R

being the statement, “Holmes wears red shoes,” which of the following is the best translation of the statement into propositional logic?

🔗

$G \to (P \lor R)$
🔗
$\neg G \to (P \lor R)$
🔗
Consider the case where Holmes does wear a green vest but does not wear a purple shirt or red shoes. That would make $\neg G$ false and $P \lor R$ true, so the implication would be true. But in this situation, the original statement would be false.
$(P \lor R) \to G$
🔗
Consider the case where Holmes does not wear a purple shirt or red shoes, and does wear the green vest. That would make $P \lor R$ false and $G$ true, so the implication would be true. But in this situation, the original statement would be false.
$(P \lor R) \to \neg G$
🔗
Consider the case where Holmes does not wear a purple shirt or red shoes, and does wear the green vest. That would make $P \lor R$ false and $\neg G$ false, so the implication would be true. But in this situation, the original statement would be false.

🔗

3.

Consider the statement, “If you major in math, then you will get a high-paying job,” and the statement, “Either you don’t major in math, or you will get a high-paying job.” In which of the following cases are both statements true? Select all that apply.

🔗

You major in math and get a high-paying job.
🔗
You major in math and don’t get a high-paying job.
🔗
In fact, in this case, both of the statements are false.
You don’t major in math and do get a high-paying job.
🔗
This makes the implication true because the if part is false. The disjunction is true because the first part is true.
You don’t major in math and don’t get a high-paying job.
🔗

🔗

Subsection Truth Tables

Here’s a question about playing Monopoly:

🔗

If you get more doubles than any other player, then you will lose, or if you lose, then you must have bought the most properties.
🔗

🔗

True or false? We will answer this question and won’t need to know anything about Monopoly. Instead, we will look at the logical form of the statement.

🔗

We need to decide when the statement

(P \to Q) \lor (Q \to R)

is true. Using the definitions of the connectives in Definition 1.1.8, we see that for this to be true, either

P \to Q

must be true or

Q \to R

must be true (or both). Those are true if either

P

is false or

Q

is true (in the first case) and

Q

is false or

R

is true (in the second case). So—yeah, it gets a bit messy. Luckily, we can make a chart to keep track of all the possibilities with a truth table.

🔗

The idea is this: On each row, we list a possible combination of T’s and F’s (Trues and Falses) for each of the propositional variables, and then mark down whether the (molecular) statement in question is true or false in that case. We do this for every possible combination of T’s and F’s. Then we can clearly see the cases in which the statement is true or false. For complicated statements, we will first fill in values for each part of the statement, as a way of breaking up our task into smaller, more manageable pieces.

🔗

Since the truth value of a statement is completely determined by the truth values of its parts and how they are connected, all you need to know is the truth tables for each of the logical connectives, which we have already seen in Figure 1.1.9

🔗

The truth tables we consider here all build off the basic ones, applying the basic rules multiple times.

🔗

Example 1.3.2.

Make a truth table for the statement

\neg P \lor Q .

🔗

Solution.

Note that this statement is not

\neg (P \lor Q);

the negation belongs to

P

alone. The main connective here is the

\lor,

which means we will use that truth table last. First, we apply the truth table for

\neg,

and then apply the truth table for

\lor

using “inputs” from

\neg P

and

Q .

🔗

Since there are two variables, there are four possible combinations of T’s and F’s. Putting this all together gives us the following truth table.

🔗

$P$	$Q$	$\neg P$	$\neg P \lor Q$
T	T	F	T
T	F	F	F
F	T	T	T
F	F	T	T

We added a column for

\neg P

to make filling out the last column easier. The entries in the

\neg P

column were determined by the entries in the

P

column. Then to fill in the final column, look only at the column for

Q

and the column for

\neg P

and use the rule for

\lor .

🔗

Now let’s answer our question about Monopoly.

🔗

Example 1.3.3.

Analyze the statement, “If you get more doubles than any other player, then you will lose, or if you lose, then you must have bought the most properties,” using truth tables.

🔗

Solution.

Represent the statement in symbols as

(P \to Q) \lor (Q \to R),

where

P

is the statement, “You get more doubles than any other player,”

Q

is the statement, “You will lose,” and

R

is the statement, “You must have bought the most properties.” Now make a truth table.

🔗

The truth table must contain 8 rows to account for every possible combination of truth and falsity among the three statements. Here is the full truth table:

🔗

$P$	$Q$	$R$	$P \to Q$	$Q \to R$	$(P \to Q) \lor (Q \to R)$
T	T	T	T	T	T
T	T	F	T	F	T
T	F	T	F	T	T
T	F	F	F	T	T
F	T	T	T	T	T
F	T	F	T	F	T
F	F	T	T	T	T
F	F	F	T	T	T

The first three columns are simply a systematic listing of all possible combinations of T and F for the three statements (do you see how you would list the 16 possible combinations for four statements?). The next two columns are determined by the values of

P,

Q,

and

R

and the definition of implication. Then, the last column is determined by the values in the previous two columns and the definition of

\lor .

It is this final column we care about.

🔗

Notice that in each of the eight possible cases, the statement in question is true. So our statement about monopoly is true (regardless of how many properties you own, how many doubles you roll, or whether you win or lose).

🔗

The statement about monopoly is an example of a tautology, a statement that is necessarily true based on its logical form alone. Tautologies are always true, but they don’t tell us much about the world. No knowledge about monopoly was required to determine that the statement was true, and thus knowing that the statement is true tells us nothing about monopoly. It is equally true that “if the moon is made of cheese, then Elvis is still alive, or if Elvis is still alive, then unicorns have 5 legs.”

🔗

Subsection Logical Equivalence

You might have noticed in Example 1.3.2 that the final column in the truth table for

\neg P \lor Q

is identical to the final column in the truth table for

P \to Q :

🔗

$P$	$Q$	$P \to Q$	$\neg P \lor Q$
T	T	T	T
T	F	F	F
F	T	T	T
F	F	T	T

This says that no matter what

P

and

Q

are, the statements

\neg P \lor Q

and

P \to Q

are either both true or both false. We therefore say these statements are logically equivalent.

🔗

Definition 1.3.4. Logical Equivalence.

Two (molecular) statements

P

and

Q

are logically equivalent provided

P

is true precisely when

Q

is true. That is,

P

and

Q

have the same truth value under any assignment of truth values to their atomic parts.

🔗

We write this as

P \equiv Q .

🔗

To verify that two statements are logically equivalent, you can make a truth table for each and check whether the columns for the two statements are identical.

🔗

In Section 1.2 we claimed that whenever an implication is true, so is its contrapositive. We can now make this claim as the following theorem.

🔗

Theorem 1.3.5.

An implication is logically equivalent to its contrapositive. That is,

P \to Q \equiv \neg Q \to \neg P .

🔗

Proof.

We simply examine the truth tables.

🔗

$P$	$Q$	$P \to Q$
T	T	T
T	F	F
F	T	T
F	F	T

$P$	$Q$	$\neg Q$	$\neg P$	$\neg Q \to \neg P$
T	T	F	F	T
T	F	T	F	F
F	T	F	T	T
F	F	T	T	T

(Note that we have the truth value combinations in the same order in both tables, so we can easily see that the final columns are identical.)

🔗

Recognizing two statements as logically equivalent can be quite helpful. Rephrasing a mathematical statement can often lend insight into what it is saying, or how to prove or refute it. By using truth tables we can systematically verify that two statements are indeed logically equivalent.

🔗

Example 1.3.6.

Are the statements, “It will not rain or snow,” and, “It will not rain and it will not snow,” logically equivalent?

🔗

Solution.

We want to know whether

\neg (P \lor Q)

is logically equivalent to

\neg P \land \neg Q .

Make a truth table which includes both statements:

🔗

$P$	$Q$	$\neg (P \lor Q)$	$\neg P \land \neg Q$
T	T	F	F
T	F	F	F
F	T	F	F
F	F	T	T

Since the truth values for the two statements are equal in every row, the two statements are logically equivalent.

🔗

Notice that this example gives us a way to “distribute” a negation over a disjunction (an “or”). We have a similar rule for distributing over conjunctions (“and”s):

🔗

Theorem 1.3.7. De Morgan’s Laws.

The negation of a disjunction or conjunction is logically equivalent to a conjunction or disjunction of negations, respectively. That is,

\neg (P \land Q) \equiv \neg P \lor \neg Q

and,

\neg (P \lor Q) \equiv \neg P \land \neg Q .

🔗

This suggests there might be a sort of “algebra” you could apply to statements (okay, there is: It is called Boolean algebra) to transform one statement into another. We can start collecting useful examples of logical equivalence and apply them in succession to a statement, instead of writing out a complicated truth table.

🔗

De Morgan’s laws do not directly help us with implications, but as we saw above, every implication can be written as a disjunction:

🔗

Implications are Disjunctions.

P \to Q \equiv \neg P \lor Q .

🔗

Example: “If a number is a multiple of 4, then it is even” is equivalent to, “A number is not a multiple of 4, or (else) it is even.”

🔗

With this and De Morgan’s laws, you can take any statement and simplify it to the point where negations are only being applied to atomic propositions. Well, except that you could get multiple negations stacked up. But this can be easily dealt with:

🔗

Double Negation.

\neg \neg P \equiv P .

🔗

Example: “It is not the case that

c

is not odd” means “

c

is odd.”

🔗

Let’s see how we can apply the equivalences we have encountered.

🔗

Example 1.3.8.

Prove that the statements

\neg (P \to Q)

and

P \land \neg Q

are logically equivalent without using truth tables.

🔗

Solution.

We want to start with one of the statements and transform it into the other through a sequence of logically equivalent statements. Start with

\neg (P \to Q) .

We can rewrite the implication as a disjunction, so this is logically equivalent to

\neg (\neg P \lor Q) .

Now apply De Morgan’s law to get

\neg \neg P \land \neg Q .

Finally, use double negation to arrive at

P \land \neg Q

🔗

Notice that the above example illustrates that the negation of an implication is NOT an implication: It is a conjunction! We saw this before, in Section 1.1, but it is so important and useful, it warrants stating as a theorem.

🔗

Theorem 1.3.9. Negation of an Implication.

The negation of an implication is a conjunction:

\neg (P \to Q) \equiv P \land \neg Q .

That is, the only way for an implication to be false is for the hypothesis to be true AND the conclusion to be false.

🔗

To verify that two statements are logically equivalent, you can use truth tables or a sequence of logically equivalent replacements. The truth table method, although cumbersome, has the advantage that it can verify that two statements are NOT logically equivalent.

🔗

Example 1.3.10.

Are the statements

(P \lor Q) \to R

and

(P \to R) \lor (Q \to R)

logically equivalent?

🔗

Solution.

Note that while we could start rewriting these statements with logically equivalent replacements in the hopes of transforming one into another, we will never be sure that our failure is due to their lack of logical equivalence rather than our lack of imagination. So instead, let’s make a truth table:

🔗

$P$	$Q$	$R$	$(P \lor Q) \to R$	$(P \to R) \lor (Q \to R)$
T	T	T	T	T
T	T	F	F	F
T	F	T	T	T
T	F	F	F	T
F	T	T	T	T
F	T	F	F	T
F	F	T	T	T
F	F	F	T	T

Look at the fourth (or sixth) row. In this case,

(P \to R) \lor (Q \to R)

is true, but

(P \lor Q) \to R

is false. Therefore the statements are not logically equivalent.

🔗

While we don’t have logical equivalence, it is the case that whenever

(P \lor Q) \to R

is true, so is

(P \to R) \lor (Q \to R) .

This tells us that we can deduce

(P \to R) \lor (Q \to R)

from

(P \lor Q) \to R,

just not the reverse direction.

🔗

Subsection Equivalence for Quantified Statements

All the examples we have looked at so far have only involved propositional logic, where the basic units of logic are statements that are either true or false. It is also possible to say that two statements involving quantifiers and predicates are logically equivalent.

🔗

Sometimes the quantifiers have nothing to do with the equivalence. For example,

\forall x (P (x) \to Q (x)) \equiv \forall x (\neg P (x) \lor Q (x)) .

As soon as we replace the

x

with a constant, we are left with two statements that are logically equivalent based on their propositional form.

🔗

Other times, the more interesting times, it is exactly the logic of the quantifiers that makes the statements logically equivalent. What is especially interesting here is that we cannot use truth tables to verify these equivalences!

🔗

Instead, we need to reason about the domain of discourse as a set. For example, let’s consider how negation interacts with quantifiers.

🔗

Consider the claim that “all odd numbers are prime.” We might represent this symbolically as

\forall x (O (x) \to P (x)) .

The statement clearly is not true, so what is true is that “not all odd numbers are prime” (i.e.,

\neg \forall x (O (x) \to P (x))

). How do we know? Easy: 9. Yes, 9 is odd but not prime. But is it enough that just one odd number isn’t prime?

🔗

To dispute a universal claim, you just need one single counterexample. You just need to show there exists a number for which the claim is false. In our case, we have the equivalence,

\neg \forall x (O (x) \to P (x)) \equiv \exists x (O (x) \land \neg P (x)) .

If we ignore the quantifiers for a minute, we are left with

\neg (O \to P) \equiv O \land \neg P

which is exactly an example of Theorem 1.3.9. The new, interesting part is that when we negated the universal quantifier, we got an existential quantifier.

🔗

Negating an existential quantifier results in a universal quantifier. This makes sense. If there does not exist something with a property, then everything does not have that property.

🔗

Quantifiers and Negation.

$\neg \forall x P (x)$ is equivalent to $\exists x \neg P (x) .$
🔗

$\neg \exists x P (x)$ is equivalent to $\forall x \neg P (x) .$
🔗

🔗

🔗

Symbolically, we can pass the negation symbol over a quantifier, but that causes the quantifier to switch type.

🔗

Another way to see why this makes sense: Universal quantifiers are like (possibly infinite) conjunctions since they claim that the property is true of this thing, and that thing, and the other thing,... all things. Existential quantifiers are like (possibly infinite) disjunctions: The property is true of at least one thing, maybe this, or that, or the other, or.... De Morgan’s laws tell us that when we negate a conjunction, we get a disjunction, and when we negate a disjunction, we get a conjunction. Isn’t it great when everything works out as it should?

🔗

Example 1.3.11.

Suppose we claim that there is no smallest number. We can translate this into symbols as

\neg \exists x \forall y (x \leq y) .

(“It is not true that there is a number

x

such that for all numbers

y,

x

is less than or equal to

y .

”)

🔗

However, we know how negation interacts with quantifiers: We can pass a negation over a quantifier by switching the quantifier type (between universal and existential). So the statement above should be logically equivalent to

\forall x \exists y (y < x) .

Notice that

y < x

is the negation of

x \leq y .

This reads, “For every number

x

there is a number

y

which is smaller than

x .

” We see that this is another way to make our original claim.

🔗

It is important to stress that predicate logic extends propositional logic (much like how quantum mechanics extends classical mechanics). Everything that we learned about logical equivalence and deductions still applies. However, predicate logic allows us to analyze statements at a higher resolution, digging down into the individual propositions

P,

Q,

etc.

🔗

To do this, we need to understand how quantifiers and connectives interact. We have already seen something about negations and quantifiers. What about the other connectives? Let’s look at an example exploring how the universal quantifier and disjunctions can (or cannot) work together.

🔗

Example 1.3.12.

Consider the two statements,

\forall x (P (x) \lor Q (x)) \forall x P (x) \lor \forall x Q (x) .

Are these logically equivalent?

🔗

Solution.

These statements are NOT logically equivalent. Intuitively, the statement on the left claims that everything is either a

P

-thing or a

Q

-thing. The statement on the right claims that either everything is a

P

-thing or that everything is a

Q

-thing. These feel different.

🔗

To be sure, we would like to think of predicates

P (x)

and

Q (x)

and some domain of discourse such that one of the statements is true and the other is false. How about we let

P (x)

be, “

x

is even” and

Q (x)

be, “

x

is odd.” Our domain of discourse will be all integers (as that is the set of numbers for which even and odd make sense).

🔗

The statement on the left is true! Every number is either even or odd. But is every number even? No. Is every number odd? No. So the statement on the right is false (it is a false or false).

🔗

Interestingly, the statement on the right implies the statement on the left. That is,

(\forall x P (x) \lor \forall x E (x)) \to \forall x (P (x) \lor Q (x))

is always true.

🔗

This is similar to a tautology, although we reserve that term for necessary truths in propositional logic. A statement in predicate logic that is necessarily true gets the more prestigious designation of a law of logic (or sometimes logically valid, but that is less fun).

🔗

We can also consider how quantifiers interact with each other.

🔗

Example 1.3.13.

Can you switch the order of quantifiers? For example, consider the two statements:

\forall x \exists y P (x, y) and \exists y \forall x P (x, y) .

Are these logically equivalent?

🔗

Solution.

These statements are NOT logically equivalent. To see this, we should provide an interpretation of the predicate

P (x, y)

which makes one of the statements true and the other false.

🔗

Let

P (x, y)

be the predicate

x < y .

It is true, in the natural numbers, that for all

x

there is some

y

greater than that

x

(since there are infinitely many numbers). However, there is no natural number

y

which is greater than every number

x .

Thus it is possible for

\forall x \exists y P (x, y)

to be true while

\exists y \forall x P (x, y)

is false.

🔗

We cannot do the reverse of this though. If there is some

y

for which every

x

satisfies

P (x, y),

then certainly for every

x

there is some

y

which satisfies

P (x, y) .

The first is saying we can find one

y

that works for every

x .

The second allows different

y

’s to work for different

x

’s, but nothing is preventing us from using the same

y

that works for every

x .

In other words, while we don’t have logical equivalence between the two statements, we do have a valid deduction rule:

🔗

	$\exists y \forall x P (x, y)$
$∴$	$\forall x \exists y P (x, y)$

Put yet another way, this says that the single statement

\exists y \forall x P (x, y) \to \forall x \exists y P (x, y)

is always true; it is a law of logic.

🔗

Subsection Deductions

Earlier, we claimed that the following was a valid argument:

🔗

If Edith eats her vegetables, then she can have a cookie. Edith ate her vegetables. Therefore Edith gets a cookie.
🔗

🔗

How do we know this is valid? Let’s look at the form of the statements. Let

P

denote, “Edith eats her vegetables” and

Q

denote, “Edith can have a cookie.” The logical form of the argument is then:

🔗

	$P \to Q$
	$P$
$∴$	$Q$

This is an example of a deduction rule, an argument form that is always valid. This one is a particularly famous rule called modus ponens. Are you convinced that it is a valid deduction rule? If not, consider the following truth table:

🔗

$P$	$Q$	$P \to Q$
T	T	T
T	F	F
F	T	T
F	F	T

This is just the truth table for

P \to Q,

but what matters here is that all the lines in the deduction rule have their own column in the truth table. Remember that an argument is valid provided the conclusion must be true given that the premises are true. The premises in this case are

P \to Q

and

P .

Which rows of the truth table correspond to both of these being true?

P

is true in the first two rows, and of those, only the first row has

P \to Q

true as well. And lo-and-behold, in this one case,

Q

is also true. So if

P \to Q

and

P

are both true, we see that

Q

must be true as well.

🔗

Think of deduction rules as a sort of one-way form of logical equivalence. Two statements are logically equivalent provided that in every row of the truth table in which the first statement is true, so is the second, and in every row in which the second statement is true, so is the first. A deduction only requires the first of these two parts.

🔗

Here are a few more examples.

🔗

Example 1.3.14.

Show that the following is a valid deduction rule.

🔗

	$P \to Q$
	$\neg P \to Q$
$∴$	$Q$

Solution.

We make a truth table which contains all the lines of the argument form:

🔗

$P$	$Q$	$P \to Q$	$\neg P$	$\neg P \to Q$
T	T	T	F	T
T	F	F	F	T
F	T	T	T	T
F	F	T	T	F

(we include a column for

\neg P

just as a helping step to get the column for

\neg P \to Q

🔗

Now look at all the rows for which both

P \to Q

and

\neg P \to Q

are true. This happens only in rows 1 and 3. Hey! In those rows

Q

is true as well, so the argument form is valid (it is a valid deduction rule).

🔗

Example 1.3.15.

Decide whether the following is a valid deduction rule.

🔗

	$P \to R$
	$Q \to R$
	$R$
$∴$	$P \lor Q$

Solution.

Let’s make a truth table containing all four statements.

🔗

$P$	$Q$	$R$	$P \to R$	$Q \to R$	$P \lor Q$
T	T	T	T	T	T
T	T	F	F	F	T
T	F	T	T	T	T
T	F	F	F	T	T
F	T	T	T	T	T
F	T	F	T	F	T
F	F	T	T	T	F
F	F	F	T	T	F

Look at the second-to-last row. Here all three premises of the argument are true, but the conclusion is false. Thus this is not a valid deduction rule.

🔗

While we have the truth table in front of us, look at rows 1, 3, and 5. These are the only rows in which all of the statements

P \to R,

Q \to R,

and

P \lor Q

are true. It also happens that

R

is true in these rows as well. Thus we have discovered a new deduction rule we know is valid:

🔗

	$P \to R$
	$Q \to R$
	$P \lor Q$
$∴$	$R$

🔗

Quantifier deductions.

There are also deduction rules we could write down for quantifiers. For example:

🔗

	$\forall x P (x)$
$∴$	$\exists x P (x)$

If everything is a

P

-thing, then there must be something which is a

P

-thing. These rules cannot be verified with a truth table, and a full treatment of this sort of predicate logic is beyond the scope of this text.

🔗

Reading Questions Reading Questions

1.

To check whether two statements are logically equivalent, you can use a truth table. Explain what you would look for in the truth table to conclude that the two statements are logically equivalent. What would tell you they are not logically equivalent?

🔗

2.

To check whether a deduction rule is valid, you can use a truth table. Explain what you would look for in the completed truth table to say that the deduction rule is valid, and what would tell you the deduction rule is not valid.

🔗

3.

What questions do you have after reading this section? Write at least one question about the content of this section that you are curious about.

🔗

Exercises Practice Problems

1.

Make a truth table for the statement

(P \land Q) \to (P \lor Q) .

🔗

$P$	$Q$	$P \land Q$	$P \lor Q$	$(P \land Q) \to (P \lor Q))$
T	T
T	F
F	T
F	F

🔗

2.

Make a truth table for the statement

\neg Q \lor (Q \to P))

🔗

$P$	$Q$	$\neg Q$	$Q \to P$	$\neg Q \lor (Q \to P))$
T	T
T	F
F	T
F	F

What can you conclude about

P

and

Q

if you knew the statement above was false?

🔗

That $P$ and $Q$ are both false.
🔗

🔗
That $P$ is true and $Q$ is false.
🔗

🔗
That $P$ is false and $Q$ is true.
🔗

🔗
That $P$ and $Q$ are both true.
🔗

🔗
None of the above.
🔗

🔗

🔗

3.

Make a truth table for the statement

\neg P \land (Q \to R)

🔗

$P$	$Q$	$R$	$\neg P$	$Q \to R$	$\neg P \land (Q \to R)$
T	T	T
T	T	F
T	F	T
T	F	F
F	T	T
F	T	F
F	F	T
F	F	F

🔗

4.

Determine whether the statements

P \to (Q \lor R)

and

(P \to Q) \lor (P \to R)

are logically equivalent.

🔗

First, make a truth table for both of the statements. (You might want to complete the truth table on paper so you can make columns for intermediate steps; just record the final columns here.)

🔗

$P$	$Q$	$R$	$P \to (Q \lor R)$	$(P \to Q) \lor (P \to R)$
T	T	T
T	T	F
T	F	T
T	F	F
F	T	T
F	T	F
F	F	T
F	F	F

Are the two statements logically equivalent?

🔗

No, because the columns for the two statements are not identical.
🔗

🔗
Yes, because even though the columns are not identical, there are some rows in which they are identical.
🔗

🔗
No, because the statements are not always true.
🔗

🔗
Yes, because the columns for the two statements are identical.
🔗

🔗
Impossible to determine without more information.
🔗

🔗

🔗

5.

Determine if the following is a valid deduction rule:

🔗

	$P \to Q$
	$\neg Q$
$∴$	$\neg P$

First, make a truth table for the relevant statements. (You might want to complete the truth table on paper so you can make columns for intermediate steps; just record the final columns here.)

🔗

$P$	$Q$	$P \to Q$	$\neg Q$	$\neg P$
T	T
T	F
F	T
F	F

Is the deduction rule valid?

🔗

Yes, in every row where both premises are true, the conclusion is also true.
🔗

🔗
Yes, because there is a row in which both premises are true.
🔗

🔗
No, because the conclusion is not always true.
🔗

🔗
No, because the columns for the two premises are not identical.
🔗

🔗
Impossible to determine without more information.
🔗

🔗

🔗

6.

Determine if the following is a valid deduction rule:

🔗

	$P \to (Q \lor R)$
	$\neg (P \to Q)$
$∴$	$R$

First, make a truth table for the relevant statements. (You might want to complete the truth table on paper so you can make columns for intermediate steps; just record the final columns here.)

🔗

$P$	$Q$	$R$	$P \to (Q \lor R)$	$\neg (P \to Q)$
T	T	T
T	T	F
T	F	T
T	F	F
F	T	T
F	T	F
F	F	T
F	F	F

Is the deduction rule valid?

🔗

Yes, because there is a row in which both premises are true.
🔗

🔗
Yes, in every row where both premises are true, the conclusion is also true.
🔗

🔗
No, because the columns for the two premises are not identical.
🔗

🔗
No, because the statements are not always true.
🔗

🔗
Impossible to determine without more information.
🔗

🔗

🔗

7.

Determine if the following is a valid deduction rule:

🔗

	$(P \land Q) \to R$
	$\neg P \lor \neg Q$
$∴$	$\neg R$

First, make a truth table for the relevant statements. (You might want to complete the truth table on paper so you can make columns for intermediate steps; just record the final columns here.)

🔗

$P$	$Q$	$R$	$(P \land Q) \to R$	$\neg P \lor \neg Q$	$\neg R$
T	T	T
T	T	F
T	F	T
T	F	F
F	T	T
F	T	F
F	F	T
F	F	F

Is the deduction rule valid?

🔗

No, because the columns for the two premises are not identical.
🔗

🔗
Yes, because there is a row in which the conclusion and both premises are true.
🔗

🔗
No, because there is a row in which both premises are true but the conclusion is false.
🔗

🔗
Yes, because in every row that the conclusion is true, one of the premises is true.
🔗

🔗
Impossible to determine without more information.
🔗

🔗

🔗

8.

Determine if the following is a valid deduction rule:

🔗

	$P \to Q$
	$P \land \neg Q$
$∴$	$R$

First, make a truth table for the relevant statements. (You might want to complete the truth table on paper so you can make columns for intermediate steps; just record the final columns here.)

🔗

$P$	$Q$	$R$	$P \to Q$	$P \land \neg Q$
T	T	T
T	T	F
T	F	T
T	F	F
F	T	T
F	T	F
F	F	T
F	F	F

Is the deduction rule valid?

🔗

Yes, because there is a row in which both premises are true.
🔗

🔗
No, because the columns for the two premises are not identical.
🔗

🔗
Yes, in every row where both premises are true, the conclusion is also true.
🔗

🔗
No, because the premises are never both true in the same row.
🔗

🔗
Impossible to determine without more information.
🔗

🔗

🔗

9.

Which of the following statements is a law of logic? That is, which of the following are true no matter what your domain of discourse is and no matter what you interpret the predicates as meaning? Select all that apply.

🔗

$\forall x (P (x) \lor \neg P (x)) .$
🔗
$\exists x P (x) \to \forall x P (x) .$
🔗
$\neg \forall x P (x) \to \exists x P (x) .$
🔗
$\forall x \exists y P (x, y) \leftrightarrow \exists y \forall x P (x, y) .$
🔗

🔗

Exercises Additional Exercises

1.

You stumble upon two trolls playing Stratego®. They tell you:

🔗

Troll 1: If we are cousins, then we are both knaves.
🔗

Troll 2: We are cousins, or we are both knaves.
🔗

🔗

Could both trolls be knights? Recall that all trolls are either always-truth-telling knights or always-lying knaves. Explain your answer and how you can use truth tables to find it.

🔗

Hint.

You could probably reason through the cases by hand, but try making a truth table. Use two statements,

P

being “we are cousins” and

Q

being “we are both knaves”.

🔗

2.

Next you come upon three trolls, helpfully wearing name tags. They say:

Pat 🔗: If either Quinn or I are knights, then so is Ryan.
🔗
Quinn 🔗: Ryan is a knight, and if Pat is a knight, then so am I.
🔗
Ryan 🔗: Quinn is a knave, but Pat and I share the same persuasion.
🔗

Create a truth table that includes all three statements. Then use the truth table to determine the persuasion of each troll.

🔗

3.

Consider the statement about a party, “If it’s your birthday or there will be cake, then there will be cake.”

Translate the above statement into symbols. Clearly state which statement is $P$ and which is $Q .$
🔗

🔗
Make a truth table for the statement.
🔗

🔗
Assuming the statement is true, what (if anything) can you conclude if you know there will be cake?
🔗

🔗
Assuming the statement is true, what (if anything) can you conclude if you know there will not be cake?
🔗

🔗
Suppose you found out that the statement was a lie. What can you conclude?
🔗

🔗

🔗

4.

Geoff Poshingten is out at a fancy pizza joint and decides to order a calzone. When the waiter asks what he would like in it, he replies, “I want either pepperoni or sausage. Also, if I have sausage, then I must also include quail. Oh, and if I have pepperoni or quail, then I must also have ricotta cheese.”

Translate Geoff’s order into logical symbols.
🔗

🔗
The waiter knows that Geoff is either a liar or a truth-teller (so either everything he says is false, or everything is true). Which is it?
🔗

🔗
What, if anything, can the waiter conclude about the ingredients in Geoff’s desired calzone?
🔗

🔗

🔗

Hint.

You should write down three statements using the symbols

P, Q, R, S .

If Geoff is a truth-teller, then all three statements would be true. If he was a liar, then all three statements would be false. But in either case, we don’t yet know whether the four atomic statements are true or false, since he hasn’t said them by themselves.

🔗

A truth table might help, although it is probably not entirely necessary.

🔗

5.

Determine whether the following two statements are logically equivalent:

\neg (P \to Q)

and

P \land \neg Q .

Explain how you know you are correct.

🔗

6.

Simplify the following statements (so that negation only appears right before variables).

$\neg (P \to \neg Q) .$

🔗
$(\neg P \lor \neg Q) \to \neg (\neg Q \land R) .$

🔗
$\neg ((P \to \neg Q) \lor \neg (R \land \neg R)) .$

🔗
It is false that if Sam is not a man then Chris is a woman, and that Chris is not a woman.
🔗

🔗

🔗

7.

Use De Morgan’s Laws and any other logical equivalence facts you know to simplify the following statements. Show all your steps. Your final statements should have negations only appear directly next to the sentence variables or predicates (

P,

Q,

E (x),

etc.), and no double negations. It would be a good idea to use only conjunctions, disjunctions, and negations.

$\neg ((\neg P \land Q) \lor \neg (R \lor \neg S)) .$

🔗
$\neg ((\neg P \to \neg Q) \land (\neg Q \to R))$ (careful with the implications).

🔗
For both parts above, verify your answers are correct using truth tables. That is, use a truth table to check that the given statement and your proposed simplification are actually logically equivalent.
🔗

🔗

🔗

8.

Consider the statement, “If a number is triangular or square, then it is not prime”

Make a truth table for the statement $(T \lor S) \to \neg P .$
🔗

🔗
If you believed the statement was false, what properties would a counterexample need to possess? Explain by referencing your truth table.
🔗

🔗
If the statement were true, what could you conclude about the number 5657, which is definitely prime? Again, explain using the truth table.
🔗

🔗

🔗

Hint.

There will be three rows in which the statement is false.
🔗

🔗
Consider the three rows that evaluate to false, and say what the truth values of $T,$ $S,$ and $P$ are there.
🔗

🔗
You are looking for a row in which $P$ is true and the whole statement is true.
🔗

🔗

🔗

9.

Tommy Flanagan was telling you what he ate yesterday afternoon. He tells you, “I had either popcorn or raisins. Also, if I had cucumber sandwiches, then I had soda. But I didn’t drink soda or tea.” Of course, you know that Tommy is the world’s worst liar, and everything he says is false. What did Tommy eat?

🔗

Justify your answer by writing all of Tommy’s statements using sentence variables (

P, Q, R, S, T

), taking their negations, and using these to deduce what Tommy actually ate.

🔗

Hint.

Write down three statements, and then take the negation of each (since he is a liar). You should find that Tommy ate one item and drank one item. (

Q

is for cucumber sandwiches.)

🔗

10.

Can you chain implications together? That is, if

P \to Q

and

Q \to R,

does that means the

P \to R ?

Prove that the following is a valid deduction rule:

🔗

	$P \to Q$
	$Q \to R$
$∴$	$P \to R$

🔗

11.

Suppose

P

and

Q

are (possibly molecular) propositional statements. Prove that

P

and

Q

are logically equivalent if and only if

P \leftrightarrow Q

is a tautology.

🔗

Hint.

What do these concepts mean in terms of truth tables?

🔗

12.

Suppose

P_{1}, P_{2}, \dots, P_{n}

and

Q

are (possibly molecular) propositional statements. Suppose further that

🔗

	$P_{1}$
	$P_{2}$
	$⋮$
	$P_{n}$
$∴$	$Q$

is a valid deduction rule. Prove that the statement

(P_{1} \land P_{2} \land \dots \land P_{n}) \to Q

is a tautology.

🔗

13.

Consider the statements below. Translate each into symbols, using the predicate

F (x, y)

for “person

x

can be fooled at time

y .

” Decide whether any of the statements are equivalent to each other, or whether any imply any others, in this context or in general.

🔗

You can fool some people all of the time.
🔗

🔗
You can fool everyone some of the time.
🔗

🔗
You can always fool some people.
🔗

🔗
Sometimes you can fool everyone.
🔗

🔗

🔗

14.

Suppose

P (x)

is some predicate for which the statement

\forall x P (x)

is true. Is it also the case that

\exists x P (x)

is true? In other words, is the statement

\forall x P (x) \to \exists x P (x)

always true? Is the converse always true? Assume the domain of discourse is non-empty.

🔗

Hint.

Try an example. What if

P (x)

was the predicate, “

x

is prime”? What if it was, “If

x

is divisible by 4, then it is even”? Of course examples are not enough to prove something in general, but that is entirely the point of this question.

🔗

15.

Simplifying negations will be especially useful when we try to prove a statement by considering what would happen if it were false. For each statement below, write the negation of the statement as simply as possible. Don’t just say, “It is false that …”

Every number is either even or odd.
🔗

🔗
There is a sequence that is both arithmetic and geometric.
🔗

🔗
For all numbers $n,$ if $n$ is prime, then $n + 3$ is not prime.
🔗

🔗

🔗

Hint.

It might help to translate the statements into symbols and then use the formulaic rules to simplify negations (i.e., rules for quantifiers and De Morgan’s laws). After simplifying, you should get

\forall x (\neg E (x) \land \neg O (x))

for the first one, for example. Then translate this back into English.

🔗

16.

We can simplify statements in predicate logic using our rules for passing negations over quantifiers before applying logical equivalence to the “inside” propositional part. Simplify the statements below (so negation appears only directly next to predicates).

$\neg \exists x \forall y (\neg O (x) \lor E (y)) .$

🔗
$\neg \forall x \neg \forall y \neg (x < y \land \exists z (x < z \lor y < z)) .$

🔗
There is a number $n$ for which no other number is less than or equal to $n .$
🔗

🔗
It is false that for every number $n$ there are two other numbers which $n$ is between.
🔗

🔗

🔗

17.

Simplify the statements below to the point that negation symbols occur only directly next to predicates.

$\neg \forall x \forall y (x < y \lor y < x) .$
🔗

🔗
$\neg (\exists x P (x) \to \forall y P (y)) .$
🔗

🔗

🔗

You have attempted 1 of 14 activities on this page.

🔗

Prev Top Next

Section 1.3 Rules of Logic

Objectives

Subsection Section Preview

Investigate!

Try it 1.3.1.

Worksheet Preview Activity A4US

1.

2.

3.

Subsection Truth Tables

Example 1.3.2.

Example 1.3.3.

Subsection Logical Equivalence

Definition 1.3.4. Logical Equivalence.

Theorem 1.3.5.

Proof.

Example 1.3.6.

Theorem 1.3.7. De Morgan’s Laws.

Implications are Disjunctions.

Double Negation.

Example 1.3.8.

Theorem 1.3.9. Negation of an Implication.

Example 1.3.10.

Subsection Equivalence for Quantified Statements

Quantifiers and Negation.

Example 1.3.11.

Example 1.3.12.

Example 1.3.13.

Subsection Deductions

Example 1.3.14.

Example 1.3.15.

Quantifier deductions.

Reading Questions Reading Questions

1.

2.

3.

Exercises Practice Problems

1.

2.

3.

4.

5.

6.

7.

8.

9.

Exercises Additional Exercises

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

Worksheet Preview Activity
A4 US