Skip to main content
Contents Index
Search Book
Search Results:
No results.
Readability settings Prev Up Next \(\require{cancel}
\newcommand{\nth}[1][n]{{#1}^{\mathrm{th}}}
\newcommand{\bbrac}[1]{\bigl(#1\bigr)}
\newcommand{\Bbrac}[1]{\Bigl(#1\Bigr)}
\newcommand{\correct}{\boldsymbol{\checkmark}}
\newcommand{\incorrect}{\boldsymbol{\times}}
\newcommand{\inv}[2][1]{{#2}^{-{#1}}}
\newcommand{\leftsub}[3][1]{\mathord{{}_{#2\mkern-#1mu}#3}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\I}{\mathbb{I}}
\newcommand{\abs}[1]{\left\lvert #1 \right\rvert}
\DeclareMathOperator{\sqrtop}{sqrt}
\newcommand{\lgcnot}{\neg}
\newcommand{\lgcand}{\wedge}
\newcommand{\lgcor}{\vee}
\newcommand{\lgccond}{\rightarrow}
\newcommand{\lgcbicond}{\leftrightarrow}
\newcommand{\lgcimplies}{\Rightarrow}
\newcommand{\lgcequiv}{\Leftrightarrow}
\newcommand{\lgctrue}{\mathrm{T}}
\newcommand{\lgcfalse}{\mathrm{F}}
\newcommand{\boolnot}[1]{{#1}'}
\newcommand{\boolzero}{\mathbf{0}}
\newcommand{\boolone}{\mathbf{1}}
\newcommand{\setdef}[2]{\left\{\mathrel{}#1\mathrel{}\middle|\mathrel{}#2\mathrel{}\right\}}
\newcommand{\inlinesetdef}[2]{\{\mathrel{}#1\mathrel{}\mid\mathrel{}#2\mathrel{}\}}
\let\emptyword\emptyset
\renewcommand{\emptyset}{\varnothing}
\newcommand{\relcmplmnt}{\smallsetminus}
\newcommand{\union}{\cup}
\newcommand{\intersection}{\cap}
\newcommand{\cmplmnt}[1]{{#1}^{\mathrm{c}}}
\newcommand{\disjunion}{\sqcup}
\newcommand{\cartprod}{\times}
\newcommand{\words}[1]{{#1}^\ast}
\newcommand{\length}[1]{\abs{#1}}
\newcommand{\powsetbare}{\mathcal{P}}
\newcommand{\powset}[1]{\powsetbare(#1)}
\newcommand{\funcdef}[4][\to]{#2\colon #3 #1 #4}
\newcommand{\ifuncto}{\hookrightarrow}
\newcommand{\ifuncdef}[3]{\funcdef[\ifuncto]{#1}{#2}{#3}}
\newcommand{\sfuncto}{\twoheadrightarrow}
\newcommand{\sfuncdef}[3]{\funcdef[\sfuncto]{#1}{#2}{#3}}
\newcommand{\funcgraphbare}{\Delta}
\newcommand{\funcgraph}[1]{\funcgraphbare(#1)}
\newcommand{\nmathrel}[1]{\mathrel{\not #1}}
\newcommand{\relset}[3]{#1_{{} #2 #3}}
\newcommand{\gtset}[2]{\relset{#1}{\gt}{#2}}
\newcommand{\posset}[1]{\gtset{#1}{0}}
\newcommand{\geset}[2]{\relset{#1}{\ge}{#2}}
\newcommand{\nnegset}[1]{\geset{#1}{0}}
\newcommand{\neqset}[2]{\relset{#1}{\neq}{#2}}
\newcommand{\nzeroset}[1]{\neqset{#1}{0}}
\newcommand{\ltset}[2]{\relset{#1}{\lt}{#2}}
\newcommand{\leset}[2]{\relset{#1}{\le}{#2}}
\newcommand{\natnumlt}[1]{\ltset{\N}{#1}}
\DeclareMathOperator{\id}{id}
\newcommand{\inclfunc}[2]{\iota_{#1}^{#2}}
\newcommand{\projfunc}[1]{\rho_{#1}}
\DeclareMathOperator{\proj}{proj}
\newcommand{\funcres}[2]{\left.{#1}\right\rvert_{#2}}
\newcommand{\altfuncres}[2]{\left.{#1}\right\rvert{#2}}
\DeclareMathOperator{\res}{res}
\DeclareMathOperator{\flr}{flr}
\newcommand{\floor}[1]{\lfloor {#1} \rfloor}
\newcommand{\funccomp}{\circ}
\newcommand{\funcinvimg}[2]{\inv{#1}\left({#2}\right)}
\newcommand{\card}[1]{\left\lvert #1 \right\rvert}
\DeclareMathOperator{\cardop}{card}
\DeclareMathOperator{\ncardop}{\#}
\newcommand{\EngAlphabet}{\{ \mathrm{a}, \, \mathrm{b}, \, \mathrm{c}, \, \dotsc, \, \mathrm{y}, \, \mathrm{z} \}}
\newcommand{\ShortEngAlphabet}{\{ \mathrm{a}, \, \mathrm{b}, \, \dotsc, \, \mathrm{z} \}}
\newcommand{\eqclass}[1]{\left[#1\right]}
\newcommand{\partorder}{\preceq}
\newcommand{\partorderstrict}{\prec}
\newcommand{\npartorder}{\npreceq}
\newcommand{\subgraph}{\preceq}
\newcommand{\subgraphset}[1]{\mathcal{S}(#1)}
\newcommand{\connectedsubgraphset}[1]{\mathcal{C}(#1)}
\newcommand{\permcomb}[3]{{#1}(#2,#3)}
\newcommand{\permcombalt}[3]{{#1}^{#2}_{#3}}
\newcommand{\permcombaltalt}[3]{{\leftsub{#2}{#1}}_{#3}}
\newcommand{\permutation}[2]{\permcomb{P}{#1}{#2}}
\newcommand{\permutationalt}[2]{\permcombalt{P}{#1}{#2}}
\newcommand{\permutationaltalt}[2]{{\permcombaltalt{P}{#1}{#2}}}
\newcommand{\combination}[2]{\permcomb{C}{#1}{#2}}
\newcommand{\combinationalt}[2]{\permcombalt{C}{#1}{#2}}
\newcommand{\combinationaltalt}[2]{{\permcombaltalt{C}{#1}{#2}}}
\newcommand{\choosefuncformula}[3]{\frac{#1 !}{#2 ! \, #3 !}}
\DeclareMathOperator{\matrixring}{M}
\newcommand{\uvec}[1]{\mathbf{#1}}
\newcommand{\zerovec}{\uvec{0}}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Exercises 1.6 Exercises
1.
Let \(p \text{,}\) \(q \text{,}\) and \(r \) represent the following statements.
\begin{align*}
p\colon\quad \amp \text{The game is on.} \\
q\colon\quad \amp \text{The popcorn is ready.} \\
r\colon\quad \amp \text{Joe is happy.}
\end{align*}
Suppose the following compound statement is true.
If the game is on and the popcorn is ready, then Joe is happy.
However, you just visited Joe’s residence room and found that Joe is unhappy even though the game is on. What can you conclude about the popcorn? Use a truth table to justify your answer.
2. Consider the logical statement
\((p \lgcand q_1) \lgccond (q_1 \lgcor q_2) \text{.}\) Partially translated, this statement says:
if
\(p \) and
\(q_1 \) are both true, then at least one of
\(q_1 \) and
\(q_2 \) is true.
Would you expect this statement to be a tautology? … a contradiction? … neither?
Use a truth table to check.
3.
The wizard Hatty Porrer is studying logic at Cowpimples School for Second-Rate Wizards. As an exercise, he is filling out the truth table for the conditional
\begin{equation*}
(r \lgcand s) \lgccond (r \lgcor s) \text{.}
\end{equation*}
But he forgets what to do for the lines where the “if” part of the conditional evaluates to false, so he only gets this far:
\(r \) \(s \) \(r \lgcand s \) \(r \lgcor s \) \((r \lgcand s) \lgccond (r \lgcor s) \)
\(\lgctrue \) \(\lgctrue \) \(\lgctrue \) \(\lgctrue \) \(\lgctrue \)
\(\lgctrue \) \(\lgcfalse \) \(\lgcfalse \) \(\lgctrue \) ?
\(\lgcfalse \) \(\lgctrue \) \(\lgcfalse \) \(\lgctrue \) ?
\(\lgcfalse \) \(\lgcfalse \) \(\lgcfalse \) \(\lgcfalse \) ?
(a) Help Hatty out by finishing his homework for him.
(b) While you were filling out the truth table, Hatty got bored and opened up a portal to a parallel universe. Parallel Hatty is also working on the same truth table, and is stuck at the same spot that normal Hatty was. However, you notice that parallel Hatty’s textbook is open to the page with the truth table for the basic conditional
\(p \lgccond q \text{,}\) and it looks as follows.
\(p \) \(q \) \(p \lgccond q \)
\(\lgctrue \) \(\lgctrue \) \(\lgctrue \)
\(\lgctrue \) \(\lgcfalse \) \(\lgcfalse \)
\(\lgcfalse \) \(\lgctrue \) \(\lgcfalse \)
\(\lgcfalse \) \(\lgcfalse \) \(\lgctrue \)
Finish parallel Hatty’s homework exercise. Make sure parallel Hatty’s instructor will like the result!
(c) While you were finishing parallel Hatty’s homework, Hatty got bored again and opened up a portal to
another parallel universe! Parallel Hatty number two is also working on the same truth table, and is stuck at the same spot that the previous two Hattys were. This time, however, parallel Hatty number two’s textbook says that the truth table for the basic conditional
\(p \lgccond q \) is as follows.
\(p \) \(q \) \(p \lgccond q \)
\(\lgctrue \) \(\lgctrue \) \(\lgctrue \)
\(\lgctrue \) \(\lgcfalse \) \(\lgcfalse \)
\(\lgcfalse \) \(\lgctrue \) \(\lgctrue \)
\(\lgcfalse \) \(\lgcfalse \) \(\lgcfalse \)
Finish parallel Hatty number two’s homework exercise. Make sure parallel Hatty number two’s instructor will approve!
(d) You’ll never believe what happened while you were finishing parallel Hatty number two’s homework! Yep, Hatty got bored again and opened up a portal to
a third parallel universe. Parallel Hatty number three is also working on the same truth table, and is stuck at the same spot that the previous three Hattys were. The truth table for the basic conditional
\(p \lgccond q \) is different in parallel Hatty number three’s universe, yet again.
\(p \) \(q \) \(p \lgccond q \)
\(\lgctrue \) \(\lgctrue \) \(\lgctrue \)
\(\lgctrue \) \(\lgcfalse \) \(\lgcfalse \)
\(\lgcfalse \) \(\lgctrue \) \(\lgcfalse \)
\(\lgcfalse \) \(\lgcfalse \) \(\lgcfalse \)
Finish parallel Hatty number three’s homework exercise. Make sure parallel Hatty number three’s instructor will give him full marks!
(e) OK, so what the heck is the point of all this? The statement
\((r \lgcand s) \lgccond (r \lgcor s) \) could be read as:
If
\(r \) and
\(s \) are both true statements, then at least one of
\(r \) and
\(s \) is a true statement.
This conditional statement seems “obviously true”. Based on this example, what do you think of each parallel universe’s system of logic compared to our own?
4.
Suppose
\(A,E,U \) are logical statements such that
\(U \) is a tautology and
\(E \) is a contradiction.
(a) Show that
\(A \lgcor U \) is always a tautology.
(b) Show that
\(A \lgcand E \) is always a contradiction.
5. Suppose that
\(A \text{,}\) \(B \text{,}\) and
\(C \) are logical statements such that
\(A \lgcimplies B \) and
\(B \lgcimplies C \text{.}\) Must
\(A \lgcimplies C \text{?}\)
