| 
|
Quote: there is no general process to determine whether a given formula is provable; contrast with Godel's proof that there exist propositions U such that neither U nor -U is provable
topics >
all references >
references t-z >
Topic:
limitations of formalism
Topic:
Turing machine
Topic:
Godel's incompleteness theorem
Quotation Skeleton
The results of [p. 246-8] have some important applications. … … I propose … to show that there can be no general … that there can be no machine which, supplied … perhaps be remarked that what I shall prove … [ref]. Godel has shown that (in the formalism of Principia Mathematica) … On the other hand, I shall show that … or, what comes to the same, whether the … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: limitations of formalism (92 items)
Topic: Turing machine (30 items)
Topic: Godel's incompleteness theorem (19 items)