Received: from uga.cc.uga.edu by nfs1.digex.net with SMTP id AA08156 (5.67b8/IDA-1.5 for ); Mon, 26 Sep 1994 19:17:47 -0400 Message-Id: <199409262317.AA08156@nfs1.digex.net> Received: from UGA.CC.UGA.EDU by uga.cc.uga.edu (IBM VM SMTP V2R2) with BSMTP id 0288; Mon, 26 Sep 94 19:22:37 EDT Received: from UGA.CC.UGA.EDU (NJE origin LISTSERV@UGA) by UGA.CC.UGA.EDU (LMail V1.2a/1.8a) with BSMTP id 1254; Mon, 26 Sep 1994 14:39:35 -0400 Date: Mon, 26 Sep 1994 11:40:29 EDT Reply-To: dave@VFL.PARAMAX.COM Sender: Lojban list From: David Matuszek Subject: Re: sinking feeling X-To: delaques@GCG.COM, lojban@cuvmb.cc.columbia.edu, LOJBAN%CUVMB.BITNET@uga.cc.uga.edu To: Bob LeChevalier In-Reply-To: Philip Delaquess's message of Fri, 23 Sep 1994 13:16:23 -0500 <9409232227.AA01543@arbor.VFL.Paramax.COM> Status: RO X-From-Space-Date: Mon Sep 26 19:17:55 1994 X-From-Space-Address: LOJBAN%CUVMB.BITNET@uga.cc.uga.edu Philip Delaquess writes > Y'know, friends, I've been reading the recent debate about 'any' with > a mixture of amusement and confusion for what seems like weeks now, > and this morning I got this kind of a sick, sinking feeling. It seems > to me that y'all are trying to codify a system that is 1) complete, > 2) consistant, and 3) capable of describing itself. Does the name > Kurt Godel ring any bells? Can somebody convince me that you're not > trying to do the impossible? Not to worry. What Goedel actually proved (serious oversimplification alert) was that if you have a formal system that is sufficiently expressive so that you can state, within the system, the proposition that the system is consistent, then you will be able to prove this proposition within the system if and only if the system is not in fact consistent. In other words, you cannot prove, within a consistent formal system, that the system you are in is consistent. Or, if you can prove it, it's because it isn't true (the system is broken, so you can prove all kinds of garbage in it, including consistency). Russell and Whitehead set out to prove that mathematics is consistent. They failed. Mathematics includes arithmetic, of course. Arithmetic, it turns out, is sufficiently expressive to make the claim that arithmetic is consistent. (Figuring out how to use things like "add" and "subtract" to say this is the really clever part, and constitutes about half of Goedel's proof.) Goedel basically said, hey, it's a good thing you failed, guys! Nowadays nobody much tries to prove mathematics is consistent--but most of us still take it for granted that arithmetic really is consistent. (I have my doubts -- I'm quite serious -- about calculus, but what the heck, it works.) So even if Lojban is complete (whatever THAT means), consistent (extremely unlikely, given its size and the difficulty of building even small consistent systems--but still a very worthy goal), and capable of describing itself (easy), we don't have to worry until some Lojbanist claims to have used Lojban to prove Lojban is consistent. -- dave@vfl.paramax.com -- If my header says otherwise, it lies. In memoriam: The Space Age, 1969-1972.