Home -> Usenet -> comp.databases.theory -> Re: theory and practice: ying and yang

Re: theory and practice: ying and yang

From: Paul <paul_at_test.com>
Date: Sat, 28 May 2005 14:00:18 +0100
Message-ID: <42986b62$0$93748$ed2619ec_at_ptn-nntp-reader01.plus.net> 






mountain man wrote:

>>>Date ignores the proofs of Godel and Chaitin.
>>
>>This is plain nonsensical.




> 

> Codd, not Date, was the author of the RM.


> Codd reserves a place for nulls.

> Date does not.

> End of story.




How are nulls related to Godel and Chaitin?



Although Godel's theorems are named "undecidability" and
"incompleteness", I think this is in a totally different way to the
question of the use of nulls.



It seems to me that the null issue is all about whether unknown values
should be handled by the relational engine (as in SQL, using 3-valued
logic) or in the type engine, i.e. set up specifically for each domain/type.



Paul.
Received on Sat May 28 2005 - 15:00:18 CEST












Original text of this message