• From: Mike.Champion@S...
• To: xml-dev@l...
• Date: Mon, 07 May 2001 22:11:04 -0400

> -----Original Message-----
> From: John Cowan [mailto:cowan@m...]
> Sent: Monday, May 07, 2001 9:24 PM
> To: Mike.Champion@S...
> Cc: xml-dev@l...
> Subject: Re: NPR, Godel, Semantic Web
>
>
> The Prolog inference system doesn't contain arithmetic, only
> finite-field
> arithmetic, which is much weaker.  And yet useful work is done
> in Prolog.

Very interesting ... so one wonders if Goedel's theorem has any implications for Prolog.  If not, I'd guess that the NPR show perpetuated a red herring.

So, are there any known "truths" expressible in Prolog that (plausibly) can't be "inferenced" with its rules? 

• Prev by Date: Re: XSD (was Re: The lists I monitor)
• Next by Date: Re: XML on OS/390
• Previous by thread: Re: NPR, Godel, Semantic Web
• Next by thread: RE: NPR, Godel, Semantic Web
• Index(es):
  • Date
  • Thread