Re: godel-like incompleteness of relational model

• Post for FREE via your newsreader at post.usenet.com ****

"Paul" <paul_at_test.com> wrote in message news: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?

Deduction is a particular kind of inference.

-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

• Usenet.com - The #1 Usenet Newsgroup Service on The Planet! *** http://www.usenet.com Unlimited Download - 19 Seperate Servers - 90,000 groups - Uncensored -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=