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

We’ll use logical statements to represent:

premises: claims that we will assume to be true before we start to reason,
conclusions: claims that we want to prove to be true, and
intermediate results that we may derive along the way from premises to conclusions.

We are going to define two specific logical statement languages. (We’ll call one Boolean logic and one Predicate Logic.) While there are limits to what these languages can straightforwardly represent, they are powerful enough to represent many useful kinds of claims.