arXiv (All)
open access
The Orientation Boundary for Step-Duplicating Recursors: A Machine-Checked Structural Theory of Termination Proofs
The rewrite rule \[ \mathrm{recur}(b,s,\mathrm{succ}(n))\to \mathrm{wrap}(s,\mathrm{recur}(b,s,n)) \] copies its step argument, the payload, and consumes one recursion counter. It terminates; we ask which direct measures prove it. For measures built from counter and payload by constants, s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convergence Without Identity: Structural Similarity and Recurrence Under Constraint in the Paton System#699051
- Certification of Bilateral Patience Sort in Theorema and Rocq#1129501
- Logical-arithmetic entropy and the principle of maximum entropy Irreversibility and computational complexity#96886
- Wrong as Sequence Violation: The Structural Definition of Wrong as Misordering#691607
- Ordering Without Priority (The Non-Modal Structural System XXVIII)#71678
Record · ID 1155079
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive