Mathematical Induction

  • David Gries
  • Fred B. Schneider
Chapter
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

The set ℕ of natural numbers {0, 1, 2,...} is infinite Proving properties of such an infinite set often requires a technique that is of fundamental importance in mathematics and computer science: mathematical induction. We explore this technique in this chapter. We also investigate induction over sets other than ℕ. We show how properties of an inductively defined function can be proved using induction, and we show how a loop can be analyzed using induction.

Keywords

Natural Number Base Case Inductive Hypothesis Binary Tree Minimal Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • David Gries
    • 1
  • Fred B. Schneider
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations