Switch to: Citations

Add references

You must login to add references.
  1. On Herbrand consistency in weak arithmetic.Zofia Adamowicz & Paweł Zbierski - 2001 - Archive for Mathematical Logic 40 (6):399-413.
    We prove that the Gödel incompleteness theorem holds for a weak arithmetic T = IΔ0 + Ω2 in the form where Cons H (T) is an arithmetic formula expressing the consistency of T with respect to the Herbrand notion of provability.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.
    Samuel R. Buss and Aleksandar Ignjatović. Unprovability of Consistency Statements in Fragments of Bounded Arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
    Download  
     
    Export citation  
     
    Bookmark   96 citations