Re: Godel's comments about the "true reason" for incompleteness

On 2008-03-18, in sci.logic, MoeBlee wrote:
What are you talking about? Do you contend that the proof is not
formalizable in PRA or Robinsion arithmetic or PA or even Z set theory
- all first order theories.

Godel's proof is not formalisable in Robinson arithmetic.

--
Aatu Koskensilta (aatu.koskensilta@xxxxxxxxx)

"Wovon man nicht sprechen kann, daruber muss man schweigen"
- Ludwig Wittgenstein, Tractatus Logico-Philosophicus
.

Relevant Pages

  • Re: Godels comments about the "true reason" for incompleteness
    ... formalizable in PRA or Robinsion arithmetic or PA or even Z set theory ... - all first order theories. ... Not bad for rookie off the bench. ...
    (sci.logic)
  • Re: kung fu mereotopology
    ... And you (Tonio), in that post, wrote: ... Moeblee was using the narrow definitions and notions that were given ... "and what you see as a set theory ... that's not how works in the flattened mereology. ...
    (sci.math)
  • Re: kung fu mereotopology
    ... GALATHAEA's arguments' weakness...nothing to do with Tommy or his TST ... Moeblee was using the narrow definitions and notions that were given ... "and what you see as a set theory ... that's not how works in the flattened mereology. ...
    (sci.math)
  • Re: Godel Contradiction
    ... MoeBlee writes: ... in PRA? ... Recall that Robinson arithmetic is very weak and in particular ...
    (sci.logic)
  • Re: Cantorian pseudomathematics
    ... >> Please cite a theorem of set theory such that its negation is a ... >> MoeBlee ... > infinite number of increments never achieving an infinite value flies ...
    (sci.math)