Re: Goldbach Conjecture & the Foundation of First Order Logic.



Aatu Koskensilta wrote:

Nam Nguyen wrote:

1) If GC is *genuinely* true, it will be impossible to (informally and
arithmetically) know that. Equivalently, it will be impossible
to know a proof of GC in "PA".

2) If GC is *genuinely* false, it's still possible that it's impossible
to prove that in PA.


How do "*genuine*" truth and "*genuine*" falsity differ from ordinary truth and falsity in case of Pi-1 sentences in the language of arithmetic?

To be frank, I don't think there is any truth or falsity in the language
of arithmetic, or the *language* of anything, for that matter.



--
-----------------------------------------------------

What we call 'I' is just a swinging door which moves
when we inhale and exhale.
Shunryu Suzuki
----------------------------------------------------

.

Relevant Pages

  • Re: usenet kooks and a crank scale
    ... "Aatu Koskensilta" wrote in ... ... > expressible in the language of first order arithmetic a sentence F, ... "this sentence, me, can't be proved to people by reading formal theory T" can be expressed in FOL ... </schoolyard girly voice> ...
    (comp.theory)
  • Re: usenet kooks and a crank scale
    ... "Aatu Koskensilta" wrote in ... ... > expressible in the language of first order arithmetic a sentence F, ... "this sentence, me, can't be proved to people by reading formal theory T" can be expressed in FOL ... </schoolyard girly voice> ...
    (sci.math)
  • Re: usenet kooks and a crank scale
    ... "Aatu Koskensilta" wrote in ... ... > expressible in the language of first order arithmetic a sentence F, ... "this sentence, me, can't be proved to people by reading formal theory T" can be expressed in FOL ... </schoolyard girly voice> ...
    (sci.logic)
  • Re: Ross A. Finlayson, Question and Answer Period
    ... Aatu Koskensilta wrote: ... Is there a recursive set of sentences A in some second order ...
    (sci.logic)
  • Re: usenet kooks and a crank scale
    ... Aatu Koskensilta wrote: ... > P in the language of first order arithmetic with the property that P ... > true iff P is not provable (in the usual, ... his ramblings is an effect that the NASA mind ...
    (sci.math)