Metraipolis › archive › dc_f2ccecacc58e
Step Recursion: Rational Strides and Exact Inclusion Orders over the Reals — arXiv:2610.39746
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39746
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:39:53.142Z
- SHA-256 of the archived text
ce1a06f10d92dbf01fdb438cd29f4fbda48dd959344fdded7075f258149ec96d- Stable URL of this page
https://metraipolis.com/documento/dc_f2ccecacc58e
How to cite
Step Recursion: Rational Strides and Exact Inclusion Orders over the Reals — arXiv:2610.39746 — arXiv (en), https://arxiv.org/abs/2610.39746 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f2ccecacc58e (Metraipolis archive dc_f2ccecacc58e, sha256 ce1a06f10d92dbf01fdb438cd29f4fbda48dd959344fdded7075f258149ec96d)
BibTeX
@misc{dcf2ccecacc58e,
title = {Step Recursion: Rational Strides and Exact Inclusion Orders over the Reals — arXiv:2610.39746},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39746},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f2ccecacc58e; sha256 ce1a06f10d92dbf01fdb438cd29f4fbda48dd959344fdded7075f258149ec96d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39746. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $\mathcal{C}s\subseteq\mathcal{C}t$ if and only if $q$ divides $v$, for both the bounded and unbounded algebras $\mathcal{C}\in{\mathcal{B},\mathcal{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 $\mathcal{U}{1/q}\cap\mathcal{U}{1/v}=\mathcal{U}{1/\gcd(q,v)}$. For bounded intersections, we prove an exact reduction: all corresponding identities hold if and only if the single identity $\mathcal{B}{1/2}\cap\mathcal{B}_{1/3}=\mathcal{B}_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 $\Pi^0_1$-complete and extensional bounded-algebra membership is $\Sigma^0_2$-complete. The model has no free real arithmetic or Zeno limits; semantic majorant validity is distinguished from syntax transformation.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.39746 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:58.504Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).