Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice

DOI10.1093/LOGCOM/EXV056zbMath1444.03141arXiv1411.0457OpenAlexW2963227651MaRDI QIDQ5225854

No author found.

Publication date: 29 July 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

open inductionbar recursiondependent choicemodified realizabilitycontinuous functionals

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Axiom of choice and related propositions (03E25) Combinatory logic and lambda calculus (03B40) Relative consistency and interpretations (03F25) Higher-type and set recursion theory (03D65)

Related Items (1)

Higher-order games with dependent types

This page was built for publication: Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice