Abstract
In this chapter we present some induction techniques that will turn out to be useful for proving formal properties of the languages and models presented in the book. We start by introducing Noether’s principle of well-founded induction, from which we then derive induction principles over natural numbers, terms of a signature and derivations in a logical system. The chapter ends by presenting well-founded recursion.
To understand recursion, you must first understand recursion. (traditional joke)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bruni, R., Montanari, U. (2017). Induction and Recursion. In: Models of Computation. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-42900-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-42900-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42898-7
Online ISBN: 978-3-319-42900-7
eBook Packages: Computer ScienceComputer Science (R0)