Maximum cardinality of an RDF model

Working on the assumption that there's at most a countably
infinite set of URI(-refs) ... each is a finite sequence of
charaters drawn from a finite alphabet ... and similarly for
Literals, am I right to infer that,

1. there is at most a countable infinity of resources: because 
   every resource has a URI(-ref) and no two distinct resources 
   share a URI(-ref).

hence that,

2. the set Resources from rdfms 5.1, is at most countably
   infinite,

3. the set Properties from 5.3 is at most countably infinite:
   because a (proper) subset of Resources.

and hence that,

4. RDF models can contain at most countably many statements:
   becauce they're subsets of,

     Properties x Resources x (Resources U Literals)
    
   which is at most countably infinite because Properties,
   Resources and Literals are.

Cheers,


Miles

-- 
Miles Sabin                               InterX
Internet Systems Architect                5/6 Glenthorne Mews
+44 (0)20 8817 4030                       London, W6 0LJ, England
msabin@interx.com                         http://www.interx.com/