Introduction

$\newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \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\,}$}}} $

Subsection 3.1.1 Introduction

We now have a good deal of experience at using Boolean logic to represent various kinds of things that we might know. But the holy grail, or pot of gold at the end of the rainbow, or jackpot (or whatever metaphor you prefer) isn’t representation just for its own sake.

We want to learn new things. We want to derive new claims that must be true given what we already know

We do this by constructing proofs. In this section we’ll learn two techniques for constructing Boolean logic proofs.