Analogues of Shepherdson’s Theorem for a language with exponentiation

In 1964, Shepherdson (1964, Bull. Pol. Acad. Sci., 12) proved that a discretely ordered semiring M⁺ satisfies IOpen (quantifier-free induction) iff the corresponding ring M is an integer part of a model of the theory of real closed fields (RCF). In this paper, we consider open induction schema in the language of arithmetic expanded by exponentiation or by the power function and try to find similar criteria for models of these theories. For several recursively axiomatized extensions T of the theory of RCF, we obtain analogues of Shepherdson’s Theorem in the following sense: If an exponential field R is a model of T and a discretely ordered ring (DOR) M is an exponential integer part of R, then M⁺ is a model of open induction in the expanded language. The proof of the opposite implication—that for any model M of open induction in the expanded language there exists an exponential field R T such that M is an exponential integer part of R—remains, in general, an open question. However, we isolate a natural sufficient condition, related to the well-known Bernoulli inequality, under which this result holds. We define a finite extension T of the usual open induction so that, for any DOR M, the semiring M⁺ satisfies T iff there is an exponential RCF R with the inequality exp (x) 1 + x such that M is an exponential integer part of R. Using these results, we obtain some concrete independence results for these theories.