W3C home > Mailing lists > Public > www-rdf-logic@w3.org > January 2001

Re: Maximum cardinality of an RDF model

From: Seth Russell <seth@robustai.net>
Date: Mon, 22 Jan 2001 16:30:44 -0800
Message-ID: <3A6CD0B3.7E0C139C@robustai.net>
To: pat hayes <phayes@ai.uwf.edu>
CC: Miles Sabin <MSabin@interx.com>, www-rdf-logic@w3.org
pat hayes wrote:

> Yes, you are right to infer that. However, your question raises
> another, related, issue: according to several members of the group
> which developed RDF, the 'graph model' of a set of RDF triplets is
> intended itself to be *the* model (in the sense from model theory) of
> those triplets. It follows that all RDF models of any RDF ontology
> (that could be stored on any web page, at any rate) must be not only
> countable, but finite. Now, since the finite-model restriction is not
> expressible in first-order (or any complete semi-decideable) logic,
> this would appear to indicate that RDF must have a semantics which
> has no semidecision procedure (and hence no proof procedure.)

So what would a graph model of triples need to have a proof procedure?

Seth Russell
Received on Monday, 22 January 2001 19:23:30 GMT

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