Switch to: Citations

Add references

You must login to add references.
  1. Definability and decision problems in arithmetic.Julia Robinson - 1949 - Journal of Symbolic Logic 14 (2):98-114.
    In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems.In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of successorS(whereSa=a+ 1). Also, it is shown that both addition and multiplication can be defined arithmetically in terms of successor and the relation (...)
    Download  
     
    Export citation  
     
    Bookmark   43 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  
  • On the decidability of the real exponential field.Angus Macintyre & Alex J. Wilkie - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana: About and Around Georg Kreisel. A K Peters. pp. 441--467.
    Download  
     
    Export citation  
     
    Bookmark   15 citations