Step Recursion: Rational Strides and Exact Inclusion Orders over the Reals

We study finite-terminating, address-only step recursion on the nonnegative reals, from zero, unit successor and projections. For reduced positive rational strides $s=a/q$ and $t=b/v$, we prove Cs if and only if q divides v, for both the bounded and unbounded algebras C∈B,U. The bounded compiler preserves earlier global majorants on every auxiliary input. Mixed rational stride sets are classified by least common denominators and supernatural denominators. Primitive-recursive translated-coordinate grid codes characterize the unbounded algebras and yield U1/q1/v=U1/(q,v). For bounded intersections, we prove an exact reduction: all corresponding identities hold if and only if the single identity B1/21/3=B₁ holds, equivalently if the Boolean parts of the integer successor and addition algebras under scalar bounded recursion coincide. A Boolean reconstruction reduces general functions to predicates; a clipped fine-grid simulation with a frozen global resource bound identifies the union of predicate precision classes with the addition level. These reductions do not decide the resulting predicate equality, so literal bounded intersections remain unresolved. We also prove that unbounded-program equality is Π⁰₁-complete and extensional bounded-algebra membership is Σ⁰₂-complete. The model has no free real arithmetic or Zeno limits; semantic majorant validity is distinguished from syntax transformation.