Re: [sl4] Is belief in immortality computable?

From: Tomaz Kristan (kristan@scientist.com)
Date: Tue May 26 2009 - 09:52:59 MDT


  ----- Original Message -----
  From: "John K Clark"
  To: "sl4 sl4" , "sl4 sl4"
  Subject: Re: [sl4] Is belief in immortality computable?
  Date: Fri, 22 May 2009 10:23:51 -0700

  On Thu, 21 May 2009 "Warrigal" Wrote:

>His proof states that there are true statements (that is to say
>statements where you will never find a counterexample to prove them
>wrong) that cannot be derived from any finite list of axioms.

  Not from any. It doesn't work that way.

  Say, that you have a nonprovable theorem. You may add it to your list
  as another axiom. Now, a new unprovable theorem will arise and you
  can add it to the list of axioms. And so on. It applies only for some
  axiomatic systems, not for all of them.

-- 
Be Yourself @ mail.com!
Choose From 200+ Email Addresses
Get a Free Account at www.mail.com


This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:04 MDT