Xref: utzoo comp.ai:6959 comp.lang.lisp:3267
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!ut-emx!koen
From: koen@ut-emx.UUCP (Billy Koen)
Newsgroups: comp.ai,comp.lang.lisp
Subject: Help.Goedel.Lisp
Message-ID: <30992@ut-emx.UUCP>
Date: 5 Jun 90 21:59:48 GMT
Reply-To: koen@ut-emx.UUCP ( Billy Koen)
Organization: UTexas Computation Center, Austin, Texas
Lines: 6

~7
	During the mid-60Us at MIT, one of our professors (Minsky? Bobrow?) ask us to demonstrate/prove GoedelUs Proof in Lisp.  Now three decades later I would like to use it in the class room, but cannot remember the exact problem statement or the demonstation.  As we know GoedelUs Proof is constructive and presumeably the problem asked to construct the conditions under which the sentense RArithmetic is consistent.S is true in an environment of the axioms of arithmetic yielding as a condition RArithmetic is not

 consistentS or some such.    Any help with this problem or leads would be appreciated.  Thanx.

Billy Koen
koen@emx.utexas.edu

!@-:LaserWriter