Pure iteration and substitution as the basis of computability

&
Bulletin of the Section of Logic 40 (3/4):203-213 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



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

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

Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Imagination and the puzzles of iteration.Shaun Nichols - 2002 - Analysis 62 (3):182-87.
In place of the Other.Bernhard Waldenfels - 2011 - Continental Philosophy Review 44 (2):151-164.
λ-structures and s-structures: Translating the iteration strategies.Gunter Fuchs - 2011 - Annals of Pure and Applied Logic 162 (9):710-751.
The Ontology of Pure Dispositions.William A. Bauer - 2010 - Dissertation, University of Nebraska-Lincoln
Computability in Europe 2011.Sam Buss, Benedikt Löwe, Dag Normann & Ivan Soskov - 2013 - Annals of Pure and Applied Logic 164 (5):509-510.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Computability in Europe 2010.Fernando Ferreira, Martin Hyland, Benedikt Löwe & Elvira Mayordomo - 2012 - Annals of Pure and Applied Logic 163 (6):621-622.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computability in Europe 2009.Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe - 2012 - Annals of Pure and Applied Logic 163 (5):483-484.
On the possibility of naturalistic and of pure epistemology.Leila Haaparanta - 1999 - Synthese 118 (1):31-47.
Introduction to Computability Theory.D. Normann - 2010
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra.Martin Ziegler - 2012 - Annals of Pure and Applied Logic 163 (8):1108-1139.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.

Analytics

Added to PP
2013-10-28

Downloads
23 (#681,424)

6 months
5 (#637,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references