Wilfried Sieg. Step by recursive step: Church's analysis of effective calculability. The bulletin of symbolic logic, vol. 3 , pp. 154–180 [Book Review]

Journal of Symbolic Logic 64 (1):398-399 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Formal Systems, properties of.Wilfried Sieg - 1950 - Bulletin of Symbolic Logic 3:154-180.
In Memoriam: Solomon Feferman (1928–2016).Charles Parsons & Wilfried Sieg - 2017 - Bulletin of Symbolic Logic 23 (3):337-344.
Reductions of Theories for Analysis.Wilfried Sieg, Georg Dorn & P. Weingartner - 1990 - Journal of Symbolic Logic 55 (1):354-354.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Fragments of Arithmetic.Wilfried Sieg - 1987 - Journal of Symbolic Logic 52 (4):1054-1055.

Analytics

Added to PP
2016-06-30

Downloads
10 (#1,187,905)

6 months
1 (#1,461,875)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stewart Shapiro
Ohio State University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references