Re: How can the meaning of Goedel's unprovable statement descend from infinity?



mikeh106@xxxxxxxxxxx wrote:

I have thought hard about Goedel's Incompleteness Theorem since I
read a proof at age fifteen. My goal was to intuitively understand the
meaning of the unprovable statement. I now believe that while the
theorem is true, the statement is meaningless. It is just not the kind
of statement we would wish to prove in arithmetic.


Interesting. Godel showed, presumably, that if a formal system is
consistent, then there is no proof within that formal system that
proves that the formal system is consistent. However, if we insist that
the notion of proof must capture an intuitive notion of a "compelling
argument", then we realize that if we believe that the formal system
can prove anything at all, then at a minimum, we must already believe
that the formal system is consistent, (otherwise it could formally
prove anything, and hence it could prove nothing in the sense of a
compelling argument) -- the point being that Godel's theorem is already
implicit in our notion of belief. So maybe Godel's theorem is nothing
more than circular nonsense. However, currently, it is regarded as one
of the biggest advances in the field of logic in the twentieth century,
and any amateur who questions that will be denounced as a crackpot. So
my advice would be, unless you are certain that you want to get
involved with this topic, just ignore it and stay sane.

Anyway, I haven't actually read the rest of your article, and I don't
know if there is any argument of value there.

.



Relevant Pages

  • Re: Help. What is a model?
    ... Suppose I have a well defined formal system. ... has been used as the foundation for theories of meaning ... and has been formalised in computer science ... and the philosophy of meaning ...
    (sci.math)
  • Re: Equivalent modal logics
    ... >There is a theorem proved by Cresswell 1967 that for modal ... while with the other meaning "T is complete" doesn't quite make ... a formal system and a notion of sematics for ... >validates more formulas than T. Sure, if T is complete then S5 is ...
    (sci.logic)
  • Re: Comic Book Viewer
    ... "proof" has a specific meaning. ... a form of deduction associated with a deductive ... More formally, when applied to a formal system F, a proof is a ... sequence of well-formed formulas with each item in the sequence being ...
    (comp.sys.acorn.misc)
  • Re: (OT) Re: Object identity
    ... Consistency may be a property of a formal system, ... Therefore I *postulate* that a chosen formal system is consistent. ... Of course I can't prove Platonism. ... In a platonic Universe such lamp definitely exists. ...
    (comp.object)
  • Re: My talk about Godel to the post-grads.
    ... with a consistent 1st order formal system whose *only* model is the ... with a consistent first-order formal theory with whatever falls under ... If you want a finitely axiomatizable formal system, ... our knowledge of the naturals ...
    (sci.logic)