Switch to: Citations

Add references

You must login to add references.
  1. Proof-theoretic analysis by iterated reflection.Lev D. Beklemishev - 2003 - Archive for Mathematical Logic 42 (6):515-552.
    Progressions of iterated reflection principles can be used as a tool for the ordinal analysis of formal systems. We discuss various notions of proof-theoretic ordinals and compare the information obtained by means of the reflection principles with the results obtained by the more usual proof-theoretic techniques. In some cases we obtain sharper results, e.g., we define proof-theoretic ordinals relevant to logical complexity Π1 0 and, similarly, for any class Π n 0 . We provide a more general version of the (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • A note on predicative ordinal analysis I: Iterated comprehension and transfinite induction.Sato Kentaro - 2019 - Journal of Symbolic Logic 84 (1):226-265.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A marriage of Brouwer’s intuitionism and Hilbert’s finitism I: Arithmetic.Takako Nemoto & Sato Kentaro - 2022 - Journal of Symbolic Logic 87 (2):437-497.
    We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classical situation concerning the continuity principle, more contrasts turn out: we show that several principles are finitistically justifiable or guaranteed which are classically not. Among them are: fan theorem for decidable fans but arbitrary bars; continuity principle (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations