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 2.1.1 Introduction

Boolean logic is simple. It’s useful. (For example, computer circuits implement Boolean logic.) And most other logical frameworks have it at their core. So it is a good place for us to start.

Boolean logic gets its name from George Boole, a nineteenth century British logician.

You may also sometimes see Boolean logic called sentential calculus, propositional logic or 0th order logic.

There is a natural analogy between Boolean logic and the systems of arithmetic and algebra with which you are already familiar. You’ll see this analogy emerge as we go along, starting on the next page.