Turing projectability

Notre Dame Journal of Formal Logic 28 (4):520-535 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

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

Book Review: Stewart Shapiro. Vagueness in Context. [REVIEW]Leon Horsten - 2009 - Notre Dame Journal of Formal Logic 50 (2):221-226.
Book Review. Vagueness in Context. Stewart Shapiro. [REVIEW]Matti Eklund - 2006 - Notre Dame Philosophical Reviews 2006 (5).
A simple generalization of Turing computability.William J. Thomas - 1979 - Notre Dame Journal of Formal Logic 20 (1):95-102.
Enumerations of Turing ideals with applications.David Marker - 1990 - Notre Dame Journal of Formal Logic 31 (4):509-514.
Wittgenstein versus Turing on the nature of Church's thesis.S. G. Shanker - 1987 - Notre Dame Journal of Formal Logic 28 (4):615-649.
A note on Turing machine regularity and primitive recursion.Nicholas J. De Lillo - 1978 - Notre Dame Journal of Formal Logic 19 (2):289-294.

Analytics

Added to PP
2010-08-24

Downloads
57 (#274,088)

6 months
5 (#836,811)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stewart Shapiro
Ohio State University

Citations of this work

Incompleteness, mechanism, and optimism.Stewart Shapiro - 1998 - Bulletin of Symbolic Logic 4 (3):273-302.
Self-reference and incompleteness in a non-monotonic setting.Timothy G. Mccarthy - 1994 - Journal of Philosophical Logic 23 (4):423 - 449.
A Logic for Trial and Error Classifiers.Martin Kaså - 2015 - Journal of Logic, Language and Information 24 (3):307-322.

Add more citations

References found in this work

No references found.

Add more references