• From: John Cowan <cowan@m...>
• To: Mike.Champion@S...
• Date: Mon, 07 May 2001 21:24:24 -0400 (EDT)

Mike.Champion@S... scripsit:

> The first is a Semantic Web use case I remember from somewhere, and the
> second is Goldbach's Conjecture, a (possibly) "true but unproveable"
> assertion often used as an example of a "Gödel sentence."  

An example of what *might* be a Goedel sentence: nobody knows for sure.
If it is unprovable, it has to be true, because if it were false,
there'd be a counterexample, which would mean it wasn't unprovable.
Still, lots of people thought Fermat's Last Theorem was unprovable too.

> Could it be
> that the "semantic web" as an axiomatic system will not be rich enough to
> contain arithmetic, but could be rich enough to perform any practical
> inference of use to us?

The Prolog inference system doesn't contain arithmetic, only finite-field
arithmetic, which is much weaker.  And yet useful work is done
in Prolog.

-- 
John Cowan                                   cowan@c...
One art/there is/no less/no more/All things/to do/with sparks/galore
	--Douglas Hofstadter

• References:
  • RE: NPR, Godel, Semantic Web
    • From: Mike.Champion@S...

• Prev by Date: RE: NPR, Godel, Semantic Web
• Next by Date: Regarding groups.
• Previous by thread: RE: NPR, Godel, Semantic Web
• Next by thread: Re: NPR, Godel, Semantic Web
• Index(es):
  • Date
  • Thread