Metraipolis › archive › dc_bad07fb6fe9e

An Explicit Ordinal Bound for System T Dialogue Trees — arXiv:2609.20369

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20369
License (as archived)
CC0-1.0
Archived
2026-10-10T05:44:51.362Z
SHA-256 of the archived text
44b0b101d40983bd68e7c5430908163082025eae57c4c1032d022c71c45c26d7
Stable URL of this page
https://metraipolis.com/documento/dc_bad07fb6fe9e

How to cite

An Explicit Ordinal Bound for System T Dialogue Trees — arXiv:2609.20369 — arXiv (en), https://arxiv.org/abs/2609.20369 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bad07fb6fe9e (Metraipolis archive dc_bad07fb6fe9e, sha256 44b0b101d40983bd68e7c5430908163082025eae57c4c1032d022c71c45c26d7)
BibTeX
@misc{dcbad07fb6fe9e,
  title = {An Explicit Ordinal Bound for System T Dialogue Trees — arXiv:2609.20369},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20369},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bad07fb6fe9e; sha256 44b0b101d40983bd68e7c5430908163082025eae57c4c1032d022c71c45c26d7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20369. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Escardó's dialogue interpretation assigns to each closed term $t:(\iota\to\iota)\to\iota$ of Gödel's System~T a well-founded, countably branching tree $D(t)$, where $\iota$ is the natural-number type. We give a direct proof that its classical ordinal height is below $\epsilon_0$. More precisely, we compute a natural number $K(t)\ge2$ from the type levels occurring in the source term and prove $h(D(t))<\theta_{K(t)}$, where $\theta_0=\omega$ and $\theta_{n+1}=\omega^{\theta_n}$. Our proof translates recursors into closed infinitary templates and eliminates $\beta$-redexes by a finite sequence of passes indexed by ordinary type level. The translation and every pass preserve the dialogue denotation exactly. An auxiliary rank $\rho$ satisfies an additive substitution bound; each pass sends rank $\alpha$ to at most $2^\alpha$. Combining these estimates with a computable initial bound $\omega+m(t)$ and a dialogue-height bound $2^{\rho(N)}$ for closed ground normal forms $N$ yields the stated tower bound. A semantics-preserving translation transfers the result to Escardó's original combinatory interpretation. We formalise the proof in Agda over classical ordinals under explicit foundational assumptions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.20369 — 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-10-10T05:08:21.101Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).