Re: Resiliency To New Data Requirements
From: Neo <neo55592_at_hotmail.com>
Date: 7 Aug 2006 07:40:07 -0700
Message-ID: <1154961607.166006.100890_at_p79g2000cwp.googlegroups.com>
Date: 7 Aug 2006 07:40:07 -0700
Message-ID: <1154961607.166006.100890_at_p79g2000cwp.googlegroups.com>
Are RMDBs and dbd subject to Godel's Incompletenes Theorem which says something like:
"For any consistent formal theory that proves basic arithmetical truths, it is possible to construct an arithmetical statement that is true but not provable in the theory. That is, any consistent theory of a certain expressive strength is incomplete."
If so, what is a simple way to demonstate this in RMDBs and dbd. Received on Mon Aug 07 2006 - 16:40:07 CEST