Map
Index
Random
Help
th

Quote: gives Godel's sentence; it is true because it is unprovable in the system PM

topics > all references > references g-h > QuoteRef: godeK_1931 , p. 598



Topic:
Godel's incompleteness theorem
Topic:
Liar's paradox and Russell's paradox

Quotation Skeleton

[Let R(n) be the n'th formula of PM [Principia mathematica], [y;z] be the substitution of z into … that n belongs to K, and let S=R(q). … [R(q);q] is not … provable.] … closely related to the "Liar" too; for the … [R(q);q] states that q belongs to K, that is, by [definition] (1), that [R(q);q] is not provable. We therefore have before … [p. 599] From the remark that [R(q);q] says about … [R(q);q] is true, for [R(q);q] is indeed unprovable (being undecidable). Thus, …   Google-1   Google-2

Copyright clearance needed for quotation.

Additional Titles

Quote: Godel's sentence is similar to the Liar's paradox and Richard's antimony

Related Topics up

Topic: Godel's incompleteness theorem (19 items)
Topic: Liar's paradox and Russell's paradox (25 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.