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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We present a domain model of dependent type theory and use it to prove basic metatheoretic properties. In particular, we prove…

2018

In this thesis we introduce the notion of majorizability types, and the category MMAsm of majorizability modified assemblies. The…

2015

These past few years, we have been experimenting in Nuprl with versions of Brouwer’s Bar Induction principle. Until recently we…

2015

This paper is about the bar recursion operator in the context of classical realizability. After the pioneering work of Berardi…

2015

We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of…

2014

During the last twenty years or so a wide range of realizability interpretations of classical analysis have been developed. In…

2014

We introduce a new, demand-driven variant of Spector's bar recursion in the spirit of the Berardi-Bezem-Coquand functional. The…

2009

Tese de doutoramento, Matematica (Algebra Logica e Fundamentos), 2009, Universidade de Lisboa, Faculdade de Ciencias

1992

By constructing a counter, model we show that a certain appealing equation E has no solution in Girard's [1972] second order…

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…