- From: Jan Grant <Jan.Grant@bristol.ac.uk>
- Date: Tue, 26 Nov 2002 15:36:40 +0000 (GMT)
- To: Jeremy Carroll <jjc@hpl.hp.com>
- cc: w3c-rdfcore-wg@w3.org
On Tue, 26 Nov 2002, Jeremy Carroll wrote: [pointer to good document] > Particularly any test that relies on finiteness of a datatype, or of an > intersection between datatypes. > > Another hard entailment: > > _:a rdfs:subClassOf xsd:postiveInteger . > _:a rdfs:subClassOf xsd:byte . > > entails > > _:a rdfs:subClassOf xsd:unsignedLong . > > > (I don't think my paper helps much with that one). This isn't a flaw in RDFS+D entailment, necessarily: that a formal system has unprovable truths is kinda one of those things. jan -- jan grant, ILRT, University of Bristol. http://www.ilrt.bris.ac.uk/ Tel +44(0)117 9287088 Fax +44 (0)117 9287112 http://ioctl.org/jan/ Goedel would be proud - I'm both inconsistent _and_ incomplete.
Received on Tuesday, 26 November 2002 10:38:11 UTC