Re: continuum hypothesis and 0=1

Thanks!!! By the way I have another question:

On page 45 of Cohen's book one reads

"GENERALIZED INCOMPLETENESS THEOREM. Let S be a formal system whose
axioms are given by some recursive rule. If S is consistent, and the
p.r. functions can be imbedded in S, then Consis S cannot be proved in
S."

And at the bottom of the same page:

"The requirement that the axioms be given recursively is essential;
otherwise we could take for S the set of all true statements of Z_1."

I naively thought that a statement was considered to be true if it
could be derived from the axioms.

.

Relevant Pages

  • Re: continuum hypothesis and 0=1
    ... Let S be a formal system whose ... axioms are given by some recursive rule. ... "The requirement that the axioms be given recursively is essential; ... otherwise we could take for S the set of all true statements of Z_1." ...
    (sci.math)
  • Re: Goedel - interesting problem?
    ... of the Dolan piece on Goedel and again thank all worthy critics. ... "...any set of axioms at least as rich as the axioms of arithmetic has ... "Arithmetic or math, but not exactly, includes true statements that cannot ...
    (sci.logic)
  • Re: Goedel - interesting problem?
    ... For obvious reasons, ... >no set of axioms such that we can tell what's an axiom and what isn't. ... If that person rejects "axioms" as the "true statements which are ... the basic logic sense of a logical truth condition. ...
    (sci.logic)
  • Re: Raatikainens critique of Chaitin
    ... by the statement that some propositions are true for no reason. ... that could be proved within a formal system. ... So your question about axioms, etc, seems to me misplaced. ... in algorithmic information theory. ...
    (sci.math)
  • Re: 3rd paradox in Godels incompleteness theorem that makes it inva
    ... The proof is ABOUT the axioms of PM. ... That's right, EVERY such formal system, INCLUDING ... ONES THAT DON'T USE PM or reducibility. ... reducibility in order to represent all primitive recursive functions, ...
    (sci.logic)