Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,720 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Bar induction
Concatenation
Mathematical induction
Transfinite induction
Expand
Broader (1)
Recursion
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An Adequacy Theorem for Dependent Type Theory
T. Coquand
,
Simon Huber
Theory of Computing Systems
2018
Corpus ID: 253741008
We present a domain model of dependent type theory and use it to prove basic metatheoretic properties. In particular, we prove…
Expand
2016
2016
A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM
Paulo Oliva
,
Silvia Steila
Journal of Symbolic Logic (JSL)
2016
Corpus ID: 4833762
Abstract In [12], Schwichtenberg showed that the System T definable functionals are closed under a rule-like version Spector’s…
Expand
2015
2015
Coq as a Metatheory for Nuprl with Bar Induction
Vincent Rahli
,
M. Bickford
2015
Corpus ID: 17643428
These past few years, we have been experimenting in Nuprl with versions of Brouwer’s Bar Induction principle. Until recently we…
Expand
2012
2012
Gödel functional interpretation and weak compactness
U. Kohlenbach
Annals of Pure and Applied Logic
2012
Corpus ID: 14589936
2012
2012
The Peirce translation
M. Escardó
,
Paulo Oliva
Annals of Pure and Applied Logic
2012
Corpus ID: 17983762
2012
2012
Exploring the Computational Content of the Infinite Pigeonhole Principle
D. Ratiu
,
T. Trifonov
Journal of Logic and Computation
2012
Corpus ID: 13370556
The use of classical logic for some combinatorial proofs, as it is the case with Ramsey’s theorem, can be localized in the…
Expand
2008
2008
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
Paulo Oliva
,
T. Streicher
Fundamenta Informaticae
2008
Corpus ID: 16020063
This article investigates Krivine's realizability interpretation of classical second-order arithmetic and its recent extension…
Expand
1981
1981
Ordinal analysis of simple cases of bar recursion
W. A. Howard
Journal of Symbolic Logic (JSL)
1981
Corpus ID: 28738765
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…
Expand
1979
1979
On bar recursion of types 0 and 1
H. Schwichtenberg
Journal of Symbolic Logic (JSL)
1979
Corpus ID: 5970715
For general information on bar recursion the reader should consult the papers of Spector [8], where it was introduced, Howard [2…
Expand
Highly Cited
1968
Highly Cited
1968
Functional interpretation of bar induction by bar recursion
Compositio Mathematica
,
W. A. Howard
1968
Corpus ID: 54530796
© Foundation Compositio Mathematica, 1968, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required