Stanford Encyclopedia of Philosophy (2008)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,091
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Introduction to Metamathematics.Stephen Kleene - 1952 - Princeton, NJ, USA: North Holland.
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..

View all 27 references / Add more references

Citations of this work BETA

Are Computer Simulations Experiments? And If Not, How Are They Related to Each Other?Claus Beisbart - 2018 - European Journal for Philosophy of Science 8 (2):171-204.
On the Nature of Minds, Or: Truth and Consequences.Shimon Edelman - 2008 - Journal of Experimental and Theoretical Ai 20:181-196.

View all 7 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
29 ( #394,330 of 2,506,113 )

Recent downloads (6 months)
1 ( #416,984 of 2,506,113 )

How can I increase my downloads?

Downloads

My notes