Re: Strawman Model Theory

Nice work, really!

[...]

> Let U be the set of URI References (as defined by RDF 2396).
                                                    ^^^RFC
>
>                           //ignore lang and namespaces for now
> Let S be the set of of UNICODE strings (UNICODE*)

I guess U and S are denumerable, no?

> An interpretation I consists of:
>
> A set R of thingies
>
> A subset P of thingies which corresponds to Properties
>
> A mapping IN : U -> R
>
> A mapping IEXT : P -> R x R            // R cross R

Isn't the notation f: A -> B used for a function with
domain A and range B?
But IEXT is not a funtion at all, it is a relation on
a cross product R x R which is simply a subset of R x R
IEXT(I(p)) = {<I(s),I(o)> el R x R: I(s) I(p) I(o) is true}

> A mapping IS : S -> R

[...]

--
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/

Received on Monday, 23 July 2001 13:26:38 UTC