Programming Language Theory ConceptMathematical inductionProperties 3Hide BooksChapter 2. Inductive definitions JourneyProgramming Language Theory StatuslearningFormally, assume n nat means that n is a natural number. To prove that whenever n nat, we have 𝒫(n), it's sufficient to show that:𝒫(zero).For every n such that n nat, if 𝒫(n) then 𝒫(succ(n)). Previous in ConceptsMatch armNext in Concepts Meet