Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers

Journal of Symbolic Logic 55 (3):1307-1308 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274492

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

Review: Piergiorgio Odifreddi, Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers. [REVIEW]Peter G. Hinman - 1990 - Journal of Symbolic Logic 55 (3):1307-1308.
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Equational Boolean relation theory.Harvey Friedman - manuscript
Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Why Numbers Are Sets.Eric Steinhart - 2002 - Synthese 133 (3):343-361.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
On the Strength of some Semi-Constructive Theories.Solomon Feferman - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 201-226.
Monoidal categories with natural numbers object.Robert Paré & Leopoldo Román - 1989 - Studia Logica 48 (3):361 - 376.
Sts: A Structural Theory Of Sets.A. Baltag - 1999 - Logic Journal of the IGPL 7 (4):481-515.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: Cambridge University Press.

Analytics

Added to PP
2017-02-21

Downloads
14 (#934,671)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
Some observations on truth hierarchies.P. D. Welch - 2014 - Review of Symbolic Logic 7 (1):1-30.
Proving church's thesis.Robert Black - 2000 - Philosophia Mathematica 8 (3):244--58.

View all 16 citations / Add more citations

References found in this work

No references found.

Add more references