Discrete Mathematics: Chapter 3, Mathematical Induction and Peano Arithmetic

Calvin Jongsma · Dordt Digital Collections (Dordt College) · 2016

In this chapter we will study one more very important proof technique along with some variants, and we will consider their counterparts for making mathematical definitions. This connects up with ideas that are central in computer science, too. As we proceed, we will briefly pause to look at how arithmetic can be treated as a deductive theory. This material will give us a good basis for working with natural numbers later in the text.

Read the paper · More papers on PaperTik