|Abstract||"All the limitative Theorems of metamathematics and the theory of computation suggest that once the ability to represent your own structure has reached a certain critical point, that is the kiss of death: it guarantees that you can never represent yourself totally. Godel's Incompleteness Theorem, Church's Undecidability Theorem, Turing's Halting Problem, Turski's Truth Theorem -- all have the flavour of some ancient fairy tale which warns you that `To seek self-knowledge is to embark on a journey which...will always be incomplete, cannot be charted on a map, will never halt, cannot be described. " - Douglas R. Hofstadter..|
|Keywords||No keywords specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Israel Scheffler (1979). Beyond the Letter: A Philosophical Inquiry Into Ambiguity, Vagueness, and Metaphor in Language. Routledge & Kegan Paul.
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
Saul A. Kripke (forthcoming). Another Approach: The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem. In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Gödel, Turing, Church, and beyond. MIT Press.
Brendan S. Gillon (1990). Ambiguity, Generality, and Indeterminacy: Tests and Definitions. Synthese 85 (3):391 - 416.
J. J. C. Smart (1961). Godel's Theorem, Church's Theorem, and Mechanism. Synthese 13 (June):105-10.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Richard Kaye (1991). A Generalization of Specker's Theorem on Typical Ambiguity. Journal of Symbolic Logic 56 (2):458-466.
Matjaž Potrč & Vojko Strahovnik (2013). Moral Dilemmas and Vagueness. Acta Analytica 28 (2):207-222.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads4 ( #178,748 of 549,124 )
Recent downloads (6 months)0
How can I increase my downloads?