Abstract
We are free to invent new syntax and rules for its use, as long as the new syntax and rules do not conflict with those already in use. In this section we are concerned with the definition of infinite bunches. Our first example is nat, the natural numbers. We have been using this syntax, but we have not yet defined it formally. Let us pretend we have not seen it before, and define it now. To do so requires axioms called construction and induction.
This is a preview of subscription content, log in via an institution to check access.
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
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Hehner, E.C.R. (1993). Recursive Definition. In: A Practical Theory of Programming. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8596-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8596-5_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6444-6
Online ISBN: 978-1-4419-8596-5
eBook Packages: Springer Book Archive