Re: godel-like incompleteness of relational model
From: Paul <paul_at_test.com>
Date: Thu, 27 May 2004 10:42:34 +0100
Message-ID: <6Litc.7887$wI4.912910_at_wards.force9.net>
Date: Thu, 27 May 2004 10:42:34 +0100
Message-ID: <6Litc.7887$wI4.912910_at_wards.force9.net>
mountain man wrote:
>>I'm not entirely certain, but it seems to me that any logic model that
>>is consistent (i.e. theorems derived from the axioms do not contradict
>>the axioms or other theorems so derived) will be unable to find
>>certain truths within the system. And that seems to be Godel's sword
>>in the stone (you know, he's actually not the first to come up with
>>the idea, but the first to apply it to number theory). In other
>>words, pretty much everything is Godel-like, unless you adapt an
>>informal system, but then when you do that, you lose the power of
>>logic altogether.
> > Not necessarily. Deduction goes out the window, true, > but inference is still as valid as ever. The measure of the > power of inference over the power of deduction is a > tricky subject area, for sure.
What's the difference between inference and deduction? Are they not the same thing?
Paul. Received on Thu May 27 2004 - 11:42:34 CEST