The equivalence of bar recursion and open recursion
type: Item
instance of: scholarly article
title: The equivalence of bar recursion and open recursion
zbMATH Open document ID: 1354.03058
published in: Annals of Pure and Applied Logic
publication date: 2014-08-21T00:00:00Z
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 03F10
zbMATH DE Number: 6333291
zbMATH Keywords: Gödel's system T
zbMATH Keywords: primitive recursive equivalence
zbMATH Keywords: bar recursion
zbMATH Keywords: open recursion
MaRDI profile type: Publication
full work available at URL: j.apal.2014.07.003
OpenAlex ID: W2023101964
cites work: On the computational content of the axiom of choice
cites work: Strong normalisation for applied lambda calculi
cites work: Q5702662
cites work: Modified bar recursion
cites work: Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
cites work: Equivalence of bar recursors in the theory of functionals of finite type
cites work: Constructive topology and combinatorics
cites work: Synthetic topology: of data types and classical spaces
cites work: Computational Interpretations of Analysis via Products of Selection Functions
cites work: Selection functions, bar recursion and backward induction
cites work: Sequential games and optimal strategies
cites work: The Peirce translation
cites work: Q3855167
cites work: Q3281965
cites work: Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
cites work: Q5344164
cites work: Q5734436
cites work: On Spector's bar recursion
cites work: Proving open properties by induction
cites work: Programs from proofs using classical dependent choice
cites work: Q5519134
cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
DOI: 10.1016/J.APAL.2014.07.003
author: Thomas Powell
description: scientific article; zbMATH DE number 6333291