Switch to: Citations

Add references

You must login to add references.
  1. On Wainer's notation for a minimal subrecursive inaccessible ordinal.Noriya Kadota - 1993 - Mathematical Logic Quarterly 39 (1):217-227.
    We show the following results on Wainer's notation for a minimal subrecursive inaccessible ordinal τ: First, we give a constructive proof of the collapsing theorem. Secondly, we prove that the slow-growing hierarchy and the fast-growing hierarchy up to τ have elementary properties on increase and domination, which completes Wainer's proof that τ is a minimal subrecursive inaccessible. Our results are obtained by showing a strong normalization theorem for the term structure of the notation. MSC: 03D20, 03F15.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An independence result for (II11-CA)+BI.Wilfried Buchholz - 1987 - Annals of Pure and Applied Logic 33 (C):131-155.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.
    In ordinal analysis of impredicative theories so-called collapsing functions are of central importance. Unfortunately, the definition procedure of these functions makes essential use of uncountable cardinals whereas the notation system that they call into being corresponds to a recursive ordinal. It has long been claimed that, instead, one should manage to develop such functions directly on the basis of admissible ordinals. This paper is meant to show how this can be done. Interpreting the collapsing functions as operating directly on admissible (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A Uniform Approach to Fundamental Sequences and Hierarchies.Wilfried Buchholz, Adam Cichon & Andreas Weiermann - 1994 - Mathematical Logic Quarterly 40 (2):273-286.
    In this article we give a unifying approach to the theory of fundamental sequences and their related Hardy hierarchies of number-theoretic functions and we show the equivalence of the new approach with the classical one.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Three conceptual problems that bug me (7th Scandinavian Logic Symposium, Uppsala lecture, Aug.18-20, 1996 Draft).Solomon Feferman - unknown
    I will talk here about three problems that have bothered me for a number of years, during which time I have experimented with a variety of solutions and encouraged others to work on them. I have raised each of them separately both in full and in passing in various contexts, but thought it would be worthwhile on this occasion to bring them to your attention side by side. In this talk I will explain the problems, together with some things that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • How to characterize provably total functions by local predicativity.Andreas Weiermann - 1996 - Journal of Symbolic Logic 61 (1):52-69.
    Inspired by Pohlers' proof-theoretic analysis of KPω we give a straightforward non-metamathematical proof of the (well-known) classification of the provably total functions of $PA, PA + TI(\prec\lceil)$ (where it is assumed that the well-ordering $\prec$ has some reasonable closure properties) and KPω. Our method relies on a new approach to subrecursion due to Buchholz, Cichon and the author.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A slow growing analogue to buchholz' proof.Toshiyasu Arai - 1991 - Annals of Pure and Applied Logic 54 (2):101-120.
    In this, journal, W. Buchholz gave an elegant proof of a characterization theorem for provably total recursive functions in the theory IDv for the v-times iterated inductive definitions . He characterizes the classes of functions by Hardy functions. In this note we will show that a slow growing analogue to the theorem can be obtained by a slight modification of Buchholz' proof.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • [product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
    Download  
     
    Export citation  
     
    Bookmark   50 citations