Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!cmcl2!rutgers!sunybcs!boulder!hao!oddjob!sphinx!hin9
From: hin9@sphinx.uchicago.edu (The Reverend w. No Name)
Newsgroups: sci.philosophy.tech
Subject: Godel (short)
Message-ID: <2362@sphinx.uchicago.edu>
Date: Sun, 4-Oct-87 22:20:29 EDT
Article-I.D.: sphinx.2362
Posted: Sun Oct  4 22:20:29 1987
Date-Received: Thu, 8-Oct-87 00:42:00 EDT
Reply-To: hin9@sphinx.UUCP (The Reverend w. No Name)
Organization: ODD
Lines: 14
Keywords: The simplest example of Godel's Incompleteness Theorem in action

I've ever seen was is What is the Name of This Book?, by Raymond Smullyan.

     'This Sentence is Unprovable in System S.'

     If it's false, it is provable in system S, which is impossible unless
S is inconsistent.  Therefore, it is true.  Therefore, it is unprovable
in system S.
     I imagine it would get more complicated if you used multivalued logic.


-- 
The Reverend with No Name             "I don't have to practice what I preach
@ The Lord Julius Cabal                because I'm not the kind of person I'm
...ihnp4!gargoyle!sphinx!hin9          preaching to." - J.R. "Bob" Dobbs.