Re: So let me get this right: (Was: NFNF vs 1NF ...)
From: Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be>
Date: Sun, 13 Feb 2005 10:19:51 GMT
Message-ID: <bRFPd.10564$rr7.688170_at_phobos.telenet-ops.be>
>
> What would an untyped RVA be, and how could they lead to Russell's paradox?
Date: Sun, 13 Feb 2005 10:19:51 GMT
Message-ID: <bRFPd.10564$rr7.688170_at_phobos.telenet-ops.be>
Paul wrote:
> Jan Hidders wrote:
>
>> There are no theoretical problems with RVA's. Usually they are typed, >> which prevent's Russel's paradox, but even if you don't like that, >> then you can prevent it by restricting yourself to non-recursive >> values, and even if that is too strict for you you can use >> non-well-founded sets and still not have any problems with paradoxes.
>
> What would an untyped RVA be, and how could they lead to Russell's paradox?
An untyped RVA is an RVA that can contain any finite or infinite relation.
> I thought that you could only get Russell's paradox if you allowed RVAs
> to be relation variables rather than relation values?
- Jan Hidders