Article View: sci.philosophy.tech
Article #1330Re: Godel (short)
From: Michael P. Smith
Date: Mon, 05 Oct 1987 06:47
Date: Mon, 05 Oct 1987 06:47
12 lines
1014 bytes
1014 bytes
In article <2362@sphinx.uchicago.edu> hin9@sphinx.UUCP (The Reverend w. No Name) writes: > > '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. One reason the proof is so short is that you don't show how the provability of the godelian sentence in S would entail that S is inconsistent.
Technical Details
Message-ID:
<10368@duke.cs.duke.edu>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!rutgers!mcnc!duke!mpsReferences:
<2362@sphinx.uchicago.edu>Show Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!rutgers!mcnc!duke!mps From: mps@duke.cs.duke.edu (Michael P. Smith) Newsgroups: sci.philosophy.tech Subject: Re: Godel (short) Message-ID: <10368@duke.cs.duke.edu> Date: Mon, 5-Oct-87 02:47:12 EDT Article-I.D.: duke.10368 Posted: Mon Oct 5 02:47:12 1987 Date-Received: Thu, 8-Oct-87 01:04:25 EDT References: <2362@sphinx.uchicago.edu> Reply-To: mps@duke.UUCP (Michael P. Smith) Organization: Duke University, Durham NC Lines: 12 Summary: Too short