Switch to: References

Add citations

You must login to add citations.
  1. Injecting uniformities into Peano arithmetic.Fernando Ferreira - 2009 - Annals of Pure and Applied Logic 157 (2-3):122-129.
    We present a functional interpretation of Peano arithmetic that uses Gödel’s computable functionals and which systematically injects uniformities into the statements of finite-type arithmetic. As a consequence, some uniform boundedness principles are interpreted while maintaining unmoved the -sentences of arithmetic. We explain why this interpretation is tailored to yield conservation results.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Bounds for indexes of nilpotency in commutative ring theory: A proof mining approach.Fernando Ferreira - 2020 - Bulletin of Symbolic Logic 26 (3-4):257-267.
    It is well-known that an element of a commutative ring with identity is nilpotent if, and only if, it lies in every prime ideal of the ring. A modification of this fact is amenable to a very simple proof mining analysis. We formulate a quantitative version of this modification and obtain an explicit bound. We present an application. This proof mining analysis is the leitmotif for some comments and observations on the methodology of computational extraction. In particular, we emphasize that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The bounded functional interpretation of bar induction.Patrícia Engrácia - 2012 - Annals of Pure and Applied Logic 163 (9):1183-1195.
    Download  
     
    Export citation  
     
    Bookmark  
  • A short note on Spector's proof of consistency of analysis.Fernando Ferreira - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 222--227.
    Download  
     
    Export citation  
     
    Bookmark