> -----Original Message-----
> From: John Cowan [mailto:cowan@mercury.ccil.org]
> Sent: Monday, May 07, 2001 9:24 PM
> To: Mike.Champion@SoftwareAG-USA.com
> Cc: xml-dev@lists.xml.org
> 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?