- From: Seth Russell <seth@robustai.net>
- Date: Mon, 22 Jan 2001 16:30:44 -0800
- 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 UTC