W3C home > Mailing lists > Public > www-rdf-logic@w3.org > May 2002

Re: A Single Foundational Logic for the Semantic Web

From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
Date: Wed, 01 May 2002 07:54:31 -0400
To: jos.deroo.jd@belgium.agfa.com
Cc: www-rdf-logic@w3.org
Message-Id: <20020501075431F.pfps@research.bell-labs.com>
From: "Jos De_Roo" <jos.deroo.jd@belgium.agfa.com>
Subject: Re: A Single Foundational Logic for the Semantic Web
Date: Wed, 1 May 2002 00:51:41 +0200

> 
> > A simple analysis shows than every formula has to exist in every model.
> 
> the simplest formula I can imagine is the empty graph { }
> and it doesn't have a model/interpretation (it's simply false)
> how could it exist in every model???
> 
> --
> Jos
> 

Simply.  Remember that these formulae are not asserted, i.e., they are not
triples themselves, they are just something like quoted expressions.  (Of
course, there are the triples that represent them *are* asserted triples in
the graph. So the formula

    {}

exists in every model/interpretation, but is not a member of log:Truth.

peter
Received on Wednesday, 1 May 2002 08:04:41 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:52:42 GMT