Subsection 4.1.6 We Inherit the Boolean Operators
We can build more complex wffs by applying any of the Boolean operators to one or more simpler wffs.
Examples of wffs:
\(\neg\) Bear(Smokey) A statement.
Bear(Smokey) Bear(Snowflake) A statement.
Bear(x) \(\rightarrow \) HasTail(x) Not a statement because of unbound variable x.
As we use the Boolean operators to build larger wffs from smaller ones, we can use parentheses to group operators, just as we did in Boolean logic.
Here are two examples that use parentheses:
[4] (Bear(Smokey) \(\wedge \) Bear(Snowflake)) \(\vee \) Deer(Bambi)
[5] Bear(Smokey) \(\wedge \) (Bear(Snowflake) \(\vee \) Deer(Bambi))
Note that these two expressions are different. Because the two operators are different, parentheses matter. It’s possible for one of these statements to be true and the other to be false.
Now suppose that we want to write an expression that contains many terms, all of them connected with the same operator (either and or or). For example, we might write:
[6] ((Bear(Smokey) ∧ Bear(Snowflake)) ∧ Bear(Ling Ling)) ∧ Bear(Tai Shan)
We’ve been careful here (and in all our examples up until now) to use parentheses to indicate how the operators should be grouped, even though we know that Boolean and is associative. Grouping doesn’t matter. We’ve proved that claim in the case of two ands (and three operands). So we have that:
(p ∧ q) ∧ r is equivalent to p ∧ (q ∧ r )
We’ll see later that it is straightforward (using a proof technique called induction) to prove the extension of that result to any number of operators. So, in the case where all the operators are the same, parenthesization doesn’t matter. However, we’ll continue to indicate a particular parenthesization until we are more confident of what we are doing.
Exercises Exercises
Exercise Group.
1. For each of the following expressions, indicate whether or not it is a wff:
1.
Bear(Smokey) ∧ ¬¬Deer(Bambi)
True
False
2.
Prime(269) ∧ ∨ Prime(270)
True
False
3.
(Prime(269) ∨ Prime(270)) ∨ (Prime(271) ∨ Prime(272))
True
False
4.
Prime(age(Smokey))
True
False
Exercise Group.
2. Let’s return to our example claims [4] and [5]:
(Bear(Smokey) ∧ Bear(Snowflake)) ∨ Deer(Bambi)
Bear(Smokey) ∧ (Bear(Snowflake) ∨ Deer(Bambi))
Recall that the difference between them is the way that parentheses are used to group subexpressions.
Consider the following situations:
I. Smokey, Snowflake and Bambi are all deer.
II. Smokey is a bear. Snowflake is a deer. Bambi is a bear.
III. Smokey is a deer. Snowflake is a deer. Bambi is a bear.
IV. Smokey is a deer. Snowflake is a bear. Bambi is a deer.
1.
(Part 1) Consider just claim [4]. For each of the four situations, indicate whether it makes claim [4] true or false:
Situation I
Situation II
Situation III
Situation IV
2.
(Part 2) Consider just claim [5]. For each of the four situations, indicate whether it makes claim [5] true or false:
Situation I
Situation II
Situation III
Situation IV