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

Abstract

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 𝒞s⊆𝒞t if and only if q divides v, for both the bounded and unbounded algebras 𝒞∈ℬ,𝒰. 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 𝒰1/q∩𝒰1/v=𝒰1/gcd(q,v). For bounded intersections, we prove an exact reduction: all corresponding identities hold if and only if the single identity ℬ1/2∩ℬ_1/3=ℬ₁ 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.

Step Recursion: Exact Membership Spectra, Mixed Strides, and Collapse
Kirill Osipov
arXiv29 Oct 2026PreprintarXiv licenceFull textLogic & foundationsarXiv
On trace-zero norm forms of orders of rational quaternion algebras with applications
Yifan Luo, Tianze Wang, Haigang Zhou
arXiv10 Oct 2026PreprintarXiv licenceFull textAlgebra & number theoryarXiv
Generating sets for maximal orders in rational quaternion algebras
Kirsten Eisenträger, Eyal Z. Goren, Annamaria Iezzi +6
arXiv7 Oct 2026PreprintarXiv licenceFull textAlgebra & number theoryarXiv
Diagonal recovery from noisy Fourier--Hermite coefficients: exact orders of the error
S. G. Solodky, Y. A. Volynets
arXiv11 Oct 2026PreprintCC0Full textNumerical analysis & scientific computingarXiv
An exact compression-and-lifting procedure and D-optimal designs of orders 198 and 170
Stelios D. Georgiou, Stella Stylianou
arXiv24 Oct 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{osipov2026step,
  title = {{Step Recursion: Rational Strides and Exact Inclusion Orders over the Reals}},
  author = {Kirill Osipov},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.39746},
  eprint = {2610.39746},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.39746},
}

RIS

TY  - UNPB
TI  - Step Recursion: Rational Strides and Exact Inclusion Orders over the Reals
AU  - Kirill Osipov
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.39746
UR  - https://arxiv.org/abs/2610.39746
AB  - 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 𝒞s⊆𝒞t if and only if q divides v, for both the bounded and unbounded algebras 𝒞∈ℬ,𝒰. 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 𝒰1/q∩𝒰1/v=𝒰1/gcd(q,v). For bounded intersections, we prove an exact reduction: all corresponding identities hold if and only if the single identity ℬ1/2∩ℬ_1/3=ℬ_1 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 Π^0_1-complete and extensional bounded-algebra membership is Σ^0_2-complete. The model has no free real arithmetic or Zeno limits; semantic majorant validity is distinguished from syntax transformation.
ER  -

Abstract

Related

Cite