Switch to: Citations

Add references

You must login to add references.
  1. Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1):143-157.
    D’Aquino et al. (J Symb Log 75(1):1–11, 2010) have recently shown that every real-closed field with an integer part satisfying the arithmetic theory IΣ4 is recursively saturated, and that this theorem fails if IΣ4 is replaced by IΔ0. We prove that the theorem holds if IΣ4 is replaced by weak subtheories of Buss’ bounded arithmetic: PV or $${\Sigma^b_1-IND^{|x|_k}}$$. It also holds for IΔ0 (and even its subtheory IE 2) under a rather mild assumption on cofinality. On the other hand, it (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Ω1-like recursively saturated models of Presburger's arithmetic.Victor Harnik - 1986 - Journal of Symbolic Logic 51 (2):421-429.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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  
  • On completing ordered fields.Dana Scott - 1969 - In W. A. J. Luxemburg (ed.), Applications of model theory to algebra, analysis, and probability. New York,: Holt, Rinehart and Winston. pp. 274--278.
    Download  
     
    Export citation  
     
    Bookmark   8 citations