Re: Godel [was Re: qmail Re: freebsd - Re: recommended Virus Scanner?]

From: Tom (tb.31123.nospam_at_comcast.net)
Date: 11/30/03

  • Next message: John Smith: "Re: please send me the software" 
    Date: Sun, 30 Nov 2003 07:01:16 -0800
To: debian-user@lists.debian.org

    On Sun, Nov 30, 2003 at 09:27:37AM -0500, Carl Fink wrote:
    > On Sun, Nov 30, 2003 at 12:00:05AM -0800, Tom wrote:
    >
    > > ... that in any sufficiently complex formal system there are no guarantees
    > > it won't grind out falsehoods ...
    >
    > But Goedel's Theorem actually says that in any formal system, there will be
    > true propositions that cannot be proved (without going outside the system).
    > Nothing I've seen about grinding out falsehoods.

    I thought it was neither complete (the doesn't capture all truths thing)
    nor consistent (may contain both a statement and its complement)[1].
    But I can look that up.

    The Stanford prof told me the Lambda calculus (Lisp-ish stuff) almost
    proved one of the two. It looks like current metamathematics can have a
    set theory for intiutionists, one for computationalists, or other richer
    things, kind of like all the Non-euclidean geometries.

    I have many other things to say but this requires precision and this is
    OT. I'd love a crisp answer of "does this matter in everyday life."

    [1]-This was the assertion in "Illusion of Technique"

    > --
    > Carl Fink carl@fink.to
    > Jabootu's Minister of Proofreading
    > http://www.jabootu.com
    >
    >
    > --
    > To UNSUBSCRIBE, email to debian-user-request@lists.debian.org
    > with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org
    > 

    -- 
To UNSUBSCRIBE, email to debian-user-request@lists.debian.org 
with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org
  • Next message: John Smith: "Re: please send me the software"

    Relevant Pages

    • Re: Godel [was Re: qmail Re: freebsd - Re: recommended Virus Scanner?]
      ... > it won't grind out falsehoods ... ... But Goedel's Theorem actually says that in any formal system, ... true propositions that cannot be proved. ... Nothing I've seen about grinding out falsehoods. ...
      (Debian-User)
    • Re: what makes it true?
      ... grubb@xxxxxxxxxxxxxxxxx (Daniel Grubb) writes: ... > I can understand, given a formal system, whether I have a well formed ... > formal systems would be purely local if not for some type of set theory. ... All of this sounds very strange. ...
      (sci.math)
    • Re: what makes it true?
      ... >> I can understand, given a formal system, whether I have a well formed ... >> formal systems would be purely local if not for some type of set theory. ... > All of this sounds very strange. ... about whether it is in the set of provable statements from the theory. ...
      (sci.math)
    • Re: Request for Reference/Link to example of defining a theory/logic.
      ... that will emulate first-order logic and set theory. ... Long story not worth going into here. ... is incomplete and therefore I need a new improved formal system. ...
      (sci.logic)
    • Re: Request for Reference/Link to example of defining a theory/logic.
      ... I am requesting help in locating a link or reference showing an example ... I am constructing a formal system ... that will emulate first-order logic and set theory. ... show a much simpler representation of the axioms than ...
      (sci.logic)