|
Re. the following:
what do you make
of Kurt Goedel's "incompleteness" theorems?
Comment:
Goedel's Proof states that "any
logical system adequate for number theory must contain propositions not provable
in that system."
All valid propositions in Euclidean
Geometry (or moves in Chess and plays in Contract
Bridge) are 'provable' with respect to the Set of Axioms which
comprise its Rules of the Game.
Gunnar
P.S. What was Major Douglas' take on Goedel's
theorem?
GT
----- Original Message -----
Sent: Friday, October 04, 2002 1:43
PM
Subject: Re: "theory"
[Tomasson] ...no set
of incomplete, inconsistent, and incoherent axiomatic premises can be
transformed into "a logical system".
---------------
Is that your
position? Then what do you make of Kurt Goedel's "incompleteness"
theorems?
>From: "Gunnar Tomasson"
[cut]
MSN Photos is the easiest way to share and print your photos: Click
Here
|