Selection in abstract recursion theory

&
Journal of Symbolic Logic 41 (1):153-158 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272954

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

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

J. C. Shepherdson. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 285–308. - J. C. Shepherdson. Computational complexity of real functions. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 309–315. - A. J. Kfoury. The pebble game and logics of programs. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, an. [REVIEW]J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.
L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson. Introduction. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. Ščedrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. vii–xii. [REVIEW]H. B. Enderton - 1990 - Journal of Symbolic Logic 55 (2):867-868.
D. L. Kreider and R. W. Ritchie. Predictably computable functionals and definition by recursion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 65–80. [REVIEW]Paul Axt - 1968 - Journal of Symbolic Logic 33 (2):298-299.
Rick L. Smith. The consistency strengths of some finite forms of the Higman and Kruskal theorems. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 119–136. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):869-870.
More existence theorems for recursion categories.Florian Lengyel - 2004 - Annals of Pure and Applied Logic 125 (1-3):1-41.
M. D. Gladstone. A reduction of the recursion scheme. The journal of symbolic logic, Bd. 32 , S. 505–508.Rozsa Peter - 1970 - Journal of Symbolic Logic 35 (4):591.
C. Smoryński. Nonstandard models and related developments. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 179–229. [REVIEW]C. Dimitracopoulos - 1990 - Journal of Symbolic Logic 55 (2):875-876.
Gál I. L., Rosser J. B., and Scott D.. Generalization of a lemma of G. F. Rose. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):179-179.
Stephen G. Simpson. Friedman's research on subsystems of second order arithmetic. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 137–159. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.

Analytics

Added to PP
2009-01-28

Downloads
19 (#1,081,553)

6 months
3 (#1,479,050)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Selection functions for recursive functionals.Thomas J. Grilliot - 1969 - Notre Dame Journal of Formal Logic 10 (3):225-234.

Add more references