[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: NPR, Godel, Semantic Web
--9dgjiU4MmWPVapMU Content-Type: text/plain; charset=us-ascii Content-Disposition: inline Content-Transfer-Encoding: quoted-printable On Mon, May 07, 2001 at 09:24:24PM -0400, John Cowan wrote: > Mike.Champion@S... scripsit: >=20 > > The first is a Semantic Web use case I remember from somewhere, and the > > second is Goldbach's Conjecture, a (possibly) "true but unproveable" > > assertion often used as an example of a "G?del sentence." =20 >=20 > An example of what *might* be a Goedel sentence: nobody knows for sure. > If it is unprovable, it has to be true, because if it were false, > there'd be a counterexample, which would mean it wasn't unprovable. > Still, lots of people thought Fermat's Last Theorem was unprovable too. That's only true in those cases where the idea of a counterexample makes sense. For example, the continuum hypothesis [1], that the size of the set of real numbers is the smallest number larger than the size of the integers, is undecideable. Yet Cohen, who proved the undecidability, believes the hypothesis to be false. =20 [1] http://www.ii.com/math/ch/ =20 sam th --- sam@u... --- http://www.abisource.com/~sam/ OpenPGP Key: CABD33FC --- http://samth.dyndns.org/key DeCSS: http://samth.dynds.org/decss --9dgjiU4MmWPVapMU Content-Type: application/pgp-signature Content-Disposition: inline -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.4 (GNU/Linux) Comment: For info see http://www.gnupg.org iD8DBQE6935Tt+kM0Mq9M/wRAqJRAJ9B17uKJZ0zpx6/0jFdUxK+etMYTACglHvX pORo/V0zfRNy6fYLbHo5VbI= =qmxE -----END PGP SIGNATURE----- --9dgjiU4MmWPVapMU--
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|