Re: what makes it true?

Timothy Little <tim-usenet@xxxxxxxxxxxxxxxxxx> writes:

> I may be mistaken, but isn't it a theorem that an undecidable
> proposition has both models where it is true and models where it is
> false?

Sure.

> Why do you accept only the models in which it is true?

It's not a matter of accepting anything except a perfectly ordinary
(and easily proved) mathematical theorem: if Goldbach's conjecture
is undecidable in PA, then it is true, that is, every even number
greater than 2 is the sum of two primes.
.

Relevant Pages

  • Re: representation
    ... To say that every positive integer is a sum of 4 squares is not the ... of primes. ... Another way to disprove the conjecture without producing an explicit ...
    (sci.math)
  • Re: Formulating sentences in a possibly consistent ZF
    ... You might be interested to know that Goldbach's weak conjecture, ... every integer greater than 5 can be written as the sum of 3 primes, ... That every odd number greater than 5 is the ...
    (sci.logic)
  • Re: representation
    ... To say that every positive integer is a sum of 4 squares is not the ... of primes. ... Another way to disprove the conjecture without producing an explicit ...
    (sci.math)
  • Re: TOMMYS CONJECTURE sorry quasi way above 5.
    ... every positive integer is the sum of at most 8 ... If Golbach's Conjecture is true, ... He conjectures that every positive integer is a sum ... squares of primes (where primes are extended to ...
    (sci.math)
  • Re: Goldbach Conjecture equivalency
    ... Vinogradrov proved that all every sufficiently large odd integers can ... be expressed as the sum of three primes. ... Prev by Date: ...
    (sci.math)