Switch to: Citations

Add references

You must login to add references.
  1. Primes and their residue rings in models of open induction.Angus Macintyre & David Marker - 1989 - Annals of Pure and Applied Logic 43 (1):57-77.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Logical foundations of proof complexity.Stephen Cook & Phuong Nguyen - 2011 - Bulletin of Symbolic Logic 17 (3):462-464.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • The strength of sharply bounded induction requires M S P.Sedki Boughattas & Leszek Aleksander Kołodziejczyk - 2010 - Annals of Pure and Applied Logic 161 (4):504-510.
    We show that the arithmetical theory -INDx5, formalized in the language of Buss, i.e. with x/2 but without the MSP function x/2y, does not prove that every nontrivial divisor of a power of 2 is even. It follows that this theory proves neither NP=coNP nor.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Every real closed field has an integer part.M. H. Mourgues & J. P. Ressayre - 1993 - Journal of Symbolic Logic 58 (2):641-647.
    Let us call an integer part of an ordered field any subring such that every element of the field lies at distance less than 1 from a unique element of the ring. We show that every real closed field has an integer part.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
    Let P 0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P 0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M ' of M which is a model of T such that the complete diagram of M ' (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Real closed fields and models of Peano arithmetic.P. D'Aquino, J. F. Knight & S. Starchenko - 2010 - Journal of Symbolic Logic 75 (1):1-11.
    Shepherdson [14] showed that for a discrete ordered ring I, I is a model of IOpen iff I is an integer part of a real closed ordered field. In this paper, we consider integer parts satisfying PA. We show that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ₄), then R must be recursively saturated. In particular, the real closure of I, RC (I), is recursively saturated. We (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Corrigendum to: “Real closed fields and models of arithmetic”.P. D'Aquino, J. F. Knight & S. Starchenko - 2012 - Journal of Symbolic Logic 77 (2):726-726.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)A recursive nonstandard model of normal open induction.Alessandro Berarducci & Margarita Otero - 1996 - Journal of Symbolic Logic 61 (4):1228-1241.
    Models of normal open induction are those normal discretely ordered rings whose nonnegative part satisfy Peano's axioms for open formulas in the language of ordered semirings. (Where normal means integrally closed in its fraction field.) In 1964 Shepherdson gave a recursive nonstandard model of open induction. His model is not normal and does not have any infinite prime elements. In this paper we present a recursive nonstandard model of normal open induction with an unbounded set of infinite prime elements.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)An Introduction to Recursively Saturated and Resplendent Models.Jon Barwise & John Schlipf - 1982 - Journal of Symbolic Logic 47 (2):440-440.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Bootstrapping, part I.Sedki Boughattas & J. -P. Ressayre - 2010 - Annals of Pure and Applied Logic 161 (4):511-533.
    We construct models of the integers, to yield: witnessing, independence and separation results for weak systems of bounded induction.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
    Download  
     
    Export citation  
     
    Bookmark   21 citations