We prove that (additive) ordered group reducts of nonstandard models of the bounded arithmetical theory are recursively saturated in a rich language with predicates expressing the integers, rationals, and logarithmically bounded numbers. Combined with our previous results on the construction of the real exponential function on completions of models of, we show that every countable model of is an exponential integer part of a real‐closed exponential field.

A generalization is given of McAloon's result on initial segments ofmodels of GlΔ0, the fragment of Peano Arithmetic where the induction scheme is restricted to formulas with bounded quantifiers.

A generalization is given of McAloon's result on initial segments ofmodels of GlΔ0, the fragment of Peano Arithmetic where the induction scheme is restricted to formulas with bounded quantifiers.

We construct two recursive models of fragments of set theory. We also show that the fragments of Kripke-Platek set theory that prove -induction for -formulas have no recursive models but the standard model of the hereditarily finite sets.

We consider the theory and its weak fragments in the language of arithmetic expanded with the functional symbol . We prove that and its weak fragments, down to and , are subject to the Tennenbaum phenomenon with respect to , , and . For the last two theories it is still unknown if they may have nonstandard recursive models in the usual language of arithmetic.

We study the relative strength of the two axioms Every Pell equation has a nontrivial solution Exponentiation is total over weak fragments, and we show they are equivalent over IE1. We then define the graph of the exponential function using only existentially bounded quantifiers in the language of arithmetic expanded with the symbol #, where # = x[log2y]. We prove the recursion laws of exponentiation in the corresponding fragment.

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 (...) fails for the extension of IOpen by an axiom expressing the Bézout property, even under the same assumption on cofinality. (shrink)

The models of normal open induction are those discretely ordered rings, integrally closed in their fraction field whose nonnegative part satisfy Peano's induction axioms for open formulas in the language of ordered semirings.It is known that neither open induction nor the usually studied stronger fragments of arithmetic , have the joint embedding property.We prove that normal models of open induction have the joint embedding property.

This paper proves some independence results for weak fragments of Heyting arithmetic by using Kripke models. We present a necessary condition for linear Kripke models of arithmetical theories which are closed under the negative translation and use it to show that the union of the worlds in any linear Kripke model of HA satisfies PA. We construct a two-node PA-normal Kripke structure which does not force iΣ2. We prove i∀1 ⊬ i∃1, i∃1 ⊬ i∀1, iΠ2 ⊬ iΣ2 and iΣ2 ⊬ (...) iΠ2. We use Smorynski's operation Σ′ to show HA ⊬ lΠ1. (shrink)

Hilbert's tenth problem for a theory T asks if there is an algorithm which decides for a given polynomial p() from [] whether p() has a root in some model of T. We examine some of the model-theoretic consequences that an affirmative answer would have in cases such as T = Open Induction and others, and apply these methods by providing a negative answer in the cases when T is some particular finite fragment of the weak theories IE1 or IU-1.

We study the strength of weak forms of the Regularity Principle in the presence of equation image relative to other subsystems of equation image. In particular, the Bounded Weak Regularity Principle is formulated, and it is shown that when applied to E1 formulas, this principle is equivalent over equation image to equation image.