Abstract
We already frequently used inductive definitions during this lecture. We used it to define terms, formulas, derivations in formal and infinitary systems and also other concepts. Inductive definitions, however, are not only used in mathematical logic but are ubiquitous in mathematics. Whenever we define a set as the least set which comprehends a given set and is closed under certain operations, we use an inductive definition. One of the simplest examples is the subspace <A> of a vector space V generated by a set A⊂V. <A> is defined as the smallest set which comprehends A and itself is a vector space, i.e. is closed under addition and scalar multiplication. This does not look like an inductive definition as we are used to. But we also may put it into the more familiar form of a definition by clauses:


where K denotes the ground field.
Keywords
- Induction Hypothesis
- Monotone Operator
- Notation System
- Ordinal Analysis
- Derivation Tree
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.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1989). Ordinal analysis of the formal theory for noniterated inductive definitions. In: Proof Theory. Lecture Notes in Mathematics, vol 1407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46825-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-46825-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51842-6
Online ISBN: 978-3-540-46825-7
eBook Packages: Springer Book Archive
