Abstract
In this chapter, we want to demonstrate how inductive definitions, as discussed in Chapter 4, can be applied to prove properties of all elements from an inductively defined set, for example, to prove that all Boolean terms can be converted into an equivalent but syntactically specific form. When the property that we wish to show for all elements of an inductively defined set is also defined in terms of this inductive structure, such proofs are often quite elegant.
Induction: A tool for mastering infinities through finite means.
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
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Steffen, B., Rüthing, O., Huth, M. (2018). Inductive Proofs. In: Mathematical Foundations of Advanced Informatics. Springer, Cham. https://doi.org/10.1007/978-3-319-68397-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-68397-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68396-6
Online ISBN: 978-3-319-68397-3
eBook Packages: Computer ScienceComputer Science (R0)