Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #171074 > unrolled thread

Generalized Golbach Conjecture (gGC)

Started byKhong Dong <khongdongphong@gmail.com>
First post2018-01-25 22:27 -0800
Last post2018-02-05 19:18 -0800
Articles 20 on this page of 141 — 7 participants

Back to article view | Back to sci.logic


Contents

  Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-25 22:27 -0800
    Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-25 22:41 -0800
    Re: Generalized Golbach Conjecture (gGC) grahamcooper7@gmail.com - 2018-01-26 00:08 -0800
      Re: Generalized Golbach Conjecture (gGC) grahamcooper7@gmail.com - 2018-01-26 00:41 -0800
        Re: Generalized Golbach Conjecture (gGC) grahamcooper7@gmail.com - 2018-01-26 00:58 -0800
    Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-26 03:55 -0800
    Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-26 03:58 -0800
      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-26 07:42 -0800
        Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-26 07:46 -0800
          Re: Generalized Golbach Conjecture (gGC) grahamcooper7@gmail.com - 2018-01-26 14:33 -0800
          Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-29 15:54 -0800
            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-29 18:19 -0800
              Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-30 03:40 -0800
              Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 14:08 +0000
        Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-29 15:56 -0800
          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-29 18:21 -0800
            Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-30 03:42 -0800
              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 07:45 -0800
                Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 07:51 -0800
            Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:58 +0000
              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 19:00 -0800
          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-29 22:42 -0800
    Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-01-27 08:25 -0800
      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-27 09:58 -0800
        Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-01-28 12:55 -0800
          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-28 14:51 -0800
            Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-29 01:34 +0000
              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-28 17:55 -0800
                Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-29 02:07 +0000
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-28 18:31 -0800
                    Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-28 18:43 -0800
                      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-28 19:08 -0800
                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-29 12:54 +0000
                        Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-01-29 15:50 -0800
                    Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-29 11:57 +0000
              Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-01 04:57 -0800
                Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 14:11 +0000
                  Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-01 10:16 -0800
            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-28 20:24 -0800
              Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-29 12:03 +0000
                Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-29 16:17 +0000
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-29 18:35 -0800
                    Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 13:49 +0000
                      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 07:49 -0800
                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 17:03 +0000
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 17:58 -0800
                            Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 02:37 +0000
                              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 18:46 -0800
                                Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 02:59 +0000
                                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 19:02 -0800
                                    Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 03:10 +0000
                                      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 19:16 -0800
                                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 03:31 +0000
                                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 19:35 -0800
                                            Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 15:21 +0000
                                Re: Generalized Golbach Conjecture (gGC) Rupert <rupertmccallum@yahoo.com> - 2018-01-31 02:51 -0800
                        Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-04 17:22 -0800
                Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-29 19:22 -0800
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-29 22:49 -0800
                    Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:54 +0000
                  Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-30 16:26 +0000
                    Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 18:40 -0800
                      Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 04:16 +0000
                        Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 20:29 -0800
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 20:52 -0800
                            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-01-30 21:14 -0800
                          Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 20:40 +0000
            Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-01-31 12:08 -0800
              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-01 20:33 -0800
                Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-01 22:02 -0800
                Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-02 03:24 -0800
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-02 19:08 -0800
                    Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-02 20:50 -0800
                      Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-02 20:58 -0800
                      Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-02 21:03 -0800
                      Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-02 21:36 -0800
                        Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-02 23:49 -0800
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-03 00:07 -0800
                            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-03 00:19 -0800
                              Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-03 04:05 -0800
                                Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-03 10:46 -0800
                                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-03 20:34 -0800
                                    Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-04 03:29 -0800
                    Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-02 20:56 -0800
                Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-04 03:33 -0800
                Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-04 03:51 -0800
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-04 08:15 -0800
                    Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-04 14:22 -0800
                      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-04 14:45 -0800
                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-04 23:04 +0000
                        Re: Generalized Golbach Conjecture (gGC) Zuhair <zaljohar@gmail.com> - 2018-02-05 14:42 -0800
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 16:28 -0800
                            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 16:45 -0800
                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-06 13:43 +0000
                          Re: Generalized Golbach Conjecture (gGC) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-06 14:58 +0000
                            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-06 07:27 -0800
                Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-04 17:35 -0800
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-04 18:41 -0800
                    Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 11:17 -0800
                      Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 19:20 +0000
                        Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 11:35 -0800
                          Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 19:41 +0000
                            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 11:50 -0800
                              Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 20:07 +0000
                      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 12:11 -0800
                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 20:34 +0000
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 12:44 -0800
                            Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 20:52 +0000
                              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 13:21 -0800
                                Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 21:36 +0000
                                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 13:39 -0800
                                    Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 22:04 +0000
                                      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 14:25 -0800
                                        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 22:35 +0000
                                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 14:39 -0800
                            Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 23:27 +0000
                              Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 16:31 -0800
                      Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-05 18:52 -0800
                        Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 19:39 -0800
                          Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-06 12:33 -0800
                  Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-04 19:11 -0800
    Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-01 10:43 -0800
      Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-01 15:41 -0800
        Re: Generalized Golbach Conjecture (gGC) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 20:37 +0000
        Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-04 17:20 -0800
          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-04 19:24 -0800
            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-04 19:48 -0800
              Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-05 18:31 -0800
                Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 18:43 -0800
                  Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-05 18:57 -0800
                    Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 19:20 -0800
                  Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-05 19:09 -0800
                    Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-05 19:49 -0800
                      Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-06 12:33 -0800
                      Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-06 12:35 -0800
                        Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-06 14:40 -0800
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-06 21:50 -0800
                          Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-09 13:07 -0800
                            Re: Generalized Golbach Conjecture (gGC) Khong Dong <khongdongphong@gmail.com> - 2018-02-09 19:38 -0800
                  Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-05 19:14 -0800
                  Re: Generalized Golbach Conjecture (gGC) George Greene <greeneg@email.unc.edu> - 2018-02-05 19:18 -0800

Page 2 of 8 — ← Prev page 1 [2] 3 4 5 6 7 8  Next page →


#171421

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-30 19:00 -0800
Message-ID<007e4d35-acd3-47a7-9230-a1b1a8a3dc82@googlegroups.com>
In reply to#171380
On Tuesday, 30 January 2018 09:59:03 UTC-7, Peter Percival  wrote:
> Khong Dong wrote:
> > On Monday, 29 January 2018 16:56:25 UTC-7, George Greene  wrote:
> >> On Friday, January 26, 2018 at 10:42:18 AM UTC-5, Khong Dong wrote:
> >>> So you'd "know" gGC is true of the natural numbers just because you've added
> >>> as an axiom in (PA + gGC)? Wow!
> >>
> >> IF IT WERE TRUE, then that theory would know it, yes.
> >> If it weren't true, then that theory would be inconsistent,
> >> and if that is the case, THEN THAT IS ALREADY KNOWABLE because
> >> the calculations refuting it ARE FINITE.
> >>
> >>>
> >>> Ditto for ~gCG in (PA + gGC), right?
> >>
> >> NO, NOT ditto for ~cGC, because if cGC is false, then GC is false as well,
> >> and THAT IS KNOWABLE if it is the case.
> > 
> > Listen idiot, you're too late since I had that fixed in a subsequent post
> > already.
> > 
> 
> That's commendable (I mean the fixing, not the calling George an idiot). 
>   Are you now going to fix all your other errors? 

Idiotic ranting from the racist asshole Peter Percival: George was late and
you are stupid asshole liar because that was just typo which was recognized by
me first and fixed it in:

https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/0NFtgTe2AwAJ

<quote>
That is: "in (PA + ~gGC)" 
</quote>

You two are way too late idiotically.

[toc] | [prev] | [next] | [standalone]


#171328

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-29 22:42 -0800
Message-ID<1e47d8a8-dfbc-4bfc-b797-6895ea871834@googlegroups.com>
In reply to#171286
On Monday, 29 January 2018 16:56:25 UTC-7, George Greene  wrote:
> On Friday, January 26, 2018 at 10:42:18 AM UTC-5, Khong Dong wrote:
> > So you'd "know" gGC is true of the natural numbers just because you've added
> > as an axiom in (PA + gGC)? Wow!
> 
> IF IT WERE TRUE, then that theory would know it, yes.
> If it weren't true, then that theory would be inconsistent,
> and if that is the case, THEN THAT IS ALREADY KNOWABLE because
> the calculations refuting it ARE FINITE.

Ok, cool. So what is the truth value of gGC: true? or false?

[toc] | [prev] | [next] | [standalone]


#171181

FromZuhair <zaljohar@gmail.com>
Date2018-01-27 08:25 -0800
Message-ID<1fb26112-15b2-4f62-9eff-e7180f9a4127@googlegroups.com>
In reply to#171074
On Friday, January 26, 2018 at 9:28:02 AM UTC+3, Khong Dong wrote:
> gGC <-> "There exists an even number greater than 4 beyond which each even
>          number is a sum of two primes".
> 
> While it's possible to find a specific counter example of Goldbach Conjecture
> (GC), hence proving GC false of the natural numbers, it's impossible to know
> whether or not gGC is true or false. 

Is there a proof that gGC is undecidable in PA??
If so then this would be a really strong result! since this proves a hard case of incompleteness of PA, since gGC is no doubt a statement that belongs to mathematics proper.

Again I repeat my question, is there any proof that gGC is undecidable in PA? or it is just a guess that it is so?

Zuhair

[toc] | [prev] | [next] | [standalone]


#171186

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-27 09:58 -0800
Message-ID<a4d71deb-432c-4ffc-aba4-6a864ed3ba39@googlegroups.com>
In reply to#171181
On Saturday, 27 January 2018 09:25:12 UTC-7, Zuhair  wrote:
> On Friday, January 26, 2018 at 9:28:02 AM UTC+3, Khong Dong wrote:
> > gGC <-> "There exists an even number greater than 4 beyond which each even
> >          number is a sum of two primes".
> > 
> > While it's possible to find a specific counter example of Goldbach Conjecture
> > (GC), hence proving GC false of the natural numbers, it's impossible to know
> > whether or not gGC is true or false. 
> 
> Is there a proof that gGC is undecidable in PA??
> If so then this would be a really strong result! since this proves a hard
> case of incompleteness of PA, since gGC is no doubt a statement that belongs
> to mathematics proper.
> 
> Again I repeat my question, is there any proof that gGC is undecidable in PA?
> or it is just a guess that it is so?

There is and was presented a few times as part of undecide(N |= cGC). The meta
proof is an extension of the proof that TRUE(N |= GC) => nK(N |= GC), which is
part of the proof undecide(N |= cGC).

If _you_ yourself are interested for me to revisit it step by step I certainly
would try to re-present it (I kind of loose faith that the other guys are able
to understand the steps, they having been unable in the past).

[toc] | [prev] | [next] | [standalone]


#171244

FromZuhair <zaljohar@gmail.com>
Date2018-01-28 12:55 -0800
Message-ID<f5e941f3-3c64-4a68-8118-2288b1705b08@googlegroups.com>
In reply to#171186
On Saturday, January 27, 2018 at 8:58:19 PM UTC+3, Khong Dong wrote:
> On Saturday, 27 January 2018 09:25:12 UTC-7, Zuhair  wrote:
> > On Friday, January 26, 2018 at 9:28:02 AM UTC+3, Khong Dong wrote:
> > > gGC <-> "There exists an even number greater than 4 beyond which each even
> > >          number is a sum of two primes".
> > > 
> > > While it's possible to find a specific counter example of Goldbach Conjecture
> > > (GC), hence proving GC false of the natural numbers, it's impossible to know
> > > whether or not gGC is true or false. 
> > 
> > Is there a proof that gGC is undecidable in PA??
> > If so then this would be a really strong result! since this proves a hard
> > case of incompleteness of PA, since gGC is no doubt a statement that belongs
> > to mathematics proper.
> > 
> > Again I repeat my question, is there any proof that gGC is undecidable in PA?
> > or it is just a guess that it is so?
> 
> There is and was presented a few times as part of undecide(N |= cGC). The meta
> proof is an extension of the proof that TRUE(N |= GC) => nK(N |= GC), which is
> part of the proof undecide(N |= cGC).
> 
> If _you_ yourself are interested for me to revisit it step by step I certainly
> would try to re-present it (I kind of loose faith that the other guys are able
> to understand the steps, they having been unable in the past).

Well I'm not sure that I have the needed technical stuff to understand the proof in your mind, but certainly, I'm interested, I'll try my best to understand a clear simple well-written presentation of the proof.

Zuhair

[toc] | [prev] | [next] | [standalone]


#171245

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-28 14:51 -0800
Message-ID<e5a07a90-ff26-4c23-9507-992d07346f0f@googlegroups.com>
In reply to#171244
On Sunday, 28 January 2018 13:55:34 UTC-7, Zuhair  wrote:
> On Saturday, January 27, 2018 at 8:58:19 PM UTC+3, Khong Dong wrote:
> > On Saturday, 27 January 2018 09:25:12 UTC-7, Zuhair  wrote:
> > > On Friday, January 26, 2018 at 9:28:02 AM UTC+3, Khong Dong wrote:
> > > > gGC <-> "There exists an even number greater than 4 beyond which each even
> > > >          number is a sum of two primes".
> > > > 
> > > > While it's possible to find a specific counter example of Goldbach Conjecture
> > > > (GC), hence proving GC false of the natural numbers, it's impossible to know
> > > > whether or not gGC is true or false. 
> > > 
> > > Is there a proof that gGC is undecidable in PA??
> > > If so then this would be a really strong result! since this proves a hard
> > > case of incompleteness of PA, since gGC is no doubt a statement that belongs
> > > to mathematics proper.
> > > 
> > > Again I repeat my question, is there any proof that gGC is undecidable in PA?
> > > or it is just a guess that it is so?
> > 
> > There is and was presented a few times as part of undecide(N |= cGC). The meta
> > proof is an extension of the proof that TRUE(N |= GC) => nK(N |= GC), which is
> > part of the proof undecide(N |= cGC).
> > 
> > If _you_ yourself are interested for me to revisit it step by step I certainly
> > would try to re-present it (I kind of loose faith that the other guys are able
> > to understand the steps, they having been unable in the past).
> 
> Well I'm not sure that I have the needed technical stuff to understand the proof in your mind, but certainly, I'm interested, I'll try my best to understand a clear simple well-written presentation of the proof.

Thank you for your being interested. I'll try my best and will break it up into
many stages. But first off let me assure you that this has nothing to do with
sophisticated mathematical techniques such as tensor analysis, convoluted
multidimensional integration results, or deep topology theorems, etc...: it
only requires basic - untainted - understanding of FOL= paradigms of language 
structures and of formal system provability.

The caveat and difficulty would be that since this is a meta mathematical proof
we have to be conscious, agnostic, which assumptions we're using and whether or
not these assumptions are logically valid (acceptable) however familiar or not:
*we'd take for granted nothing*.

As a veteran (who hasn't frequented sci.logic for a while) once suggested a
good advice, I won't just "throw out" a bunch of technicalities for consumption
but first would present a road-map as to how the meta proof would be done, as
below.

====================> Road map to the meta proof.

R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
     system. This is meta mathematical proof using agreed valid knowledge
     about FOL frame-work or reasoning.

R2 - We'd recognize the concept of the natural numbers is an *informal concept*
     in the sense that *IF* N is a language structure for L(PA), the language
     of arithmetic, and F is a formula-sentence expressing an arithmetical
     truth of the concept of the natural numbers then:

     ARITHMETICALLY-TRUE(F) => (N |= F)

R3 - We'd recognize the general logic law of though that if there can not be
     sufficient information to deduce a meta statement S as materially true (in
     an abstract sense) then it's not possible to verify - to know - that S is
     materially true. 
 
R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
     adequately express the informal knowledge of the concept of the natural
     numbers.

R5 - We'll use some particular uncountable collection K of language structures
     for L(PA) to prove that should PA be consistent and have a model N in K,
     then undecide(N |= gGC), hence undecide(PA |- gGC).

That's a road map and let's proceed one step at a time: if we don't succeed in
having a mutual understanding at one particular step we'll not move to the
next one. If you could just let me know which of road map steps above you'd
like for me to begin that would be great. Thanks.

[toc] | [prev] | [next] | [standalone]


#171249

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-29 01:34 +0000
Message-ID<87tvv5fnwu.fsf@bsb.me.uk>
In reply to#171245
Khong Dong <khongdongphong@gmail.com> writes:
<snip>
> ====================> Road map to the meta proof.
>
> R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
>      system. This is meta mathematical proof using agreed valid knowledge
>      about FOL frame-work or reasoning.
>
> R2 - We'd recognize the concept of the natural numbers is an *informal concept*
>      in the sense that *IF* N is a language structure for L(PA), the language
>      of arithmetic, and F is a formula-sentence expressing an arithmetical
>      truth of the concept of the natural numbers then:
>
>      ARITHMETICALLY-TRUE(F) => (N |= F)
>
> R3 - We'd recognize the general logic law of though that if there can not be
>      sufficient information to deduce a meta statement S as materially true (in
>      an abstract sense) then it's not possible to verify - to know - that S is
>      materially true. 
>  
> R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
>      adequately express the informal knowledge of the concept of the natural
>      numbers.
>
> R5 - We'll use some particular uncountable collection K of language structures
>      for L(PA) to prove that should PA be consistent and have a model N in K,
>      then undecide(N |= gGC), hence undecide(PA |- gGC).

What's wrong with the proof you claimed to have 6 years ago?  Did you
find a mistake in it?  If so, what was it?

Zuhair, if Nam confirms that he knows of no errors in the old proof, I
could post that one to you.  It's much simpler than this one since it
does not rely on an uncountable collection of language structures.  For
that matter, I could post it to you anyway, since it would make an
interesting comparison.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171250

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-28 17:55 -0800
Message-ID<798f2334-b272-4989-913a-71015129a4d8@googlegroups.com>
In reply to#171249
On Sunday, 28 January 2018 18:34:47 UTC-7, Ben Bacarisse  wrote:
> Khong Dong <khongdongphong@gmail.com> writes:
> <snip>
> > ====================> Road map to the meta proof.
> >
> > R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
> >      system. This is meta mathematical proof using agreed valid knowledge
> >      about FOL frame-work or reasoning.
> >
> > R2 - We'd recognize the concept of the natural numbers is an *informal concept*
> >      in the sense that *IF* N is a language structure for L(PA), the language
> >      of arithmetic, and F is a formula-sentence expressing an arithmetical
> >      truth of the concept of the natural numbers then:
> >
> >      ARITHMETICALLY-TRUE(F) => (N |= F)
> >
> > R3 - We'd recognize the general logic law of though that if there can not be
> >      sufficient information to deduce a meta statement S as materially true (in
> >      an abstract sense) then it's not possible to verify - to know - that S is
> >      materially true. 
> >  
> > R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
> >      adequately express the informal knowledge of the concept of the natural
> >      numbers.
> >
> > R5 - We'll use some particular uncountable collection K of language structures
> >      for L(PA) to prove that should PA be consistent and have a model N in K,
> >      then undecide(N |= gGC), hence undecide(PA |- gGC).
> 
> What's wrong with the proof you claimed to have 6 years ago?  Did you
> find a mistake in it?  If so, what was it?

Sounds like the beginning of another _fierce_ Inquisitional flame-war to me
but I'll respect the fact that Zuhair would have a call here as to what he'd
decide to hear/do, and I'll go from there.

> 
> Zuhair, if Nam confirms that he knows of no errors in the old proof, I
> could post that one to you.  It's much simpler than this one since it
> does not rely on an uncountable collection of language structures.  For
> that matter, I could post it to you anyway, since it would make an
> interesting comparison.
> 
> -- 
> Ben.

[toc] | [prev] | [next] | [standalone]


#171251

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-29 02:07 +0000
Message-ID<87o9ldfmdh.fsf@bsb.me.uk>
In reply to#171250
Khong Dong <khongdongphong@gmail.com> writes:

> On Sunday, 28 January 2018 18:34:47 UTC-7, Ben Bacarisse  wrote:
>> Khong Dong <khongdongphong@gmail.com> writes:
>> <snip>
>> > ====================> Road map to the meta proof.
>> >
>> > R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
>> >      system. This is meta mathematical proof using agreed valid knowledge
>> >      about FOL frame-work or reasoning.
>> >
>> > R2 - We'd recognize the concept of the natural numbers is an *informal concept*
>> >      in the sense that *IF* N is a language structure for L(PA), the language
>> >      of arithmetic, and F is a formula-sentence expressing an arithmetical
>> >      truth of the concept of the natural numbers then:
>> >
>> >      ARITHMETICALLY-TRUE(F) => (N |= F)
>> >
>> > R3 - We'd recognize the general logic law of though that if there can not be
>> >      sufficient information to deduce a meta statement S as materially true (in
>> >      an abstract sense) then it's not possible to verify - to know - that S is
>> >      materially true. 
>> >  
>> > R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
>> >      adequately express the informal knowledge of the concept of the natural
>> >      numbers.
>> >
>> > R5 - We'll use some particular uncountable collection K of language structures
>> >      for L(PA) to prove that should PA be consistent and have a model N in K,
>> >      then undecide(N |= gGC), hence undecide(PA |- gGC).
>> 
>> What's wrong with the proof you claimed to have 6 years ago?  Did you
>> find a mistakeasonablee in it?  If so, what was it?
>
> Sounds like the beginning of another _fierce_ Inquisitional flame-war
> to me

I thought it was a reasonable question.  Six years ago you claimed to
have a proof (much simpler than this road map suggests) so it seemed
like an obvious question to ask what you think is wrong with it.  I
didn't expect you to answer of course, but that too could be
informative.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171252

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-28 18:31 -0800
Message-ID<0159d7db-d1c8-4cf5-89f5-1539fac52cde@googlegroups.com>
In reply to#171251
On Sunday, 28 January 2018 19:07:56 UTC-7, Ben Bacarisse  wrote:
> Khong Dong <khongdongphong@gmail.com> writes:
> 
> > On Sunday, 28 January 2018 18:34:47 UTC-7, Ben Bacarisse  wrote:
> >> Khong Dong <khongdongphong@gmail.com> writes:
> >> <snip>
> >> > ====================> Road map to the meta proof.
> >> >
> >> > R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
> >> >      system. This is meta mathematical proof using agreed valid knowledge
> >> >      about FOL frame-work or reasoning.
> >> >
> >> > R2 - We'd recognize the concept of the natural numbers is an *informal concept*
> >> >      in the sense that *IF* N is a language structure for L(PA), the language
> >> >      of arithmetic, and F is a formula-sentence expressing an arithmetical
> >> >      truth of the concept of the natural numbers then:
> >> >
> >> >      ARITHMETICALLY-TRUE(F) => (N |= F)
> >> >
> >> > R3 - We'd recognize the general logic law of though that if there can not be
> >> >      sufficient information to deduce a meta statement S as materially true (in
> >> >      an abstract sense) then it's not possible to verify - to know - that S is
> >> >      materially true. 
> >> >  
> >> > R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
> >> >      adequately express the informal knowledge of the concept of the natural
> >> >      numbers.
> >> >
> >> > R5 - We'll use some particular uncountable collection K of language structures
> >> >      for L(PA) to prove that should PA be consistent and have a model N in K,
> >> >      then undecide(N |= gGC), hence undecide(PA |- gGC).
> >> 
> >> What's wrong with the proof you claimed to have 6 years ago?  Did you
> >> find a mistakeasonablee in it?  If so, what was it?
> >
> > Sounds like the beginning of another _fierce_ Inquisitional flame-war
> > to me
> 
> I thought it was a reasonable question.  Six years ago you claimed to
> have a proof (much simpler than this road map suggests) so it seemed
> like an obvious question to ask what you think is wrong with it.  I
> didn't expect you to answer of course, but that too could be
> informative.

You're completely mistaken. The essence of the proof is unchanged but for 6-8
years there are countless versions or posts of explaining various detailed
subtleties - even requested from your side - but you and few friends from your
side were too incompetent, occupied with being inquisitional/racist, or with
Nam's Bachelor Degree, or with lying to Nam and sci.logic in straight face, ... 
to understand.

The key parts of the proof were two threads in MSE as well, were you competent
enough to understand, BB? I'd guess not. Anyway, can you not hijack the
conversation between Zuhair and me until it's done?

[toc] | [prev] | [next] | [standalone]


#171254

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-28 18:43 -0800
Message-ID<9bb0847e-1676-4484-bde2-79d4c365e8af@googlegroups.com>
In reply to#171252
On Sunday, January 28, 2018 at 9:31:31 PM UTC-5, Khong Dong wrote:
> The key parts of the proof were two threads in MSE

Where they were completely ignored or dismissed.

[toc] | [prev] | [next] | [standalone]


#171257

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-28 19:08 -0800
Message-ID<9c6f13a1-b24a-4442-86a7-2e74976679f8@googlegroups.com>
In reply to#171254
On Sunday, 28 January 2018 19:43:49 UTC-7, George Greene  wrote:
> On Sunday, January 28, 2018 at 9:31:31 PM UTC-5, Khong Dong wrote:
> > The key parts of the proof were two threads in MSE
> 
> Where they were completely ignored or dismissed.

You're a liar, George Greene.

[toc] | [prev] | [next] | [standalone]


#171275

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-01-29 12:54 +0000
Message-ID<p4n5i3$q36$1@news.albasani.net>
In reply to#171257
Khong Dong wrote:
> On Sunday, 28 January 2018 19:43:49 UTC-7, George Greene  wrote:
>> On Sunday, January 28, 2018 at 9:31:31 PM UTC-5, Khong Dong wrote:
>>> The key parts of the proof were two threads in MSE
>>
>> Where they were completely ignored or dismissed.
> 
> You're a liar, George Greene.
> 
Your MSE contribution has been delete because it was judged off-topic. 
If that's not dismissed, what is?

[toc] | [prev] | [next] | [standalone]


#171284

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-29 15:50 -0800
Message-ID<41dd801a-b094-4583-860b-882cd381ca59@googlegroups.com>
In reply to#171257
On Sunday, January 28, 2018 at 10:08:14 PM UTC-5, Khong Dong wrote:
> On Sunday, 28 January 2018 19:43:49 UTC-7, George Greene  wrote:
> > On Sunday, January 28, 2018 at 9:31:31 PM UTC-5, Khong Dong wrote:
> > > The key parts of the proof were two threads in MSE
> > 
> > Where they were completely ignored or dismissed.
> 
> You're a liar, George Greene.

Anybody is welcome to visit the threads and check for themselves.
For better or for worse, the other people still here have better things to do with their time.

[toc] | [prev] | [next] | [standalone]


#171273

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-29 11:57 +0000
Message-ID<87607kg9ny.fsf@bsb.me.uk>
In reply to#171252
Khong Dong <khongdongphong@gmail.com> writes:

> On Sunday, 28 January 2018 19:07:56 UTC-7, Ben Bacarisse  wrote:
>> Khong Dong <khongdongphong@gmail.com> writes:
>> 
>> > On Sunday, 28 January 2018 18:34:47 UTC-7, Ben Bacarisse  wrote:
>> >> Khong Dong <khongdongphong@gmail.com> writes:
>> >> <snip>
>> >> > ====================> Road map to the meta proof.
>> >> >
>> >> > R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
>> >> >      system. This is meta mathematical proof using agreed valid knowledge
>> >> >      about FOL frame-work or reasoning.
>> >> >
>> >> > R2 - We'd recognize the concept of the natural numbers is an *informal concept*
>> >> >      in the sense that *IF* N is a language structure for L(PA), the language
>> >> >      of arithmetic, and F is a formula-sentence expressing an arithmetical
>> >> >      truth of the concept of the natural numbers then:
>> >> >
>> >> >      ARITHMETICALLY-TRUE(F) => (N |= F)
>> >> >
>> >> > R3 - We'd recognize the general logic law of though that if there can not be
>> >> >      sufficient information to deduce a meta statement S as materially true (in
>> >> >      an abstract sense) then it's not possible to verify - to know - that S is
>> >> >      materially true. 
>> >> >  
>> >> > R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
>> >> >      adequately express the informal knowledge of the concept of the natural
>> >> >      numbers.
>> >> >
>> >> > R5 - We'll use some particular uncountable collection K of language structures
>> >> >      for L(PA) to prove that should PA be consistent and have a model N in K,
>> >> >      then undecide(N |= gGC), hence undecide(PA |- gGC).
>> >> 
>> >> What's wrong with the proof you claimed to have 6 years ago?  Did you
>> >> find a mistakeasonablee in it?  If so, what was it?
>> >
>> > Sounds like the beginning of another _fierce_ Inquisitional flame-war
>> > to me
>> 
>> I thought it was a reasonable question.  Six years ago you claimed to
>> have a proof (much simpler than this road map suggests) so it seemed
>> like an obvious question to ask what you think is wrong with it.  I
>> didn't expect you to answer of course, but that too could be
>> informative.
>
> You're completely mistaken.

So, Zuhair, there is already a short proof you can read.  No need to get
sucked into this super-complex road map!

> The essence of the proof is unchanged but for 6-8
> years there are countless versions or posts of explaining various detailed
> subtleties

So the document you have will be vastly improved on the one I have.
Just send that to Zuhair or post it here.

You've decided not to publish but rather talk to people you call liars,
racists and torturers in an obscure corner of the Internet.  That's an
odd decision but there is no reason Zuhair has to suffer for it.
Despite not having a paper written there is, surely, a proof written out
somewhere with the benefit of these 8 years if "clarification".

<snip>
-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171585

FromZuhair <zaljohar@gmail.com>
Date2018-02-01 04:57 -0800
Message-ID<0abd002e-9e77-4cab-95ba-4f959566cf11@googlegroups.com>
In reply to#171249
On Monday, January 29, 2018 at 4:34:47 AM UTC+3, Ben Bacarisse wrote:
> It's much simpler than this one since it
> does not rely on an uncountable collection of language structures.  For
> that matter, I could post it to you anyway, since it would make an
> interesting comparison.
> 
> -- 
> Ben.

Please do!

[toc] | [prev] | [next] | [standalone]


#171586

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-01 14:11 +0000
Message-ID<87inbg94v5.fsf@bsb.me.uk>
In reply to#171585
Zuhair <zaljohar@gmail.com> writes:

> On Monday, January 29, 2018 at 4:34:47 AM UTC+3, Ben Bacarisse wrote:
>> ... I could post it to you anyway, since it would make an
>> interesting comparison.
>
> Please do!

OK, done.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171615

FromZuhair <zaljohar@gmail.com>
Date2018-02-01 10:16 -0800
Message-ID<271ab443-101f-4e79-86d3-3c453e75b5be@googlegroups.com>
In reply to#171586
On Thursday, February 1, 2018 at 5:11:46 PM UTC+3, Ben Bacarisse wrote:
> Zuhair <zaljohar@gmail.com> writes:
> 
> > On Monday, January 29, 2018 at 4:34:47 AM UTC+3, Ben Bacarisse wrote:
> >> ... I could post it to you anyway, since it would make an
> >> interesting comparison.
> >
> > Please do!
> 
> OK, done.
> 
> -- 
> Ben.

Thank you!

[toc] | [prev] | [next] | [standalone]


#171261

FromKhong Dong <khongdongphong@gmail.com>
Date2018-01-28 20:24 -0800
Message-ID<88cfd33c-cb18-4dab-9284-6ce7fe64845c@googlegroups.com>
In reply to#171245
On Sunday, 28 January 2018 15:51:49 UTC-7, Khong Dong  wrote:
> On Sunday, 28 January 2018 13:55:34 UTC-7, Zuhair  wrote:
> > On Saturday, January 27, 2018 at 8:58:19 PM UTC+3, Khong Dong wrote:
> > > On Saturday, 27 January 2018 09:25:12 UTC-7, Zuhair  wrote:
> > > > On Friday, January 26, 2018 at 9:28:02 AM UTC+3, Khong Dong wrote:
> > > > > gGC <-> "There exists an even number greater than 4 beyond which each even
> > > > >          number is a sum of two primes".
> > > > > 
> > > > > While it's possible to find a specific counter example of Goldbach Conjecture
> > > > > (GC), hence proving GC false of the natural numbers, it's impossible to know
> > > > > whether or not gGC is true or false. 
> > > > 
> > > > Is there a proof that gGC is undecidable in PA??
> > > > If so then this would be a really strong result! since this proves a hard
> > > > case of incompleteness of PA, since gGC is no doubt a statement that belongs
> > > > to mathematics proper.
> > > > 
> > > > Again I repeat my question, is there any proof that gGC is undecidable in PA?
> > > > or it is just a guess that it is so?
> > > 
> > > There is and was presented a few times as part of undecide(N |= cGC). The meta
> > > proof is an extension of the proof that TRUE(N |= GC) => nK(N |= GC), which is
> > > part of the proof undecide(N |= cGC).
> > > 
> > > If _you_ yourself are interested for me to revisit it step by step I certainly
> > > would try to re-present it (I kind of loose faith that the other guys are able
> > > to understand the steps, they having been unable in the past).
> > 
> > Well I'm not sure that I have the needed technical stuff to understand the proof in your mind, but certainly, I'm interested, I'll try my best to understand a clear simple well-written presentation of the proof.
> 
> Thank you for your being interested. I'll try my best and will break it up into
> many stages. But first off let me assure you that this has nothing to do with
> sophisticated mathematical techniques such as tensor analysis, convoluted
> multidimensional integration results, or deep topology theorems, etc...: it
> only requires basic - untainted - understanding of FOL= paradigms of language 
> structures and of formal system provability.
> 
> The caveat and difficulty would be that since this is a meta mathematical proof
> we have to be conscious, agnostic, which assumptions we're using and whether or
> not these assumptions are logically valid (acceptable) however familiar or not:
> *we'd take for granted nothing*.
> 
> As a veteran (who hasn't frequented sci.logic for a while) once suggested a
> good advice, I won't just "throw out" a bunch of technicalities for consumption
> but first would present a road-map as to how the meta proof would be done, as
> below.
> 
> ====================> Road map to the meta proof.
> 
> R1 - We'd recognize this is _not_ a plain old FOL proof in a formal
>      system. This is meta mathematical proof using agreed valid knowledge
>      about FOL frame-work or reasoning.
> 
> R2 - We'd recognize the concept of the natural numbers is an *informal concept*
>      in the sense that *IF* N is a language structure for L(PA), the language
>      of arithmetic, and F is a formula-sentence expressing an arithmetical
>      truth of the concept of the natural numbers then:
> 
>      ARITHMETICALLY-TRUE(F) => (N |= F)
> 
> R3 - We'd recognize the general logic law of though that if there can not be
>      sufficient information to deduce a meta statement S as materially true (in
>      an abstract sense) then it's not possible to verify - to know - that S is
>      materially true. 
>  
> R4 - We'd recognize (and can prove) that even if PA is consistent, it can't
>      adequately express the informal knowledge of the concept of the natural
>      numbers.
> 
> R5 - We'll use some particular uncountable collection K of language structures
>      for L(PA) to prove that should PA be consistent and have a model N in K,
>      then undecide(N |= gGC), hence undecide(PA |- gGC).
> 
> That's a road map and let's proceed one step at a time: if we don't succeed in
> having a mutual understanding at one particular step we'll not move to the
> next one. If you could just let me know which of road map steps above you'd
> like for me to begin that would be great. Thanks.

I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can
always go back to them at ease. 

But it's up to you of course.

[toc] | [prev] | [next] | [standalone]


#171274

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-29 12:03 +0000
Message-ID<87zi4weutb.fsf@bsb.me.uk>
In reply to#171261
Khong Dong <khongdongphong@gmail.com> writes:
<snip>
> I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can
> always go back to them at ease.

Or you could send him the proof that now benefits from 6-8 years of
refinement.  Isn't it that a better place to start?

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


Page 2 of 8 — ← Prev page 1 [2] 3 4 5 6 7 8  Next page →

Back to top | Article view | sci.logic


csiph-web