Applications of cut-free infinitary derivations to generalized recursion theory

&
Annals of Pure and Applied Logic 94 (1-3):7-19 (1998)
  Copy   BIBTEX

Abstract

We prove that the boundedness theorem of generalized recursion theory can be derived from the ω-completeness theorem for number theory. This yields a proof of the boundedness theorem which does not refer to the analytical hierarchy theorem

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00063-8

Other Versions

reprint Beckmann, Arnold; Pohlers, Wolfram (2000) "Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory". Bulletin of Symbolic Logic 6(2):221-222

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,586

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Arnold Beckmann and Wolfram Pohlers. Applications of cut-free infinitary derivations to generalized recursion theory. Annals of pure and applied logic, vol. 94 , pp. 7–19. [REVIEW]Dag Normann - 2000 - Bulletin of Symbolic Logic 6 (2):221-222.
A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.
The uniform boundedness theorem and a boundedness principle.Hajime Ishihara - 2012 - Annals of Pure and Applied Logic 163 (8):1057-1061.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
Omitting types for infinitary [ 0, 1 ] -valued logic.Christopher J. Eagle - 2014 - Annals of Pure and Applied Logic 165 (3):913-932.
Fixed point theorems for precomplete numberings.Henk Barendregt & Sebastiaan A. Terwijn - 2019 - Annals of Pure and Applied Logic 170 (10):1151-1161.
Herbrand's theorem as higher order recursion.Bahareh Afshari, Stefan Hetzl & Graham E. Leigh - 2020 - Annals of Pure and Applied Logic 171 (6):102792.

Analytics

Added to PP
2014-01-16

Downloads
48 (#508,465)

6 months
2 (#1,364,362)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wolfram Pohlers
University of Muenster

Citations of this work

An Incompleteness Theorem Via Ordinal Analysis.James Walsh - 2024 - Journal of Symbolic Logic 89 (1):80-96.
Dynamic ordinal analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.

Add more citations

References found in this work

No references found.

Add more references