Keywords
- Function Symbol
- Recursive Function
- Mathematical Induction
- Logical Inference
- Ordinal Diagram
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.
References
G. Gentzen, Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie, Math. Ann., 119 (1943), 140–161.
A. Kino, On provably recursive functions and ordinal recursive functions, to appear in J. Math. Soc. Japan.
G. Kreisel, Mathematical Logic, Lectures on Modern Mathematics, vol. III, 95–195, New York, 1965.
K. Schütte, Beweistheorie, Springer, 1960.
G. Takeuti, A remark on Gentzen's paper ‘Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie', I, II, Proc. Japan Acad., 39 (1963), 263–269.
G. Takeuti, Consistency proofs of subsystems of classical analysis, Ann. of Math., 86 (1967), 299–348.
G. Takeuti and M. Yasugi, Reflection principles of subsystems of analysis, to appear.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1968 Springer-Verlag
About this paper
Cite this paper
Takeuti, G. (1968). The Π 11 -comprehension schema and ω-rules. In: Löb, M.H. (eds) Proceedings of the Summer School in Logic Leeds, 1967. Lecture Notes in Mathematics, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079103
Download citation
DOI: https://doi.org/10.1007/BFb0079103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04240-2
Online ISBN: 978-3-540-35886-2
eBook Packages: Springer Book Archive
