On bar recursion and choice in a classical setting

DOI10.1007/978-3-319-03542-0_25MaRDI QIDQ2937797zbMATH OpenOpenAlexFDO

Authors Valentin Blot, Colin Riba

Publication date 12 January 2015

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03542-0_25

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65) Axiom of choice and related propositions (03E25) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 2222013
• Bar recursion in classical realisability: dependent choice and continuum hypothesis
• Modified bar recursion
• On the computational content of the axiom of choice
• Hybrid realizability for intuitionistic and classical choice

Cited in

(6)

• On the computational content of the axiom of choice
• A classical realizability model arising from a stable model of untyped lambda calculus
• Hybrid realizability for intuitionistic and classical choice
• Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice
• Bar recursion in classical realisability: dependent choice and continuum hypothesis
• scientific article; zbMATH DE number 2222013 (Why is no real title available?)

This page was built for publication: On bar recursion and choice in a classical setting

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