Ordinal analysis of simple cases of bar recursion

DOI10.2307/2273252MaRDI QIDQ3912574zbMATH OpenOpenAlexFDO

Authors William Alvin Howard

Publication date 1981

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

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

zbMATH Keywords

computation treesordinal analysistransfinite recursion

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Recursive ordinals and ordinal notations (03F15)

Cites work

• A new type assignment for λ-terms
• Ordinal analysis of terms of finite type
• Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis

Cited in

(9)

• On Spector's bar recursion
• Term extraction and Ramsey's theorem for pairs
• On the computational content of the Bolzano-Weierstraß Principle
• A note on the monotone functional interpretation
• scientific article; zbMATH DE number 3693265 (Why is no real title available?)
• Primitive recursion and the chain antichain principle
• Gödel functional interpretation and weak compactness
• A direct proof of Schwichtenberg's bar recursion closure theorem
• Proof-theoretic investigation of -reduction in the simply typed -calculus

This page was built for publication: Ordinal analysis of simple cases of bar recursion

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