On bar recursion of types 0 and 1

DOI10.2307/2273126zbMath0433.03037OpenAlexW2170105957MaRDI QIDQ3870893

Helmut Schwichtenberg

Publication date: 1979

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273126

zbMATH Keywords

proof theorybar recursionfinite types

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Related Items

On Spector's bar recursion, Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions, A constructive analysis of learning in Peano arithmetic, A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM, Unnamed Item, Unnamed Item, Higher order functions and Brouwer’s thesis