BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS

DOI10.1017/jsl.2014.82zbMath1380.03064arXiv1407.7046OpenAlexW1995130513MaRDI QIDQ5251356

Paulo Oliva, Martín Hötzel Escardó

Publication date: 20 May 2015

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

Full work available at URL: https://arxiv.org/abs/1407.7046

zbMATH Keywords

selection functiongeneralised quantifierT-definabilitymodified bar recursionspector bar recursion

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50) Recursive equivalence types of sets and structures, isols (03D50) Relative consistency and interpretations (03F25) Higher-type and set recursion theory (03D65)

Related Items (4)

Higher-order games with dependent types ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Bar recursion over finite partial functions ⋮ THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT

Cites Work

• The equivalence of bar recursion and open recursion
• On Spector's bar recursion
• Sequential games and optimal strategies
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Selection functions, bar recursion and backward induction
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Modified bar recursion

This page was built for publication: BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS