Some additive vs. multiplicative issues in subrecursivity, maximality, and near-linearity

We deal with three topics around addition without or with multiplication.

We first present algorithms to compute a certain real, generating its Beatty sequence or base 2 expansion. The former calculates in integers with addition, in conjunction with the counting operator. The latter calculates in integers with addition and multiplication. Motivation comes from subrecursive reals.

Next, let F be an ordered field, D a maximal discrete subring of F, and G a maximal discrete additive subgroup of F. We point out that although there are examples where F has elements of infinite distance to D, it can never realize any gaps of G. If F is countable, then G can be constructed Delta^0_2 relative to F.

Finally we finish and extend the talk of last week by considering some nonstandard models M of weak arithmetic which have the integers as an additive direct summand. We present functions f and g from M to M whose value at a sum minus sum of values is always 0 or 1 yet for some x,y,u,v ≥ 1in M, we have f(xy) ug(v) + u – 1.