Skip to main content\( \newcommand{\identity}{\mathrm{id}}
\newcommand{\notdivide}{{\not{\mid}}}
\newcommand{\notsubset}{\not\subset}
\newcommand{\lcm}{\operatorname{lcm}}
\newcommand{\gf}{\operatorname{GF}}
\newcommand{\inn}{\operatorname{Inn}}
\newcommand{\aut}{\operatorname{Aut}}
\newcommand{\Hom}{\operatorname{Hom}}
\newcommand{\cis}{\operatorname{cis}}
\newcommand{\chr}{\operatorname{char}}
\newcommand{\Null}{\operatorname{Null}}
\def\Z{\mathbb Z}
\def\R{\mathbb R}
\def\Q{\mathbb Q}
\def\N{\mathbb N}
\def\C{\mathbb C}
\def\W{\mathbb W}
\def\ba{{\mathbf{a}}}
\def\bb{\mathbf{b}}
\def\bh{{\mathbf{h}}}
\def\bu{{\mathbf{u}}}
\def\bv{{\mathbf{v}}}
\def\bw{{\mathbf{w}}}
\def\bx{{\mathbf{x}}}
\def\by{\mathbf{y}}
\def\bone{{\mathbf{1}}}
\def\bzero{\mathbf{0}}
\def\var{{\mbox{var}}}
\def\P{{\mathbb{P}}}
\def\E{{\mathbb{E}}}
\def\cA{{\mathcal{A}}}
\def\cB{{\mathcal{B}}}
\def\cC{{\mathcal{C}}}
\def\cP{\mathcal P}
\def\cN{\mathcal N}
\def\cE{\mathcal E}
\def\cO{\mathcal O}
\def\cF{\mathcal F}
\def\cX{\mathcal X}
\def\nimsum{\, \oplus \,}
\def\mex{{\mathrm{mex}}}
\newcommand{\pile}[1]{\bullet{#1}}
\def\g{g}
\def\kin{k^{\mathrm{in}}}
\def\kout{k^{\mathrm{out}}}
\newcommand{\indeg}[1]{k^{\mathrm{in}}_{#1}}
\newcommand{\outdeg}[1]{k^{\mathrm{out}}_{#1}}
\tikzset{->-/.style={decoration={
markings,
mark=at position .5 with {\arrow{latex}}},postaction={decorate}}}
\newcommand{\nimbleboard}[1]{
\begin{scope}[shift={(.25, .4)}]
\draw (0,-.3) -- (#1,-.3) -- (#1+.45, .7) -- (#1+.45, 1);
\draw (0,0) -- (#1,0);
\draw (.45,1) -- (#1+.45,1);
\foreach \i in {0, ..., #1} {
\draw (\i, -.3) -- (\i, 0) -- (\i+.45,1);
}
\foreach \i in {1, ..., #1} {
\node[style={font=\sffamily\scriptsize}] at (\i - .5, -.15) {\i};
}
\end{scope}
}
\newcommand{\coin}[1]{
\begin{scope}[shift={#1}]
\draw[color=white, fill=white] (-.4, 0) -- (-.4, -.1) -- (.4,-.1) -- (.4,0) -- cycle;
\draw[thick, fill=white] (0,0) ellipse (0.4 and 0.10);
\draw[thick, fill=white] (.4,-.1) arc (0:-180:0.4 and 0.10);
\draw[thick] (0.4,0) -- (0.4, -.1);
\draw[thick] (-0.4,0) -- (-0.4, -.1);
\end{scope}
}
\newcommand{\bean}[2]{
\begin{scope}[shift={#1}, rotate={#2}]
\draw [very thick, fill=gray!50] plot [smooth cycle] coordinates {(-.2,0) (-.175, .07) (-.1,.1) (0,.075) (.1,.1) (.175, .07) (.2,0) (.15, -.07) (0,-.1) (-.15, -.07)};
\end{scope}
}
\newcommand{\heap}[2]{
\begin{scope}[shift={#1}]
\draw[very thick] (0,0) circle ({#2});
\end{scope}
}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\)
Chapter 3 Logical Connectors
Exercises Practice Problems
1. Statements.
Consider the following two statements:
Express the following statements in words.
\(\displaystyle P \vee Q\)
\(\displaystyle (\neg P) \wedge Q\)
\(\displaystyle (\neg P) \Rightarrow Q\)
\(\displaystyle P \Rightarrow (\neg Q)\)
2. Implications.
Each of the following statements is an implication \(P \Rightarrow Q\text{.}\) For each statement, indicate what \(P\) and \(Q\) are, then rephrase the statment as "if \(P\) then \(Q\text{.}\)"
(Hint: an implication \(P \Rightarrow Q\) is only false when \(P\) is true and \(Q\) is false. Thus, it may help you to imagine what it would mean for each of these statements to be false.)
I think, therefore I am.
You can drive from Minneapolis to Madison if your car has a full tank of gas.
I’m only going to my class reunion if I get a promotion at work.
I will take you to the pool as long as you do your afternoon chores.
Passing Linear Algebra is necessary to register for Algebraic Structures.
3. Two Truth Tables.
-
Fill in this truth table.
\begin{equation*}
\begin{array}{c|c|c|c}
P & Q & P \wedge Q & \neg (P \wedge Q) \\
\hline
T & T & & \\
T & F & & \\
F & T & & \\
F & F & & \\
\end{array}
\end{equation*}
-
Now fill in this truth table.
\begin{equation*}
\begin{array}{c|c|c|c|c}
P & Q & \neg P & \neg Q & \neg P \vee \neg Q \\
\hline
T & T & & & \\
T & F & & & \\
F & T & & & \\
F & F & & & \\
\end{array}
\end{equation*}
Look at the last column of each of the two tables above. What do you conclude? Write a mathematical statement (using symbols) that summarizes your observation.
4. Truth Table for \(\neg (P \vee Q)\).
Fill in the following truth table. Using the previous problems as inspiration, find another compound statement that is equivalent to \(\neg (P \vee Q)\text{.}\) Add columns to your truth table to show that you are correct.
\begin{equation*}
\begin{array}{c|c|c|c}
P & Q & P \vee Q & \neg (P \vee Q) \\
\hline
T & T & & \\
T & F & & \\
F & T & & \\
F & F & & \\
\end{array}
\end{equation*}
5. The Effect of Negation.
Look back at the last two problems. What is the effect of negation on the AND operator? The OR operator?