On bar recursion of types 0 and 1

Journal of Symbolic Logic 44 (3):325-329 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273126

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Higher type recursion, ramification and polynomial time.Stephen J. Bellantoni, Karl-Heinz Niggl & Helmut Schwichtenberg - 2000 - Annals of Pure and Applied Logic 104 (1-3):17-30.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.
Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV).S. C. Kleene - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--119.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
Finite notations for infinite terms.Helmut Schwichtenberg - 1998 - Annals of Pure and Applied Logic 94 (1-3):201-222.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.
Monotone majorizable functionals.Helmut Schwichtenberg - 1999 - Studia Logica 62 (2):283-289.
What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.
Review: Thomas J. Grilliot, Omitting Types: Application to Recursion Theory. [REVIEW]Wayne Richter - 1975 - Journal of Symbolic Logic 40 (1):87-88.
Tarski's fixed-point theorem and lambda calculi with monotone inductive types.Ralph Matthes - 2002 - Synthese 133 (1-2):107 - 129.
Recursion and Double Recursion.Raphael M. Robinson - 1949 - Journal of Symbolic Logic 14 (3):191-192.

Analytics

Added to PP
2009-01-28

Downloads
40 (#378,975)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the no-counterexample interpretation.Ulrich Kohlenbach - 1999 - Journal of Symbolic Logic 64 (4):1491-1511.
On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
A constructive analysis of learning in Peano Arithmetic.Federico Aschieri - 2012 - Annals of Pure and Applied Logic 163 (11):1448-1470.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references