Section 3.1 Propositional Logic
Investigate!
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 alwaystruthtelling knights or alwayslying knaves.
A proposition is simply a statement. Propositional logic studies the ways statements can interact with each other. It is important to remember that propositional logic does not really care about the content of the statements. For example, in terms of propositional logic, the claims, “if the moon is made of cheese then basketballs are round,” and “if spiders have eight legs then Sam walks with a limp” are exactly the same. They are both implications: statements of the form, \(P \imp Q\text{.}\)
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 \imp Q) \vee (Q \imp R)\) is true. Using the definitions of the connectives in Section 0.2, we see that for this to be true, either \(P \imp Q\) must be true or \(Q \imp 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 kind of messy. Luckily, we can make a chart to keep track of all the possibilities. Enter truth tables. The idea is this: on each row, we list a possible combination of T's and F's (for true and false) for each of the sentential variables, and then mark down whether the 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 in which cases 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 really need to know is the truth tables for each of the logical connectives. Here they are:
\(P\)  \(Q\)  \(P\wedge Q\) 
T  T  T 
T  F  F 
F  T  F 
F  F  F 
\(P\)  \(Q\)  \(P\vee Q\) 
T  T  T 
T  F  T 
F  T  T 
F  F  F 
\(P\)  \(Q\)  \(P\imp Q\) 
T  T  T 
T  F  F 
F  T  T 
F  F  T 
\(P\)  \(Q\)  \(P\iff Q\) 
T  T  T 
T  F  F 
F  T  F 
F  F  T 
The truth table for negation looks like this:
\(P\)  \(\neg P\) 
T  F 
F  T 
None of these truth tables should come as a surprise; they are all just restating the definitions of the connectives. Let's try another one.
Example 3.1.1.
Make a truth table for the statement \(\neg P \vee Q\text{.}\)
Note that this statement is not \(\neg(P \vee Q)\text{,}\) the negation belongs to \(P\) alone. Here is the truth table:
\(P\)  \(Q\)  \(\neg P\)  \(\neg P \vee 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 \(\vee\text{.}\)
Now let's answer our question about monopoly:
Example 3.1.2.
Analyze the statement, “if you get more doubles than any other player you will lose, or that if you lose you must have bought the most properties,” using truth tables.
Represent the statement in symbols as \((P \imp Q) \vee (Q \imp R)\text{,}\) 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 needs to contain 8 rows in order to account for every possible combination of truth and falsity among the three statements. Here is the full truth table:
\(P\)  \(Q\)  \(R\)  \(P \imp Q\)  \(Q \imp R\)  \((P \imp Q) \vee (Q \imp 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\text{,}\) \(Q\text{,}\) 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 \(\vee\text{.}\) 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 which is true on the basis of 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. In fact, 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 3.1.1 that the final column in the truth table for \(\neg P \vee Q\) is identical to the final column in the truth table for \(P \imp Q\text{:}\)
\(P\)  \(Q\)  \(P \imp Q\)  \(\neg P \vee 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 \vee Q\) and \(P \imp Q\) either both true or both false. We therefore say these statements are logically equivalent.
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.
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.
Recognizing two statements as logically equivalent can be very 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 3.1.3.
Are the statements, “it will not rain or snow” and “it will not rain and it will not snow” logically equivalent?
We want to know whether \(\neg(P \vee Q)\) is logically equivalent to \(\neg P \wedge \neg Q\text{.}\) Make a truth table which includes both statements:
\(P\)  \(Q\)  \(\neg(P \vee Q)\)  \(\neg P \wedge \neg Q\) 
T  T  F  F 
T  F  F  F 
F  T  F  F 
F  F  T  T 
Since in every row the truth values for the two statements are equal, 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):
De Morgan's Laws.
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 do not directly help us with implications, but as we saw above, every implication can be written as a disjunction:
Implications are Disjunctions.
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, actually not, because you could get multiple negations stacked up. But this can be easily dealt with:
Double Negation.
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 so far.
Example 3.1.4.
Prove that the statements \(\neg(P \imp Q)\) and \(P\wedge \neg Q\) are logically equivalent without using truth tables.
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 \imp Q)\text{.}\) We can rewrite the implication as a disjunction this is logically equivalent to
Now apply DeMorgan's law to get
Finally, use double negation to arrive at \(P \wedge \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 0.2, but it is so important and useful, it warants a second blue box here:
Negation of an Implication.
The negation of an implication is a conjunction:
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 3.1.5.
Are the statements \((P \vee Q) \imp R\) and \((P \imp R) \vee (Q \imp R)\) logically equivalent?
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\vee Q) \imp R\)  \((P\imp R) \vee (Q \imp 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 \imp R) \vee (Q \imp R)\) is true, but \((P \vee Q) \imp R\) is false. Therefore the statements are not logically equivalent.
While we don't have logical equivalence, it is the case that whenever \((P \vee Q) \imp R\) is true, so is \((P \imp R) \vee (Q \imp R)\text{.}\) This tells us that we can deduce \((P \imp R) \vee (Q \imp R)\) from \((P \vee Q) \imp R\text{,}\) just not the reverse direction.
Subsection Deductions
Investigate!
Holmes owns two suits: one black and one tweed. He always wears either a tweed suit or sandals. Whenever he wears his tweed suit and a purple shirt, he chooses to not wear a tie. He never wears the tweed suit unless he is also wearing either a purple shirt or sandals. Whenever he wears sandals, he also wears a purple shirt. Yesterday, Holmes wore a bow tie. What else did he wear?
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 \imp Q\)  
\(P\)  
\(\therefore\)  \(Q\) 
This is an example of a deduction rule, an argument form which 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\imp Q\) 
T  T  T 
T  F  F 
F  T  T 
F  F  T 
This is just the truth table for \(P \imp Q\text{,}\) 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 \imp Q\) and \(P\text{.}\) 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 \imp Q\) true as well. And loandbehold, in this one case, \(Q\) is also true. So if \(P\imp Q\) and \(P\) are both true, we see that \(Q\) must be true as well.
Here are a few more examples.
Example 3.1.6.
Show that
\(P \imp Q\)  
\(\neg P \imp Q\)  
\(\therefore\)  \(Q\) 
is a valid deduction rule.
We make a truth table which contains all the lines of the argument form:
\(P\)  \(Q\)  \(P\imp Q\)  \(\neg P\)  \(\neg P \imp 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 step to help getting the column for \(\neg P \imp Q\)).
Now look at all the rows for which both \(P \imp Q\) and \(\neg P \imp 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 3.1.7.
Decide whether
\(P \imp R\)  
\(Q \imp R\)  
\(R\)  
\(\therefore\)  \(P \vee Q\) 
is a valid deduction rule.
Let's make a truth table containing all four statements.
\(P\)  \(Q\)  \(R\)  \(P \imp R\)  \(Q \imp R\)  \(P \vee 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 \imp R\text{,}\) \(Q \imp R\text{,}\) and \(P\vee 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 \imp R\)  
\(Q \imp R\)  
\(P \vee Q\)  
\(\therefore\)  \(R\) 
Subsection Beyond Propositions
As we saw in Section 0.2, not every statement can be analyzed using logical connectives alone. For example, we might want to work with the statement:
All primes greater than 2 are odd.
To write this statement symbolically, we must use quantifiers. We can translate as follows:
In this case, we are using \(P(x)\) to denote “\(x\) is prime” and \(O(x)\) to denote “\(x\) is odd.” These are not propositions, since their truth value depends on the input \(x\text{.}\) Better to think of \(P\) and \(O\) as denoting properties of their input. The technical term for these is predicates and when we study them in logic, we need to use predicate logic.
It is important to stress that predicate logic extends propositional logic (much in the way quantum mechanics extends classical mechanics). You will notice that our statement above still used the (propositional) logical connectives. 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\text{,}\) \(Q\text{,}\) etc.
A full treatment of predicate logic is beyond the scope of this text. One reason is that there is no systematic procedure for deciding whether two statements in predicate logic are logically equivalent (i.e., there is no analogue to truth tables here). Rather, we end with a two examples of logical equivalence and deduction, to pique your interest.
Example 3.1.8.
Suppose we claim that there is no smallest number. We can translate this into symbols as
(literally, “it is not true that there is a number \(x\) such that for all numbers \(y\text{,}\) \(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
Notice that \(y \lt x\) is the negation of \(x \le y\text{.}\) This literally says, “for every number \(x\) there is a number \(y\) which is smaller than \(x\text{.}\)” We see that this is another way to make our original claim.
Example 3.1.9.
Can you switch the order of quantifiers? For example, consider the two statements:
Are these logically equivalent?
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 \lt y\text{.}\) 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 not a natural number \(y\) which is greater than every number \(x\text{.}\) 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)\text{,}\) then certainly for every \(x\) there is some \(y\) which satisfies \(P(x,y)\text{.}\) The first is saying we can find one \(y\) that works for every \(x\text{.}\) The second allows different \(y\)'s to work for different \(x\)'s, but there is nothing preventing us from using the same \(y\) that work for every \(x\text{.}\) 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)\)  
\(\therefore\)  \(\forall x \exists y P(x,y)\) 
Put yet another way, this says that the single statement
is always true. This is sort of like 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).
Exercises Exercises
1.
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\text{.}\)
Make a truth table for the statement.
Assuming the statement is true, what (if anything) can you conclude if there will be cake?
Assuming the statement is true, what (if anything) can you conclude if there will not be cake?
Suppose you found out that the statement was a lie. What can you conclude?
 \(P\text{:}\) it's your birthday; \(Q\text{:}\) there will be cake. \((P \vee Q) \imp Q\)
Hint: you should get three T's and one F.
Only that there will be cake.
It's NOT your birthday!
It's your birthday, but the cake is a lie.
2.
Make a truth table for the statement \((P \vee Q) \imp (P \wedge Q)\text{.}\)
\(P\)  \(Q\)  \((P \vee Q) \imp (P \wedge Q)\) 
T  T  T 
T  F  F 
F  T  F 
F  F  T 
3.
Make a truth table for the statement \(\neg P \wedge (Q \imp P)\text{.}\) What can you conclude about \(P\) and \(Q\) if you know the statement is true?
\(P\)  \(Q\)  \(\neg P \wedge (Q \imp P)\) 
T  T  F 
T  F  F 
F  T  F 
F  F  T 
If the statement is true, then both \(P\) and \(Q\) are false.
4.
Make a truth table for the statement \(\neg P \imp (Q \wedge R)\text{.}\)
Like above, only now you will need 8 rows instead of just 4.
5.
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 truthteller (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?
You should write down three statements using the symbols \(P, Q, R, S\text{.}\) If Geoff is a truthteller, 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 is probably not entirely necessary.
6.
Determine whether the following two statements are logically equivalent: \(\neg(P \imp Q)\) and \(P \wedge \neg Q\text{.}\) Explain how you know you are correct.
Make a truth table for each and compare. The statements are logically equivalent.
7.
Are the statements \(P \imp (Q\vee R)\) and \((P \imp Q) \vee (P \imp R)\) logically equivalent?
8.
Simplify the following statements (so that negation only appears right before variables).
 \(\neg(P \imp \neg Q)\text{.}\)
 \((\neg P \vee \neg Q) \imp \neg (\neg Q \wedge R)\text{.}\)
 \(\neg((P \imp \neg Q) \vee \neg (R \wedge \neg R))\text{.}\)
It is false that if Sam is not a man then Chris is a woman, and that Chris is not a woman.
 \(P \wedge Q\text{.}\)
 \((\neg P \vee \neg R) \imp (Q \vee \neg R)\) or, replacing the implication with a disjunction first: \((P \wedge Q) \vee (Q \vee \neg R)\text{.}\)
\((P \wedge Q) \wedge (R \wedge \neg R)\text{.}\) This is necessarily false, so it is also equivalent to \(P \wedge \neg P\text{.}\)
Either Sam is a woman and Chris is a man, or Chris is a woman.
9.
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\text{,}\) \(Q\text{,}\) \(E(x)\text{,}\) etc.), and no double negations. It would be a good idea to use only conjunctions, disjunctions, and negations.
 \(\neg((\neg P \wedge Q) \vee \neg(R \vee \neg S))\text{.}\)
 \(\neg((\neg P \imp \neg Q) \wedge (\neg Q \imp 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.
10.
Consider the statement, “If a number is triangular or square, then it is not prime”
Make a truth table for the statement \((T \vee S) \imp \neg P\text{.}\)
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.
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\text{,}\) \(S\text{,}\) and \(P\) are there.
You are looking for a row in which \(P\) is true, and the whole statement is true.
11.
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 worlds 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.
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.)
12.
Determine if the following deduction rule is valid:
\(P \vee Q\)  
\(\neg P\)  
\(\therefore\)  \(Q\) 
The deduction rule is valid. To see this, make a truth table which contains \(P \vee Q\) and \(\neg P\) (and \(P\) and \(Q\) of course). Look at the truth value of \(Q\) in each of the rows that have \(P \vee Q\) and \(\neg P\) true.
13.
Determine if the following is a valid deduction rule:
\(P \imp (Q \vee R)\)  
\(\neg(P \imp Q)\)  
\(\therefore\)  \(R\) 
14.
Determine if the following is a valid deduction rule:
\((P \wedge Q) \imp R\)  
\(\neg P \vee \neg Q\)  
\(\therefore\)  \(\neg R\) 
15.
Can you chain implications together? That is, if \(P \imp Q\) and \(Q \imp R\text{,}\) does that means the \(P \imp R\text{?}\) Can you chain more implications together? Let's find out:

Prove that the following is a valid deduction rule:
\(P \imp Q\) \(Q \imp R\) \(\therefore\) \(P \imp R\) 
Prove that the following is a valid deduction rule for any \(n \ge 2\text{:}\)
\(P_1 \imp P_2\) \(P_2 \imp P_3\) \(\vdots\) \(P_{n1} \imp P_n\) \(\therefore\) \(P_1 \imp P_n\text{.}\) I suggest you don't go through the trouble of writing out a \(2^n\) row truth table. Instead, you should use part (a) and mathematical induction.
For the second part, you can inductively assume that from the first \(n2\) implications you can deduce \(P_1 \imp P_{n1}\text{.}\) Then you are back in the case in part (a) again.
16.
We can also simplify statements in predicate logic using our rules for passing negations over quantifiers, and then applying propositional 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) \vee E(y))\text{.}\)
 \(\neg \forall x \neg \forall y \neg(x \lt y \wedge \exists z (x \lt z \vee y \lt z))\text{.}\)
There is a number \(n\) for which no other number is either less \(n\) than or equal to \(n\text{.}\)
It is false that for every number \(n\) there are two other numbers which \(n\) is between.
 \(\forall x \exists y (O(x) \wedge \neg E(y))\text{.}\)
 \(\exists x \forall y (x \ge y \vee \forall z (x \ge z \wedge y \ge z))\text{.}\)
There is a number \(n\) for which every other number is strictly greater than \(n\text{.}\)
There is a number \(n\) which is not between any other two numbers.
17.
Simplify the statements below to the point that negation symbols occur only directly next to predicates.
\(\neg \forall x \forall y (x \lt y \vee y \lt x)\text{.}\)
\(\neg(\exists x P(x) \imp \forall y P(y))\text{.}\)
18.
Simplifying negations will be especially useful in the next section 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\text{,}\) if \(n\) is prime, then \(n+3\) is not prime.
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) \wedge \neg O(x))\text{,}\) for the first one, for example. Then translate this back into English.
19.
Suppose \(P\) and \(Q\) are (possibly molecular) propositional statements. Prove that \(P\) and \(Q\) are logically equivalent if any only if \(P \iff Q\) is a tautology.
What do these concepts mean in terms of truth tables?
20.
Suppose \(P_1, P_2, \ldots, P_n\) and \(Q\) are (possibly molecular) propositional statements. Suppose further that
\(P_1\)  
\(P_2\)  
\(\vdots\)  
\(P_n\)  
\(\therefore\)  \(Q\) 
is a valid deduction rule. Prove that the statement
is a tautology.