A Gödelian Puzzle (The Variant)

A Discusson Of The First Few Pages Of "Gödel's Incompletness Theorems" by Raymond M. Smullyan

In the frist few pages of this book Dr. Smullyan presents what he calls a "Gödelian Puzzle". A previous page presents an anotation of that, while this page presents A Variant that Dr. Smullyan also presents. | Consider another computing machine that prints symbols. The machine can only print expressions composed from the five symbols:
In this case we represent the Natural numbers in binary notation then you can get them all by just using strings of 1's and 0's. Every expression is assigned a number called the 100 gets N 1000 gets 1 100000 gets 100000The Gödel number of a compound expression is created by replacing each symbol by We next redefine
In the above Again we are given that the machine never prints a false sentence. And again we are tasked with finding a true sentence that the machine cannot print.
You can see that the digits following the symbols |

This Page Last Updated - Thursday, March 23, 2006 12:02:57 -0500

Home Page