MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Bar recursive encodings of tree ordinals

Download:
Download as a PDF | Download as a PS
by Marc Bezem, Wilfried Buchholz
ftp://ftp.phil.ruu.nl/logic/PREPRINTS/preprint68.ps.Z
Add To MetaCart

Abstract:

We ask the attention for a definition schema from higher order subrecursion theory called bar recursion. Bar recursion originates with Spector [12], where bar recursion of all finite types is shown to characterize the class of provably total recursive

Citations

231 Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur – Girard - 1972
91 Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts – Gödel
47 Interpretation of analysis by means of constructive functionals of finite types – Kreisel - 1959
33 The Expressiveness of Simple and Second-Order Type Structures – St, Leivant, et al. - 1983
33 1962], Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics – Spector
16 Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals – Bezem - 1985
4 A system of abstract constructive ordinals – Howard - 1972
4 On bar recursion of types 0 and 1 – Schwichtenberg - 1979
3 Ordinal analysis of simple cases of bar recursion – Howard - 1981
3 Subrecursive hierarchies – Robbin - 1965
2 Iterated inductive definitions, trees and ordinals – Zucker - 1973
1 Proof Theory. Number 1407 – Pohlers - 1989
1 Eine Klassifikation der " 0 -rekursiven Funktionen. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik – Schwichtenberg - 1971
1 Proof-theoretical analyses of transfinite recursion and inductive definitions – Terlouw - 1986
1 Ueber die mit Bar Rekursion vom Type 0 definierbaren Ordinalzahlen. Archive for Mathematical Logic – Vogel - 1978
View or Download | Add to My Collection | Correct Errors