| |
| | Peter Suber, "Gödel's Proof" |
 | | Gödel's proof in a nutshell is to create a wff that says in one interpretation, "This wff cannot be proved in S", then to prove that it is undecidable in S, and thereby to prove that it is true. |
 | | Here, instead of saying that there is no number which is the Gödel number of the proof of G, we are making the separate denials for each natural number: wff-sequence(0) is not the proof of G, wff-sequence(1) is not the proof, wff-sequence(2) is not the proof, and so on. |
 | | The third wave ensures that its set of proofs is decidable, which gives it an effective test of proofhood, which allows the predicate for proof-pairhood to be decidable. |
| www.earlham.edu /%7Epeters/courses/logsys/g-proof.htm (4313 words) |
|