Boundedness theorems for dilators and ptykes

Annals of Pure and Applied Logic 52 (1-2):79-92 (1991)
  Copy   BIBTEX

Abstract

The main theorem of this paper is: If ƒ is a partial function from 1 to 1 which is ∑11-bounded, then there is a weakly finite primitive recursive dilatorD such that for all infinite αεdom, ƒ D. The proof involves only elementary combinatorial constructions of trees. A generalization to ptykes is also given.

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(91)90040-s

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,369

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

Boundedness theorems for dilators and ptykes.Alexander S. Kechris - 1991 - Annals of Pure and Applied Logic 52 (1-2):79-92.
A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.
An isolic generalization of Cauchy's theorem for finite groups.J. C. E. Dekker - 1990 - Archive for Mathematical Logic 29 (4):231-236.
A proof-theoretical analysis of ptykes.J. R. G. Catlow - 1994 - Archive for Mathematical Logic 33 (1):57-79.
Decomposing Borel functions and structure at finite levels of the Baire hierarchy.Janusz Pawlikowski & Marcin Sabok - 2012 - Annals of Pure and Applied Logic 163 (12):1748-1764.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
Non-primitive recursive decidability of products of modal logics with expanding domains.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2006 - Annals of Pure and Applied Logic 142 (1):245-268.
A bounded arithmetic AID for Frege systems.Toshiyasu Arai - 2000 - Annals of Pure and Applied Logic 103 (1-3):155-199.
Reverse mathematics and well-ordering principles: A pilot study.Bahareh Afshari & Michael Rathjen - 2009 - Annals of Pure and Applied Logic 160 (3):231-237.

Analytics

Added to PP
2017-02-19

Downloads
10 (#1,477,106)

6 months
7 (#730,543)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.

Add more citations

References found in this work

Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75-219.

Add more references