Re: What do you think of this argument



Ludovicus <luiroto@xxxxxxxxx> writes:

Dennis Sciama as cited in Gardner's "New Mathematical Diversions"
arguments:
...consequently if the assertion is undemonstrable it must be true.
The same is valid for any assertion whose falsity can be verified by a
counterexample.

Marcus de Sautoy in his book :"The Music of the Primes" arguments:
If someone succeeded on demonstrating that the hypothesis is
undecidable from the Mathematicsl axioms then the hypothesis
results demonstrated as true.

From my prior post on 23 May 2008:
William Elliot <ma...@xxxxxxxxxxxxxxxxxx> wrote:

What if, what if Goldbach's conjecture was unprovable?

If GC is independent of arithmetic then it is necessarily true,
because arithmetic is strong enough to verify any counterexample.
Technically one says that Peano arithmetic is Sigma-1 complete,
meaning that it is strong enough to provide proofs for all true
Sigma-1 (existential) formulas. For further discussion see my
prior posts in the threads [1], [2].

--Bill Dubuque

[1] http://google.com/groups?selm=y8zofcrm96d.fsf%40nestle.ai.mit.edu
[2] http://google.com/groups?selm=y8zhemkbuep.fsf%40nestle.ai.mit.edu
.



Relevant Pages

  • Re: What do you think of this argument
    ... Ludovicus wrote: ... ...consequently if the assertion is undemonstrable it must be true. ... The same is valid for any assertion whose falsity can be verified by a ... counterexample. ...
    (sci.math)
  • Re: "people" is not the plural of "person"
    ... But I'd say 'That assertion has the same truth value as ... > Mr. Cunningham is right, in his fashion, but I disagree with him. ... > counterexample in English usage to the statement that everyone knows that ...
    (alt.usage.english)
  • Re: Brittish and US SF
    ... that I realized his argument was limited to denying any logic or counterexample and restating his assertion. ...
    (rec.arts.sf.written)
  • Re: What do you think of this argument
    ... Ludovicus writes: ... ...consequently if the assertion is undemonstrable it must be true. ... The same is valid for any assertion whose falsity can be verified by a ... statement undecidable in a Sigma-1 complete theory is necessarily true. ...
    (sci.math)
  • Re: What do you think of this argument
    ... Ludovicus a écrit: ... ...consequently if the assertion is undemonstrable it must be true. ... The same is valid for any assertion whose falsity can be verified by a ... As you are a troll, I understand that this distinction might let you confused... ...
    (sci.math)