On Sun, Apr 30, 2006 at 01:43:08PM -0500, Chris Menzel wrote:
> (1) Each label h in L corresponds to exactly one proxy and vice versa.
> (2) Let P = L x V. P is the set of *properties*.
> (3) A *proxy* is a finite set of properties.
> (4) The set X of all proxies is the set of all subsets of P, i.e., X is
> the power set of P.
> Problem 1 can be avoided by (i) requiring the set L of labels and the
> set V of values to be finite, or (ii) allowing infinite proxies, or
> (iii) restricting the definition of the set X to the set of all
> *finite* subsets of P. Given that finitude is explicit in (4), (01)
Should be: (3), (02)
> its omission from (5) (03)
Should be: (4). (04)
> simply appears to be an oversight, so solution (iii) might be
> preferred here. (05)
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (07)