Switch to: Citations

References in:

x1. Aims

Bulletin of Symbolic Logic 2 (2):159-188 (1996)

Add references

You must login to add references.
  1. Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
    In the first part we show why ordinals and ordinal notations are naturally connected with proof theoretical research. We introduce the program of ordinal analysis. The second part gives examples of applications of ordinal analysis.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. [REVIEW]Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (1):35-55.
    It is shown how the strong ordinal notation systems that figure in proof theory and have been previously defined by employing large cardinals, can be developed directly on the basis of their recursively large counterparts. Thereby we provide a completely new approach to well-ordering proofs as will be exemplified by determining the proof-theoretic ordinal of the systemKPM of [R91].
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Systems of predicative analysis.Solomon Feferman - 1964 - Journal of Symbolic Logic 29 (1):1-30.
    This paper is divided into two parts. Part I provides a resumé of the evolution of the notion of predicativity. Part II describes our own work on the subject.Part I§1. Conceptions of sets.Statements about sets lie at the heart of most modern attempts to systematize all (or, at least, all known) mathematics. Technical and philosophical discussions concerning such systematizations and the underlying conceptions have thus occupied a considerable portion of the literature on the foundations of mathematics.
    Download  
     
    Export citation  
     
    Bookmark   118 citations  
  • Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
    KPM is a subsystem of set theory designed to formalize a recursively Mahlo universe of sets. In this paper we show that a certain ordinal notation system is sufficient to measure the proof-theoretic strength ofKPM. This involves a detour through an infinitary calculus RS(M), for which we prove several cutelimination theorems. Full cut-elimination is available for derivations of $\Sigma (L_{\omega _1^c } )$ sentences, whereω 1 c denotes the least nonrecursive ordinal. This paper is self-contained, at least from a technical (...)
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.
    Download  
     
    Export citation  
     
    Bookmark   166 citations  
  • Proof theory of reflection.Michael Rathjen - 1994 - Annals of Pure and Applied Logic 68 (2):181-224.
    The paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, KP, which accommodate first-order reflection. Ordinal analyses for such theories are obtained by devising cut elimination procedures for infinitary calculi of ramified set theory with Пn reflection rules. This leads to consistency proofs for the theories KP+Пn reflection using a small amount of arithmetic and the well-foundedness of a certain ordinal system with respect to primitive decending sequences. Regarding future work, we intend to avail ourselves of these new cut (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik.Kurt Schütte - 1964 - Archive for Mathematical Logic 7 (1-2):45-60.
    Download  
     
    Export citation  
     
    Bookmark   14 citations