Skip to search formSkip to main contentSkip to account menu

Bar recursion

Bar recursion is a generalized form of recursion developed by C. Spector in his 1962 paper. It is related to bar induction in the same fashion that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present a domain model of dependent type theory and use it to prove basic metatheoretic properties. In particular, we prove… 
2016
2016
Abstract In [12], Schwichtenberg showed that the System T definable functionals are closed under a rule-like version Spector’s… 
2015
2015
These past few years, we have been experimenting in Nuprl with versions of Brouwer’s Bar Induction principle. Until recently we… 
2012
2012
The use of classical logic for some combinatorial proofs, as it is the case with Ramsey’s theorem, can be localized in the… 
2008
2008
This article investigates Krivine's realizability interpretation of classical second-order arithmetic and its recent extension… 
1981
1981
The purpose of the following is to give an ordinal analysis of bar recursion of type 0 for the cases in which the bar recursion… 
1979
1979
For general information on bar recursion the reader should consult the papers of Spector [8], where it was introduced, Howard [2… 
Highly Cited
1968
Highly Cited
1968
© Foundation Compositio Mathematica, 1968, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica…