A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem
Paulo Oliva, Silvia Steila

TL;DR
This paper provides a direct, explicit construction proof of Schwichtenberg's bar recursion closure theorem, simplifying the conversion of bar recursive definitions into System T and sharpening the definability results.
Contribution
It introduces a more straightforward proof method using an explicit construction and logical relations, replacing the original indirect proof via infinitary terms.
Findings
The explicit construction allows direct conversion of bar recursive definitions into System T.
The proof simplifies understanding and computation of System T definable functionals.
A sharper result states the definability in fragments T_i with explicit bounds.
Abstract
In 1979 Schwichtenberg showed that the System definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels and . More precisely, if the functional which controls the stopping condition of Spector's bar recursor is -definable, then the corresponding bar recursion of type levels and is already -definable. Schwichtenberg's original proof, however, relies on a detour through Tait's infinitary terms and the correspondence between ordinal recursion for and primitive recursion over finite types. This detour makes it hard to calculate on given concrete system input, what the corresponding system output would look like. In this paper we present an alternative (more direct) proof based on an explicit construction which we prove correct via a suitably defined…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
