On bar recursion of types 0 and 1

DOI10.2307/2273126MaRDI QIDQ3870893zbMATH OpenOpenAlexFDO

Authors 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

bar recursionfinite typesproof theory

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Cited in

(8)

• Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions
• On Spector's bar recursion
• A constructive analysis of learning in Peano arithmetic
• A direct proof of Schwichtenberg's bar recursion closure theorem
• Higher order functions and Brouwer's thesis
• A syntactic approach to continuity of T-definable functionals
• scientific article; zbMATH DE number 7269245 (Why is no real title available?)
• A Gentzen-style monadic translation of Gödel's system T

This page was built for publication: On bar recursion of types 0 and 1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870893)