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 5 of 8 — ← Prev page 1 2 3 4 [5] 6 7 8  Next page →


#171793

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-03 10:46 -0800
Message-ID<075fd002-d87b-404e-94b2-56ee4113bc27@googlegroups.com>
In reply to#171766
On Saturday, 3 February 2018 05:05:22 UTC-7, Zuhair  wrote:
> On Saturday, February 3, 2018 at 11:19:12 AM UTC+3, Khong Dong wrote:
> > On Saturday, 3 February 2018 01:07:21 UTC-7, Khong Dong  wrote:
> > > On Saturday, 3 February 2018 00:49:34 UTC-7, Khong Dong  wrote:
> > > > On Friday, 2 February 2018 22:36:45 UTC-7, Zuhair  wrote:
> > > > > On Saturday, February 3, 2018 at 7:50:11 AM UTC+3, Khong Dong wrote:
> > > > > > On Friday, 2 February 2018 20:08:17 UTC-7, Khong Dong  wrote:
> > > > > > > On Friday, 2 February 2018 04:24:36 UTC-7, Zuhair  wrote:
> > > > > > > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > > > > > > 
> > > > > > > > > ==================> the proof of undecide(N |= gGC).
> > > > > > > > > 
> > > > > > > > > We assume the following: there exists a language structure, denoted by N, 
> > > > > > > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > > > > > > following conditions:
> > > > > > > > > 
> > > > > > > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > > > > > >
> > > > > > > > OK 
> > > > > > > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > > > > > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > > > > > > 
> > > > > > > > You need to clarify this, just write me a subset of U(N) so that I can be sure of what you are saying. 
> > > > > > > > for example is {"0", "S(0)", "SS(0)" } a subset of U(N),
> > > > > > > > I mean what you call "strings" are those 0 or iterated successors of 0, do you mean those. Notice the quotes "", that I put around each member to mean that I mean the written string itself, i.e. an element of U(N) is "S(0)"
> > > > > > > > I mean that written string itself not what it stands for.
> > > > > > > > 
> > > > > > > > Notice that if you mean that, then this is not the conventional way of what we mean by "universe of discourse" of a theory (see my comments below).
> > > > > > > > 
> > > > > > > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > > > > > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > > > > > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > > > > > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > > > > > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > > > > > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > > > > > > >     represented in the Wiki page).
> > > > > > > > > 
> > > > > > > > Ok, that's fair, I got that, it seems the numerals (elements of U(N)) are as I guessed of the form "0", "S(...S(0)..)", i.e. they are the STRINGs themselves. Ok.
> > > > > > > > 
> > > > > > > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > > > > > > >     or one, two, or any non-prime number, then in meta level the language
> > > > > > > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > > > > 
> > > > > > > > I couldn't understand that, first what do you mean "interpreted", is it like S(0) being interpreted as informal notion 1? do you mean that? what do you mean in "meta-level" and what do you mean by the "language numeral" where you wrote it as (term).
> > > > > > > > 
> > > > > > > > We need to settle this point, since you have two realms 
> > > > > > > > 1. elements "n"s of U(N)
> > > > > > > > 2. meta-language numerals (terms) denoting the "n"s.
> > > > > > > > 
> > > > > > > > The problem here is that your terminology is not the usual one, so you need to elaborate on it. For example what you call as a "langauge structure" I took it to mean what we call as "Model" which is a tuple of sets the first set in that tuple is what we call as the domain (which is the universe of discourse) which is the set of all objects the variables of the language range over, which is here the set of all 'standard naturals', the next sets in the tuple each enocode a relation on that domain, so the set endocing S (i.e. successor) is a set of all ordered pairs (n,n+1), also the set endocing + function is the set of all triplets (n,m,n+m) , etc..., BUT in YOUR formulation what you called U(N) which you named as the "universe of discourse of N" is a set of syntactic expressions written in L(PA), so it is not a set of "objects", it is actually a set of "terms" of the language. So in YOUR style every element of U(N) is already a successor string, i.e. a term of the language, Now you need to clarify what is the "meta-level"? is it another language speaking about L(PA), i.e. another language having terms that denote the syntactical strings in L(PA), is it that what you mean? If so then what is exactly that meta-language? you need to define its terms, formulas, rules of inference, axioms, substitution rules, etc..., you need to explicitly define this meta-language.
> > > > > > > > We need to clear these issues before we proceed further.
> > > > > > > > 
> > > > > > > > Best
> > > > > > > 
> > > > > > > So on your 1., what are the things that _you_ think can _not_ be in U(N)? and why?
> > > > > > > 
> > > > > > > On your 2., what element in U(N) do _you_ think the language symbol 0 of L(PA)
> > > > > > > must necessarily denote? and why?
> > > > > > 
> > > > > > Also on your 2., I don't know what "meta-language numerals" would mean: I've
> > > > > > never said that. Apparently you misread what I had said.
> > > > > > 
> > > > > > As well, however related, "language structure" and "model" are of two distinct
> > > > > > technical definitions: you should consult textbook on those two definitions.
> > > > > 
> > > > > My problem is with understanding what You mean by point 4. when you said:
> > > > > 
> > > > > 4. If an element n of U(N) is interpreted as the informal natural number zero, or one, two, or any non-prime number, then in meta level the language numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > 
> > > > > See my prior message about me trying to understand what you mean by that, which I find very hard to follow.
> > > > > 
> > > > > On second look I think there is a lot of to and fro movement here, Perhaps you mean the following:
> > > > > 
> > > > > If n (which is a successor string in language of PA as you said) is element of U(N), is "interpreted", [perhaps this means that it is substituted by the object it stands for], then on meta-level [here perhaps you are going back to the language of PA] the numeral denoting n [here perhaps you mean denoting "the interpretation of n", i.e. denoting "the informal notion substiting n"] is equal to the numeral n itself [perhaps you mean it is the n_th numeral itself]
> > > > > 
> > > > > so to take an example I'd say perhaps you mean that number 7 which is a prime, now if this is interprted as denoting some informal notion 7, then that informal notion of number 7 itself is not necessarily denoted by SSSSSSS(0), i.e. it is not necessarily denoted by the string that has seven successor symbols in it, while the informal notions of numbers 0,1,2 and the non primes must be denoted exactly by successor strings that correspond to their cardinalitis, i.e. 0 is denoted by 0, i.e. a successor string not having any successor symbol in it, while 1 is denoted by S(0), and so for example 4 is denotd by SSSS(0), so those numbers are denoted by a successor string having a total number of S symbols in them that is equal to their cardinalities, something like that.
> > > > > 
> > > > > So for example I can have the following being U(N)
> > > > > 
> > > > > U(N)= {0,S(0),SS(0), SSSSS(0), SSSS(0), SSSSSSS(0),..}
> > > > > to dentoe
> > > > > {0,1,2,3,4,5,...}
> > > > > 
> > > > > so prime 3 is denoted by a successor string having cardinalities equal to that of the prime following number 3, and so on.. for each prime. but the non primes and 0,1,2 are denoted by the same number of successor as their cardinalities.
> > > > > 
> > > > > Is that what you are trying to say???
> > > > 
> > > > You got the general idea but the way you wrote it down and your wording "the
> > > > prime following number 3" don't portrait the concept clearly. What you have
> > > > are two sets _not_ a mapping between them so it's hard to know what's mapped
> > > > to what.
> > > > 
> > > > Any rate, given your example and my stipulations above, the numeral SSSSS(0)
> > > > in the first set *could* denote the numeral SSS(0) which is being a *surrogate*
> > > > for the prime number three (which you've alluded to as 3 in your 2nd set), for
> > > > instance.
> > > > 
> > > > Hope that things are clear now. Agree?
> > > 
> > > Let me elaborate a bit more for clarity sake. 
> > > 
> > > For example, in this _language formula_ SSS0 + S0 = SSSS0, SSS0 could denote
> > > the numeral SSSSS(0) or SSSSSSS(0) in your 1st set (which is the domain), but
> > > in either case this chosen element (which itself is a numeral) in the 1st set
> > > must be interpreted as the prime number three which you've alluded to as 3 in
> > > your 2nd set.
> > > 
> > > The numeral SSS0 in the _language formula_ is referring to (denoting) the
> > > surrogate-numeral SSSSS(0) - or SSSSSSS(0) - being a surrogate for the prime
> > > number three (indicated as 3 in your 2nd set).
> > 
> > Of course the surrogate-numerals are in the domain - the universe of discourse
> > U(N).
> 
> Ok, I got what you want to say, although you prefer this surrogate numerals explanation. Also it seems that your U(N) do have all string SS..Sn(0) for each n=0,1,2,3,...
> 
> I personally prefer to use decimal notation for the "informal notions", i.e. like 0,1,2,3,.., and use SSS..S(0) strings for the symbols denoting those informal notions. ANd I think a language structure would be something that maps those strings to their informal notions that they denote, and in addition to that it contains sets that represent the primitives of the language as well. All would have the same U(N).
> 
> so, for instance, we can have
> 
> {<"0",0>, <"S(0)",1>, <"SS(0)",2>, <"SSSSS(0)",3>, <"SSSS(0)",4>,...}
> 
> However you can use the same strings in two roles, then the first role when standing for the informal notions they denote, and the second role as strings os successors, so I can write the above as:
> 
> {<"0",0>, <"S(0)",S(0)>, <"SS(0)",SS(0)>, <"SSSSS(0)",SSS(0)>, <"SSSS(0)",SSSS(0)>,...}
> 
> Notice that it is important to use the quotation marks "" around each string in order to indicate it is indeed the string of symbol inside those quotation marks that is meant and not what it stands for, so "SS(0)" means the very string itself while SS(0) written as such in a free manner without quotation marks around it this is taken to mean an object that it denotes and not the string itself.
> so you see the ordered pair of the even numbers and number 1 are of the form <"n", n> where n is a successor string numeral, while the if n is an prime number other than 2, then we have ordered pair <"m",n> where n may equal m or may not equal m.
> 
> Now I have some questions, in the LANGUAE structure N which I guess is a tuple, which has its domain being UN, and perhaps it has another coding set like the above which sends each string numeral n to a surrogate numeral k standing for the informal notion n denotes, and also there must be so other sets in the tuple N that represent the primitives of the language, like a set representing the successor primitive, and a set representing addition primitive, etc..., now how those sets are defined I mean in the set representing + relation which is a set of triplets <n,m,n+m), but here we are having numerals
> so for example do we have the tuple representing <3,1,4>, [which is <SSS(0),S(0),SSSS(0)> using the surrogate notations] how that would be represented? is it as <"SSSSS(0)", "S(0)", "SSSS(0)">. I think this is plausible.
> 
> Now I have another two questions: YOU SAID  
> Lemma 1: Ep[prime(p)] => nk(length(numeral(p))). 
> 
> Proof: By (5), p might not be numeral(p). 
>         
> Lemma 2: Let N be in K, e be a general even number within the half open 
>          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)], 
>          then nK((p1+p2) <= e). 
> 
> end quote/
> 
> Now whata is Ep? I think it means "there exists p"

Right.

> now what does nk mean? 

nK(S) <=> There is no proof that S is true.

> also what is =>? is it equal or greater than or is it the implication symbol, to me it appears to be the latter?

Yes: the latter.

> I think also "length(numeral(p))" means the total number of occurrences of
> the symbol S in numeral(p) 

Right. But note that this is a _general_ definition applicable to _all_
numerals, surrogate or not.

However since other than n being the natural numbers in this context of U(N)
n would be a numeral so there's something "superfluous" in my definition of
"length(numeral(n))" so let me restate it:

- length(numeral n) <=> (The number of occurrences of 'S' in [the numeral] n).

Hence numeral(p) is meaningful only if p is a natural number instead of an
element in the underlying U(N). Of course we can take the position that if n
is already a numeral, numeral(n) = n (itself). Let's consider that we've
already taken this position.

> [which is the numeral denoting p and not the surrogate of p, Right?].

The surrogate one, although in the context of Lemma 1 it doesn't matter since
p is "prime": the nK() operator is still applicable to both and Lemma 1 is
still true. 

The point being is that for an even surrogate numeral e its denoting numeral is
equal to e itself, and that a denoting numeral is part of some language formula
expressions, hence that many language structure theoretical truths about the
language structure theoretical surrogate numeral e can be delegated (as a
surrogate) to some FOL formal system proofs (assuming consistency).

The situation isn't the same for a prime surrogate numeral p: the fact that the
length of the surrogate (prime) numeral p isn't in general the same as its
denoting numeral, as part of some language formulas, would trigger some
impossible to know situations as alluded to in R3 as a law of thought (I called
this law HP - Humility Principle).

> also what is the "half open interval stipulated by gGC".

It's indicated as part of the definition of gGC: "even number greater than 4
beyond which".

> Also you didn't explicitly state gGC here in your proof, is it the same in
> the head post?

Yes.
> 
> Please give examples of all what those symbols stand for, so that I can
> fathom what you are trying to say.

Ok:

 FALSE(nK(even(e) => (Eo[odd(odd)] and "length(numeral(o)) = length(numeral(e)) + 1"))

which means it's not true that it's not knowable (there can be a proof) that
if e is a surrogate even numeral, in this context in U(N), then there exists a
surrogate odd numeral o such that the length of the language numeral denoting
o is equal to the length of the language numeral denoting e, plus one.

Hope this has helped.

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


#171838

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-03 20:34 -0800
Message-ID<41ab21cb-9978-4a6b-8d14-14ba4e432ec9@googlegroups.com>
In reply to#171793
On Saturday, 3 February 2018 11:46:09 UTC-7, Khong Dong  wrote:
> On Saturday, 3 February 2018 05:05:22 UTC-7, Zuhair  wrote:
> > On Saturday, February 3, 2018 at 11:19:12 AM UTC+3, Khong Dong wrote:
> > > On Saturday, 3 February 2018 01:07:21 UTC-7, Khong Dong  wrote:
> > > > On Saturday, 3 February 2018 00:49:34 UTC-7, Khong Dong  wrote:
> > > > > On Friday, 2 February 2018 22:36:45 UTC-7, Zuhair  wrote:
> > > > > > On Saturday, February 3, 2018 at 7:50:11 AM UTC+3, Khong Dong wrote:
> > > > > > > On Friday, 2 February 2018 20:08:17 UTC-7, Khong Dong  wrote:
> > > > > > > > On Friday, 2 February 2018 04:24:36 UTC-7, Zuhair  wrote:
> > > > > > > > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > > > > > > > 
> > > > > > > > > > ==================> the proof of undecide(N |= gGC).
> > > > > > > > > > 
> > > > > > > > > > We assume the following: there exists a language structure, denoted by N, 
> > > > > > > > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > > > > > > > following conditions:
> > > > > > > > > > 
> > > > > > > > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > > > > > > >
> > > > > > > > > OK 
> > > > > > > > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > > > > > > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > > > > > > > 
> > > > > > > > > You need to clarify this, just write me a subset of U(N) so that I can be sure of what you are saying. 
> > > > > > > > > for example is {"0", "S(0)", "SS(0)" } a subset of U(N),
> > > > > > > > > I mean what you call "strings" are those 0 or iterated successors of 0, do you mean those. Notice the quotes "", that I put around each member to mean that I mean the written string itself, i.e. an element of U(N) is "S(0)"
> > > > > > > > > I mean that written string itself not what it stands for.
> > > > > > > > > 
> > > > > > > > > Notice that if you mean that, then this is not the conventional way of what we mean by "universe of discourse" of a theory (see my comments below).
> > > > > > > > > 
> > > > > > > > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > > > > > > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > > > > > > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > > > > > > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > > > > > > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > > > > > > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > > > > > > > >     represented in the Wiki page).
> > > > > > > > > > 
> > > > > > > > > Ok, that's fair, I got that, it seems the numerals (elements of U(N)) are as I guessed of the form "0", "S(...S(0)..)", i.e. they are the STRINGs themselves. Ok.
> > > > > > > > > 
> > > > > > > > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > > > > > > > >     or one, two, or any non-prime number, then in meta level the language
> > > > > > > > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > > > > > 
> > > > > > > > > I couldn't understand that, first what do you mean "interpreted", is it like S(0) being interpreted as informal notion 1? do you mean that? what do you mean in "meta-level" and what do you mean by the "language numeral" where you wrote it as (term).
> > > > > > > > > 
> > > > > > > > > We need to settle this point, since you have two realms 
> > > > > > > > > 1. elements "n"s of U(N)
> > > > > > > > > 2. meta-language numerals (terms) denoting the "n"s.
> > > > > > > > > 
> > > > > > > > > The problem here is that your terminology is not the usual one, so you need to elaborate on it. For example what you call as a "langauge structure" I took it to mean what we call as "Model" which is a tuple of sets the first set in that tuple is what we call as the domain (which is the universe of discourse) which is the set of all objects the variables of the language range over, which is here the set of all 'standard naturals', the next sets in the tuple each enocode a relation on that domain, so the set endocing S (i.e. successor) is a set of all ordered pairs (n,n+1), also the set endocing + function is the set of all triplets (n,m,n+m) , etc..., BUT in YOUR formulation what you called U(N) which you named as the "universe of discourse of N" is a set of syntactic expressions written in L(PA), so it is not a set of "objects", it is actually a set of "terms" of the language. So in YOUR style every element of U(N) is already a successor string, i.e. a term of the language, Now you need to clarify what is the "meta-level"? is it another language speaking about L(PA), i.e. another language having terms that denote the syntactical strings in L(PA), is it that what you mean? If so then what is exactly that meta-language? you need to define its terms, formulas, rules of inference, axioms, substitution rules, etc..., you need to explicitly define this meta-language.
> > > > > > > > > We need to clear these issues before we proceed further.
> > > > > > > > > 
> > > > > > > > > Best
> > > > > > > > 
> > > > > > > > So on your 1., what are the things that _you_ think can _not_ be in U(N)? and why?
> > > > > > > > 
> > > > > > > > On your 2., what element in U(N) do _you_ think the language symbol 0 of L(PA)
> > > > > > > > must necessarily denote? and why?
> > > > > > > 
> > > > > > > Also on your 2., I don't know what "meta-language numerals" would mean: I've
> > > > > > > never said that. Apparently you misread what I had said.
> > > > > > > 
> > > > > > > As well, however related, "language structure" and "model" are of two distinct
> > > > > > > technical definitions: you should consult textbook on those two definitions.
> > > > > > 
> > > > > > My problem is with understanding what You mean by point 4. when you said:
> > > > > > 
> > > > > > 4. If an element n of U(N) is interpreted as the informal natural number zero, or one, two, or any non-prime number, then in meta level the language numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > 
> > > > > > See my prior message about me trying to understand what you mean by that, which I find very hard to follow.
> > > > > > 
> > > > > > On second look I think there is a lot of to and fro movement here, Perhaps you mean the following:
> > > > > > 
> > > > > > If n (which is a successor string in language of PA as you said) is element of U(N), is "interpreted", [perhaps this means that it is substituted by the object it stands for], then on meta-level [here perhaps you are going back to the language of PA] the numeral denoting n [here perhaps you mean denoting "the interpretation of n", i.e. denoting "the informal notion substiting n"] is equal to the numeral n itself [perhaps you mean it is the n_th numeral itself]
> > > > > > 
> > > > > > so to take an example I'd say perhaps you mean that number 7 which is a prime, now if this is interprted as denoting some informal notion 7, then that informal notion of number 7 itself is not necessarily denoted by SSSSSSS(0), i.e. it is not necessarily denoted by the string that has seven successor symbols in it, while the informal notions of numbers 0,1,2 and the non primes must be denoted exactly by successor strings that correspond to their cardinalitis, i.e. 0 is denoted by 0, i.e. a successor string not having any successor symbol in it, while 1 is denoted by S(0), and so for example 4 is denotd by SSSS(0), so those numbers are denoted by a successor string having a total number of S symbols in them that is equal to their cardinalities, something like that.
> > > > > > 
> > > > > > So for example I can have the following being U(N)
> > > > > > 
> > > > > > U(N)= {0,S(0),SS(0), SSSSS(0), SSSS(0), SSSSSSS(0),..}
> > > > > > to dentoe
> > > > > > {0,1,2,3,4,5,...}
> > > > > > 
> > > > > > so prime 3 is denoted by a successor string having cardinalities equal to that of the prime following number 3, and so on.. for each prime. but the non primes and 0,1,2 are denoted by the same number of successor as their cardinalities.
> > > > > > 
> > > > > > Is that what you are trying to say???
> > > > > 
> > > > > You got the general idea but the way you wrote it down and your wording "the
> > > > > prime following number 3" don't portrait the concept clearly. What you have
> > > > > are two sets _not_ a mapping between them so it's hard to know what's mapped
> > > > > to what.
> > > > > 
> > > > > Any rate, given your example and my stipulations above, the numeral SSSSS(0)
> > > > > in the first set *could* denote the numeral SSS(0) which is being a *surrogate*
> > > > > for the prime number three (which you've alluded to as 3 in your 2nd set), for
> > > > > instance.
> > > > > 
> > > > > Hope that things are clear now. Agree?
> > > > 
> > > > Let me elaborate a bit more for clarity sake. 
> > > > 
> > > > For example, in this _language formula_ SSS0 + S0 = SSSS0, SSS0 could denote
> > > > the numeral SSSSS(0) or SSSSSSS(0) in your 1st set (which is the domain), but
> > > > in either case this chosen element (which itself is a numeral) in the 1st set
> > > > must be interpreted as the prime number three which you've alluded to as 3 in
> > > > your 2nd set.
> > > > 
> > > > The numeral SSS0 in the _language formula_ is referring to (denoting) the
> > > > surrogate-numeral SSSSS(0) - or SSSSSSS(0) - being a surrogate for the prime
> > > > number three (indicated as 3 in your 2nd set).
> > > 
> > > Of course the surrogate-numerals are in the domain - the universe of discourse
> > > U(N).
> > 
> > Ok, I got what you want to say, although you prefer this surrogate numerals explanation. Also it seems that your U(N) do have all string SS..Sn(0) for each n=0,1,2,3,...
> > 
> > I personally prefer to use decimal notation for the "informal notions", i.e. like 0,1,2,3,.., and use SSS..S(0) strings for the symbols denoting those informal notions. ANd I think a language structure would be something that maps those strings to their informal notions that they denote, and in addition to that it contains sets that represent the primitives of the language as well. All would have the same U(N).
> > 
> > so, for instance, we can have
> > 
> > {<"0",0>, <"S(0)",1>, <"SS(0)",2>, <"SSSSS(0)",3>, <"SSSS(0)",4>,...}
> > 
> > However you can use the same strings in two roles, then the first role when standing for the informal notions they denote, and the second role as strings os successors, so I can write the above as:
> > 
> > {<"0",0>, <"S(0)",S(0)>, <"SS(0)",SS(0)>, <"SSSSS(0)",SSS(0)>, <"SSSS(0)",SSSS(0)>,...}
> > 
> > Notice that it is important to use the quotation marks "" around each string in order to indicate it is indeed the string of symbol inside those quotation marks that is meant and not what it stands for, so "SS(0)" means the very string itself while SS(0) written as such in a free manner without quotation marks around it this is taken to mean an object that it denotes and not the string itself.
> > so you see the ordered pair of the even numbers and number 1 are of the form <"n", n> where n is a successor string numeral, while the if n is an prime number other than 2, then we have ordered pair <"m",n> where n may equal m or may not equal m.
> > 
> > Now I have some questions, in the LANGUAE structure N which I guess is a tuple, which has its domain being UN, and perhaps it has another coding set like the above which sends each string numeral n to a surrogate numeral k standing for the informal notion n denotes, and also there must be so other sets in the tuple N that represent the primitives of the language, like a set representing the successor primitive, and a set representing addition primitive, etc..., now how those sets are defined I mean in the set representing + relation which is a set of triplets <n,m,n+m), but here we are having numerals
> > so for example do we have the tuple representing <3,1,4>, [which is <SSS(0),S(0),SSSS(0)> using the surrogate notations] how that would be represented? is it as <"SSSSS(0)", "S(0)", "SSSS(0)">. I think this is plausible.
> > 
> > Now I have another two questions: YOU SAID  
> > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))). 
> > 
> > Proof: By (5), p might not be numeral(p). 
> >         
> > Lemma 2: Let N be in K, e be a general even number within the half open 
> >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)], 
> >          then nK((p1+p2) <= e). 
> > 
> > end quote/
> > 
> > Now whata is Ep? I think it means "there exists p"
> 
> Right.
> 
> > now what does nk mean? 
> 
> nK(S) <=> There is no proof that S is true.
> 
> > also what is =>? is it equal or greater than or is it the implication symbol, to me it appears to be the latter?
> 
> Yes: the latter.
> 
> > I think also "length(numeral(p))" means the total number of occurrences of
> > the symbol S in numeral(p) 
> 
> Right. But note that this is a _general_ definition applicable to _all_
> numerals, surrogate or not.
> 
> However since other than n being the natural numbers in this context of U(N)
> n would be a numeral so there's something "superfluous" in my definition of
> "length(numeral(n))" so let me restate it:
> 
> - length(numeral n) <=> (The number of occurrences of 'S' in [the numeral] n).
> 
> Hence numeral(p) is meaningful only if p is a natural number instead of an
> element in the underlying U(N). Of course we can take the position that if n
> is already a numeral, numeral(n) = n (itself). Let's consider that we've
> already taken this position.
> 
> > [which is the numeral denoting p and not the surrogate of p, Right?].
> 
> The surrogate one, although in the context of Lemma 1 it doesn't matter since
> p is "prime": the nK() operator is still applicable to both and Lemma 1 is
> still true. 

I got a little mixed up with notation here and you were right originally: for
notation consistency sake, if p is in U(N), p is already a numeral (surrogate)
and so numeral(p) should be treated as the language numeral denoting p.

> 
> The point being is that for an even surrogate numeral e its denoting numeral is
> equal to e itself, and that a denoting numeral is part of some language formula
> expressions, hence that many language structure theoretical truths about the
> language structure theoretical surrogate numeral e can be delegated (as a
> surrogate) to some FOL formal system proofs (assuming consistency).
> 
> The situation isn't the same for a prime surrogate numeral p: the fact that the
> length of the surrogate (prime) numeral p isn't in general the same as its
> denoting numeral, as part of some language formulas, would trigger some
> impossible to know situations as alluded to in R3 as a law of thought (I called
> this law HP - Humility Principle).
> 
> > also what is the "half open interval stipulated by gGC".
> 
> It's indicated as part of the definition of gGC: "even number greater than 4
> beyond which".
> 
> > Also you didn't explicitly state gGC here in your proof, is it the same in
> > the head post?
> 
> Yes.
> > 
> > Please give examples of all what those symbols stand for, so that I can
> > fathom what you are trying to say.
> 
> Ok:
> 
>  FALSE(nK(even(e) => (Eo[odd(odd)] and "length(numeral(o)) = length(numeral(e)) + 1"))

A typo, it should have been:

 FALSE(nK(even(e) => (Eo[odd(o)] and "length(numeral(o)) = length(numeral(e)) + 1"))

> which means it's not true that it's not knowable (there can be a proof) that
> if e is a surrogate even numeral, in this context in U(N), then there exists a
> surrogate odd numeral o such that the length of the language numeral denoting
> o is equal to the length of the language numeral denoting e, plus one.
> 
> Hope this has helped.

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


#171847

FromZuhair <zaljohar@gmail.com>
Date2018-02-04 03:29 -0800
Message-ID<61f9a219-2669-46aa-ad04-a9b20625412b@googlegroups.com>
In reply to#171838
On Sunday, February 4, 2018 at 7:34:22 AM UTC+3, Khong Dong wrote:
> On Saturday, 3 February 2018 11:46:09 UTC-7, Khong Dong  wrote:
> > On Saturday, 3 February 2018 05:05:22 UTC-7, Zuhair  wrote:
> > > On Saturday, February 3, 2018 at 11:19:12 AM UTC+3, Khong Dong wrote:
> > > > On Saturday, 3 February 2018 01:07:21 UTC-7, Khong Dong  wrote:
> > > > > On Saturday, 3 February 2018 00:49:34 UTC-7, Khong Dong  wrote:
> > > > > > On Friday, 2 February 2018 22:36:45 UTC-7, Zuhair  wrote:
> > > > > > > On Saturday, February 3, 2018 at 7:50:11 AM UTC+3, Khong Dong wrote:
> > > > > > > > On Friday, 2 February 2018 20:08:17 UTC-7, Khong Dong  wrote:
> > > > > > > > > On Friday, 2 February 2018 04:24:36 UTC-7, Zuhair  wrote:
> > > > > > > > > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > > > > > > > > 
> > > > > > > > > > > ==================> the proof of undecide(N |= gGC).
> > > > > > > > > > > 
> > > > > > > > > > > We assume the following: there exists a language structure, denoted by N, 
> > > > > > > > > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > > > > > > > > following conditions:
> > > > > > > > > > > 
> > > > > > > > > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > > > > > > > >
> > > > > > > > > > OK 
> > > > > > > > > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > > > > > > > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > > > > > > > > 
> > > > > > > > > > You need to clarify this, just write me a subset of U(N) so that I can be sure of what you are saying. 
> > > > > > > > > > for example is {"0", "S(0)", "SS(0)" } a subset of U(N),
> > > > > > > > > > I mean what you call "strings" are those 0 or iterated successors of 0, do you mean those. Notice the quotes "", that I put around each member to mean that I mean the written string itself, i.e. an element of U(N) is "S(0)"
> > > > > > > > > > I mean that written string itself not what it stands for.
> > > > > > > > > > 
> > > > > > > > > > Notice that if you mean that, then this is not the conventional way of what we mean by "universe of discourse" of a theory (see my comments below).
> > > > > > > > > > 
> > > > > > > > > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > > > > > > > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > > > > > > > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > > > > > > > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > > > > > > > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > > > > > > > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > > > > > > > > >     represented in the Wiki page).
> > > > > > > > > > > 
> > > > > > > > > > Ok, that's fair, I got that, it seems the numerals (elements of U(N)) are as I guessed of the form "0", "S(...S(0)..)", i.e. they are the STRINGs themselves. Ok.
> > > > > > > > > > 
> > > > > > > > > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > > > > > > > > >     or one, two, or any non-prime number, then in meta level the language
> > > > > > > > > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > > > > > > 
> > > > > > > > > > I couldn't understand that, first what do you mean "interpreted", is it like S(0) being interpreted as informal notion 1? do you mean that? what do you mean in "meta-level" and what do you mean by the "language numeral" where you wrote it as (term).
> > > > > > > > > > 
> > > > > > > > > > We need to settle this point, since you have two realms 
> > > > > > > > > > 1. elements "n"s of U(N)
> > > > > > > > > > 2. meta-language numerals (terms) denoting the "n"s.
> > > > > > > > > > 
> > > > > > > > > > The problem here is that your terminology is not the usual one, so you need to elaborate on it. For example what you call as a "langauge structure" I took it to mean what we call as "Model" which is a tuple of sets the first set in that tuple is what we call as the domain (which is the universe of discourse) which is the set of all objects the variables of the language range over, which is here the set of all 'standard naturals', the next sets in the tuple each enocode a relation on that domain, so the set endocing S (i.e. successor) is a set of all ordered pairs (n,n+1), also the set endocing + function is the set of all triplets (n,m,n+m) , etc..., BUT in YOUR formulation what you called U(N) which you named as the "universe of discourse of N" is a set of syntactic expressions written in L(PA), so it is not a set of "objects", it is actually a set of "terms" of the language. So in YOUR style every element of U(N) is already a successor string, i.e. a term of the language, Now you need to clarify what is the "meta-level"? is it another language speaking about L(PA), i.e. another language having terms that denote the syntactical strings in L(PA), is it that what you mean? If so then what is exactly that meta-language? you need to define its terms, formulas, rules of inference, axioms, substitution rules, etc..., you need to explicitly define this meta-language.
> > > > > > > > > > We need to clear these issues before we proceed further.
> > > > > > > > > > 
> > > > > > > > > > Best
> > > > > > > > > 
> > > > > > > > > So on your 1., what are the things that _you_ think can _not_ be in U(N)? and why?
> > > > > > > > > 
> > > > > > > > > On your 2., what element in U(N) do _you_ think the language symbol 0 of L(PA)
> > > > > > > > > must necessarily denote? and why?
> > > > > > > > 
> > > > > > > > Also on your 2., I don't know what "meta-language numerals" would mean: I've
> > > > > > > > never said that. Apparently you misread what I had said.
> > > > > > > > 
> > > > > > > > As well, however related, "language structure" and "model" are of two distinct
> > > > > > > > technical definitions: you should consult textbook on those two definitions.
> > > > > > > 
> > > > > > > My problem is with understanding what You mean by point 4. when you said:
> > > > > > > 
> > > > > > > 4. If an element n of U(N) is interpreted as the informal natural number zero, or one, two, or any non-prime number, then in meta level the language numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > > 
> > > > > > > See my prior message about me trying to understand what you mean by that, which I find very hard to follow.
> > > > > > > 
> > > > > > > On second look I think there is a lot of to and fro movement here, Perhaps you mean the following:
> > > > > > > 
> > > > > > > If n (which is a successor string in language of PA as you said) is element of U(N), is "interpreted", [perhaps this means that it is substituted by the object it stands for], then on meta-level [here perhaps you are going back to the language of PA] the numeral denoting n [here perhaps you mean denoting "the interpretation of n", i.e. denoting "the informal notion substiting n"] is equal to the numeral n itself [perhaps you mean it is the n_th numeral itself]
> > > > > > > 
> > > > > > > so to take an example I'd say perhaps you mean that number 7 which is a prime, now if this is interprted as denoting some informal notion 7, then that informal notion of number 7 itself is not necessarily denoted by SSSSSSS(0), i.e. it is not necessarily denoted by the string that has seven successor symbols in it, while the informal notions of numbers 0,1,2 and the non primes must be denoted exactly by successor strings that correspond to their cardinalitis, i.e. 0 is denoted by 0, i.e. a successor string not having any successor symbol in it, while 1 is denoted by S(0), and so for example 4 is denotd by SSSS(0), so those numbers are denoted by a successor string having a total number of S symbols in them that is equal to their cardinalities, something like that.
> > > > > > > 
> > > > > > > So for example I can have the following being U(N)
> > > > > > > 
> > > > > > > U(N)= {0,S(0),SS(0), SSSSS(0), SSSS(0), SSSSSSS(0),..}
> > > > > > > to dentoe
> > > > > > > {0,1,2,3,4,5,...}
> > > > > > > 
> > > > > > > so prime 3 is denoted by a successor string having cardinalities equal to that of the prime following number 3, and so on.. for each prime. but the non primes and 0,1,2 are denoted by the same number of successor as their cardinalities.
> > > > > > > 
> > > > > > > Is that what you are trying to say???
> > > > > > 
> > > > > > You got the general idea but the way you wrote it down and your wording "the
> > > > > > prime following number 3" don't portrait the concept clearly. What you have
> > > > > > are two sets _not_ a mapping between them so it's hard to know what's mapped
> > > > > > to what.
> > > > > > 
> > > > > > Any rate, given your example and my stipulations above, the numeral SSSSS(0)
> > > > > > in the first set *could* denote the numeral SSS(0) which is being a *surrogate*
> > > > > > for the prime number three (which you've alluded to as 3 in your 2nd set), for
> > > > > > instance.
> > > > > > 
> > > > > > Hope that things are clear now. Agree?
> > > > > 
> > > > > Let me elaborate a bit more for clarity sake. 
> > > > > 
> > > > > For example, in this _language formula_ SSS0 + S0 = SSSS0, SSS0 could denote
> > > > > the numeral SSSSS(0) or SSSSSSS(0) in your 1st set (which is the domain), but
> > > > > in either case this chosen element (which itself is a numeral) in the 1st set
> > > > > must be interpreted as the prime number three which you've alluded to as 3 in
> > > > > your 2nd set.
> > > > > 
> > > > > The numeral SSS0 in the _language formula_ is referring to (denoting) the
> > > > > surrogate-numeral SSSSS(0) - or SSSSSSS(0) - being a surrogate for the prime
> > > > > number three (indicated as 3 in your 2nd set).
> > > > 
> > > > Of course the surrogate-numerals are in the domain - the universe of discourse
> > > > U(N).
> > > 
> > > Ok, I got what you want to say, although you prefer this surrogate numerals explanation. Also it seems that your U(N) do have all string SS..Sn(0) for each n=0,1,2,3,...
> > > 
> > > I personally prefer to use decimal notation for the "informal notions", i.e. like 0,1,2,3,.., and use SSS..S(0) strings for the symbols denoting those informal notions. ANd I think a language structure would be something that maps those strings to their informal notions that they denote, and in addition to that it contains sets that represent the primitives of the language as well. All would have the same U(N).
> > > 
> > > so, for instance, we can have
> > > 
> > > {<"0",0>, <"S(0)",1>, <"SS(0)",2>, <"SSSSS(0)",3>, <"SSSS(0)",4>,...}
> > > 
> > > However you can use the same strings in two roles, then the first role when standing for the informal notions they denote, and the second role as strings os successors, so I can write the above as:
> > > 
> > > {<"0",0>, <"S(0)",S(0)>, <"SS(0)",SS(0)>, <"SSSSS(0)",SSS(0)>, <"SSSS(0)",SSSS(0)>,...}
> > > 
> > > Notice that it is important to use the quotation marks "" around each string in order to indicate it is indeed the string of symbol inside those quotation marks that is meant and not what it stands for, so "SS(0)" means the very string itself while SS(0) written as such in a free manner without quotation marks around it this is taken to mean an object that it denotes and not the string itself.
> > > so you see the ordered pair of the even numbers and number 1 are of the form <"n", n> where n is a successor string numeral, while the if n is an prime number other than 2, then we have ordered pair <"m",n> where n may equal m or may not equal m.
> > > 
> > > Now I have some questions, in the LANGUAE structure N which I guess is a tuple, which has its domain being UN, and perhaps it has another coding set like the above which sends each string numeral n to a surrogate numeral k standing for the informal notion n denotes, and also there must be so other sets in the tuple N that represent the primitives of the language, like a set representing the successor primitive, and a set representing addition primitive, etc..., now how those sets are defined I mean in the set representing + relation which is a set of triplets <n,m,n+m), but here we are having numerals
> > > so for example do we have the tuple representing <3,1,4>, [which is <SSS(0),S(0),SSSS(0)> using the surrogate notations] how that would be represented? is it as <"SSSSS(0)", "S(0)", "SSSS(0)">. I think this is plausible.
> > > 
> > > Now I have another two questions: YOU SAID  
> > > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))). 
> > > 
> > > Proof: By (5), p might not be numeral(p). 
> > >         
> > > Lemma 2: Let N be in K, e be a general even number within the half open 
> > >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)], 
> > >          then nK((p1+p2) <= e). 
> > > 
> > > end quote/
> > > 
> > > Now whata is Ep? I think it means "there exists p"
> > 
> > Right.
> > 
> > > now what does nk mean? 
> > 
> > nK(S) <=> There is no proof that S is true.
> > 
> > > also what is =>? is it equal or greater than or is it the implication symbol, to me it appears to be the latter?
> > 
> > Yes: the latter.
> > 
> > > I think also "length(numeral(p))" means the total number of occurrences of
> > > the symbol S in numeral(p) 
> > 
> > Right. But note that this is a _general_ definition applicable to _all_
> > numerals, surrogate or not.
> > 
> > However since other than n being the natural numbers in this context of U(N)
> > n would be a numeral so there's something "superfluous" in my definition of
> > "length(numeral(n))" so let me restate it:
> > 
> > - length(numeral n) <=> (The number of occurrences of 'S' in [the numeral] n).
> > 
> > Hence numeral(p) is meaningful only if p is a natural number instead of an
> > element in the underlying U(N). Of course we can take the position that if n
> > is already a numeral, numeral(n) = n (itself). Let's consider that we've
> > already taken this position.
> > 
> > > [which is the numeral denoting p and not the surrogate of p, Right?].
> > 
> > The surrogate one, although in the context of Lemma 1 it doesn't matter since
> > p is "prime": the nK() operator is still applicable to both and Lemma 1 is
> > still true. 
> 
> I got a little mixed up with notation here and you were right originally: for
> notation consistency sake, if p is in U(N), p is already a numeral (surrogate)
> and so numeral(p) should be treated as the language numeral denoting p.
> 
> > 
> > The point being is that for an even surrogate numeral e its denoting numeral is
> > equal to e itself, and that a denoting numeral is part of some language formula
> > expressions, hence that many language structure theoretical truths about the
> > language structure theoretical surrogate numeral e can be delegated (as a
> > surrogate) to some FOL formal system proofs (assuming consistency).
> > 
> > The situation isn't the same for a prime surrogate numeral p: the fact that the
> > length of the surrogate (prime) numeral p isn't in general the same as its
> > denoting numeral, as part of some language formulas, would trigger some
> > impossible to know situations as alluded to in R3 as a law of thought (I called
> > this law HP - Humility Principle).
> > 
> > > also what is the "half open interval stipulated by gGC".
> > 
> > It's indicated as part of the definition of gGC: "even number greater than 4
> > beyond which".
> > 
> > > Also you didn't explicitly state gGC here in your proof, is it the same in
> > > the head post?
> > 
> > Yes.
> > > 
> > > Please give examples of all what those symbols stand for, so that I can
> > > fathom what you are trying to say.
> > 
> > Ok:
> > 
> >  FALSE(nK(even(e) => (Eo[odd(odd)] and "length(numeral(o)) = length(numeral(e)) + 1"))
> 
> A typo, it should have been:
> 
>  FALSE(nK(even(e) => (Eo[odd(o)] and "length(numeral(o)) = length(numeral(e)) + 1"))
> 
 
I think you mean:

FALSE(Ae(even(e) => nk(Eo[odd(o)] and length(numeral(o)) = length(numeral(e)) + 1)))) 

where "Ae" means "for all e"

to read that: it is FALSE to say that for EVERY even number e, we don't know of the existence of an odd number the numeral representation of which has a length that is one step more than the length of the numeral representing e.

this is false because we know for example that when e=8 then it has its length is 8 and also the length of the odd number following 8 which is 9 is also 9 (i.e. it is 8+1), since 9 is not a prime.

Zuhair

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


#171751

FromZuhair <zaljohar@gmail.com>
Date2018-02-02 20:56 -0800
Message-ID<b67940a4-2198-4623-b3bd-275ddb70d1e9@googlegroups.com>
In reply to#171743
On Saturday, February 3, 2018 at 6:08:17 AM UTC+3, Khong Dong wrote:
> On Friday, 2 February 2018 04:24:36 UTC-7, Zuhair  wrote:
> > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > 
> > > ==================> the proof of undecide(N |= gGC).
> > > 
> > > We assume the following: there exists a language structure, denoted by N, 
> > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > following conditions:
> > > 
> > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > >
> > OK 
> > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > 
> > You need to clarify this, just write me a subset of U(N) so that I can be sure of what you are saying. 
> > for example is {"0", "S(0)", "SS(0)" } a subset of U(N),
> > I mean what you call "strings" are those 0 or iterated successors of 0, do you mean those. Notice the quotes "", that I put around each member to mean that I mean the written string itself, i.e. an element of U(N) is "S(0)"
> > I mean that written string itself not what it stands for.
> > 
> > Notice that if you mean that, then this is not the conventional way of what we mean by "universe of discourse" of a theory (see my comments below).
> > 
> > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > >     The encoding is as following: if the numeral X encodes the element e in 
> > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > >     represented in the Wiki page).
> > > 
> > Ok, that's fair, I got that, it seems the numerals (elements of U(N)) are as I guessed of the form "0", "S(...S(0)..)", i.e. they are the STRINGs themselves. Ok.
> > 
> > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > >     or one, two, or any non-prime number, then in meta level the language
> > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > 
> > I couldn't understand that, first what do you mean "interpreted", is it like S(0) being interpreted as informal notion 1? do you mean that? what do you mean in "meta-level" and what do you mean by the "language numeral" where you wrote it as (term).
> > 
> > We need to settle this point, since you have two realms 
> > 1. elements "n"s of U(N)
> > 2. meta-language numerals (terms) denoting the "n"s.
> > 
> > The problem here is that your terminology is not the usual one, so you need to elaborate on it. For example what you call as a "langauge structure" I took it to mean what we call as "Model" which is a tuple of sets the first set in that tuple is what we call as the domain (which is the universe of discourse) which is the set of all objects the variables of the language range over, which is here the set of all 'standard naturals', the next sets in the tuple each enocode a relation on that domain, so the set endocing S (i.e. successor) is a set of all ordered pairs (n,n+1), also the set endocing + function is the set of all triplets (n,m,n+m) , etc..., BUT in YOUR formulation what you called U(N) which you named as the "universe of discourse of N" is a set of syntactic expressions written in L(PA), so it is not a set of "objects", it is actually a set of "terms" of the language. So in YOUR style every element of U(N) is already a successor string, i.e. a term of the language, Now you need to clarify what is the "meta-level"? is it another language speaking about L(PA), i.e. another language having terms that denote the syntactical strings in L(PA), is it that what you mean? If so then what is exactly that meta-language? you need to define its terms, formulas, rules of inference, axioms, substitution rules, etc..., you need to explicitly define this meta-language.
> > We need to clear these issues before we proceed further.
> > 
> > Best
> 
> So on your 1., what are the things that _you_ think can _not_ be in U(N)? and why?
> 
> On your 2., what element in U(N) do _you_ think the language symbol 0 of L(PA)
> must necessarily denote? and why?

This is not about what I think or what I ought to think, It is about what YOU think, YOU are presenting a proof, for me to understand that proof I must first be sure about what you are saying. The point is that I'm not understanding what are you saying exactly. That's the point. So here is my question again, I just want to make sure that I'm understanding what YOU are saying:

1. I think YOU are saying that U(N) which YOU name as "the universe of N", which is YOU also refer to as "the domain of discourse", this U(N) is a set of strings of symbols (as you said), you call them numeral strings, and I think those are the followings

U(N)={"0", "S(0)", "S(S(0))",....}

notice that I put "" around each element to emphasize that it is indeed the written string itself, i.e. the for example "0" denotes written symbol 0 itself, so it is this symbol itself that is an element of U(N) and not the object that 0 stands for that is an element of U(N).

I personally think that this is what YOU are saying. Perhaps I'm mistaken, so correct me if I'm wrong. So if I'm correct, then please make a note that this is correct. so that I can proceed with understanding this proof.

The second issue is that you say on point 4 the following:

4. If an element n of U(N) is interpreted as the informal natural number zero, or one, two, or any non-prime number, then in meta level the language  numeral (term) denoting (referring to) n is equal to the numeral n itself. /quote ends

what I don't understand is when you say... in meta level
"the language numeral (term) denoting n"

what is exactly that language numeral? 
first which language you mean???

If I'm correct since n itself is an element of U(N) then n itself is already a language numeral as you defined! it is a language numeral of language L(0,<,S,+,*), i.e. n itself is a symbol SS..(0) right. So what is the language numeral that DENOTES n, when I read that I think of another language, I mean a language other than  L(0,<,S,+,*), which is the meta-language of L, call this L*, now L* would have terms i.e. numerals that denote the terms n of language  L(0,<,S,+,*), is that what you mean??

If so then tell me what are the specifics of L*.

I'm not really sure of what you mean, that's the point, so if the above is what YOU mean, then tell me.


 

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


#171848

FromZuhair <zaljohar@gmail.com>
Date2018-02-04 03:33 -0800
Message-ID<8352be8a-3e99-4ad6-b3e5-509546be2648@googlegroups.com>
In reply to#171691
On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > 
> > OK, you have the proof and of course you are free
> > to present it the way you think it the best.
> 
> As mentioned, I'll try to do my best but thanks for being interested. 
> 
> > > ====================> 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.
> > > 
> > OK
> 
> > > 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)
> > > 
> > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> 
> To be precise N is an assumed language structure for the language of arithmetic
> L(0,<,S,+,*) that we think of as a particular model (called "the standard
> model") of PA - we assuming PA has a model. 
> 
> > > 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. 
> > > 
> > OK 
> 
> > > 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.
> > > 
> > Agreed!
> 
> > > 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).
> > >
> > Just a question, do you think that PA is sane, i.e. do you think the following:
> > 
> > for all S: PA proves S -> N|=S
> > 
> > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> >  
> 
> That's an _assumption_ *not a verifiable assertion*.
> 
> > > 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.
> 
> ==================> the proof of undecide(N |= gGC).
> 
> We assume the following: there exists a language structure, denoted by N, 
> for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> following conditions:
> 
> (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> 
> (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
>     the numerals (strings) written in L = L(0,<,S,+,*).
> 
> (3) Each element in U(N) encodes exactly one element of the Zermelo set
>     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
>     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
>     The encoding is as following: if the numeral X encodes the element e in 
>     the Zermelo set then the number of occurrences of 'S' in X is equal to the
>     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
>     represented in the Wiki page).
> 
> (4) If an element n of U(N) is interpreted as the informal natural number zero,
>     or one, two, or any non-prime number, then in meta level the language
>     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> 
> (5) If an element n of U(N) is interpreted as an informal natural prime number
>     other than two, then in meta level the language numeral (term) denoting
>     (referring to) n might or might NOT be equal to the numeral n itself.
> 
> (6) We take for granted there exists an uncountable collection of language
>     structures, denoted by K, all having the very same universe U(N), and like
>     N, all satisfying (1) - (5).
>     
> ======> The proof.
> 
> We'll then first show if gGC is true of the natural number then it must be true
> in any element N of K but since in N, for a general even number e within the
> range stipulated by gGC, we can't identify the existences of two primes p1, p2
> such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> 
> Assuming we're:
> 
> - in the context of an N being in K, and 
> - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> 
> Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
>
You mean:

Lemma 1: Ep [prime(p) ^ nk(length(numeral(p)))]
 
> Proof: By (5), p might not be numeral(p).
>         
> Lemma 2: Let N be in K, e be a general even number within the half open
>          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
>          then nK((p1+p2) <= e).
> 
> Proof: By Lemma 1:
> 
>        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
>        nk(length(numeral(p1+p2)), hence 
>        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
>        nK((p1+p2) <= e).
>               
> Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> numbers, it's not possible to know.
> 
> [In the next few posts, we'll also show that if ~gGC is true it's not possible
> to know it either.]

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


#171849

FromZuhair <zaljohar@gmail.com>
Date2018-02-04 03:51 -0800
Message-ID<a76a8738-16ad-4bbf-a3e4-17962bd8b923@googlegroups.com>
In reply to#171691
On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > 
> > OK, you have the proof and of course you are free
> > to present it the way you think it the best.
> 
> As mentioned, I'll try to do my best but thanks for being interested. 
> 
> > > ====================> 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.
> > > 
> > OK
> 
> > > 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)
> > > 
> > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> 
> To be precise N is an assumed language structure for the language of arithmetic
> L(0,<,S,+,*) that we think of as a particular model (called "the standard
> model") of PA - we assuming PA has a model. 
> 
> > > 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. 
> > > 
> > OK 
> 
> > > 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.
> > > 
> > Agreed!
> 
> > > 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).
> > >
> > Just a question, do you think that PA is sane, i.e. do you think the following:
> > 
> > for all S: PA proves S -> N|=S
> > 
> > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> >  
> 
> That's an _assumption_ *not a verifiable assertion*.
> 
> > > 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.
> 
> ==================> the proof of undecide(N |= gGC).
> 
> We assume the following: there exists a language structure, denoted by N, 
> for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> following conditions:
> 
> (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> 
> (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
>     the numerals (strings) written in L = L(0,<,S,+,*).
> 
> (3) Each element in U(N) encodes exactly one element of the Zermelo set
>     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
>     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
>     The encoding is as following: if the numeral X encodes the element e in 
>     the Zermelo set then the number of occurrences of 'S' in X is equal to the
>     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
>     represented in the Wiki page).
> 
> (4) If an element n of U(N) is interpreted as the informal natural number zero,
>     or one, two, or any non-prime number, then in meta level the language
>     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> 
> (5) If an element n of U(N) is interpreted as an informal natural prime number
>     other than two, then in meta level the language numeral (term) denoting
>     (referring to) n might or might NOT be equal to the numeral n itself.
> 
> (6) We take for granted there exists an uncountable collection of language
>     structures, denoted by K, all having the very same universe U(N), and like
>     N, all satisfying (1) - (5).
>     
> ======> The proof.
> 
> We'll then first show if gGC is true of the natural number then it must be true
> in any element N of K but since in N, for a general even number e within the
> range stipulated by gGC, we can't identify the existences of two primes p1, p2
> such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> 
> Assuming we're:
> 
> - in the context of an N being in K, and 
> - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> 
> Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> 
> Proof: By (5), p might not be numeral(p).
>         
> Lemma 2: Let N be in K, e be a general even number within the half open
>          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
>          then nK((p1+p2) <= e).
> 
> Proof: By Lemma 1:
> 
>        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
>        nk(length(numeral(p1+p2)), hence 
>        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
>        nK((p1+p2) <= e).
>               
> Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> numbers, it's not possible to know.
> 
> [In the next few posts, we'll also show that if ~gGC is true it's not possible
> to know it either.]

Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 

The question is:

Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?

In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 

Zuhair

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


#171862

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-04 08:15 -0800
Message-ID<1d1a6224-cd13-4d58-9f08-67cd8edaa620@googlegroups.com>
In reply to#171849
On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
> On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > > 
> > > OK, you have the proof and of course you are free
> > > to present it the way you think it the best.
> > 
> > As mentioned, I'll try to do my best but thanks for being interested. 
> > 
> > > > ====================> 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.
> > > > 
> > > OK
> > 
> > > > 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)
> > > > 
> > > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> > 
> > To be precise N is an assumed language structure for the language of arithmetic
> > L(0,<,S,+,*) that we think of as a particular model (called "the standard
> > model") of PA - we assuming PA has a model. 
> > 
> > > > 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. 
> > > > 
> > > OK 
> > 
> > > > 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.
> > > > 
> > > Agreed!
> > 
> > > > 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).
> > > >
> > > Just a question, do you think that PA is sane, i.e. do you think the following:
> > > 
> > > for all S: PA proves S -> N|=S
> > > 
> > > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> > >  
> > 
> > That's an _assumption_ *not a verifiable assertion*.
> > 
> > > > 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.
> > 
> > ==================> the proof of undecide(N |= gGC).
> > 
> > We assume the following: there exists a language structure, denoted by N, 
> > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > following conditions:
> > 
> > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > 
> > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> >     the numerals (strings) written in L = L(0,<,S,+,*).
> > 
> > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> >     The encoding is as following: if the numeral X encodes the element e in 
> >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> >     represented in the Wiki page).
> > 
> > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> >     or one, two, or any non-prime number, then in meta level the language
> >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > 
> > (5) If an element n of U(N) is interpreted as an informal natural prime number
> >     other than two, then in meta level the language numeral (term) denoting
> >     (referring to) n might or might NOT be equal to the numeral n itself.
> > 
> > (6) We take for granted there exists an uncountable collection of language
> >     structures, denoted by K, all having the very same universe U(N), and like
> >     N, all satisfying (1) - (5).
> >     
> > ======> The proof.
> > 
> > We'll then first show if gGC is true of the natural number then it must be true
> > in any element N of K but since in N, for a general even number e within the
> > range stipulated by gGC, we can't identify the existences of two primes p1, p2
> > such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> > 
> > Assuming we're:
> > 
> > - in the context of an N being in K, and 
> > - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> > 
> > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> > 
> > Proof: By (5), p might not be numeral(p).
> >         
> > Lemma 2: Let N be in K, e be a general even number within the half open
> >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
> >          then nK((p1+p2) <= e).
> > 
> > Proof: By Lemma 1:
> > 
> >        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
> >        nk(length(numeral(p1+p2)), hence 
> >        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
> >        nK((p1+p2) <= e).
> >               
> > Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> > numbers, it's not possible to know.
> > 
> > [In the next few posts, we'll also show that if ~gGC is true it's not possible
> > to know it either.]
> 
> Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 
> 
> The question is:
> 
> Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
> 
> In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
> So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 
> 
> Zuhair

Apparently you weren't telling the truth (even if unintentionally) when you
said "Ok" or "Agreed" my road-maps R1-R4 as seen in:

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

In particular R4 stipulates:

<quote>
  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.
</quote>

To which you clearly responded "Agreed!".

I also clearly indicated I'd stop explaining to you if there's any step you'd
fail to understand. So I won't further my explanation now.

So long and thank you for your time. Regards.

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


#171872

FromZuhair <zaljohar@gmail.com>
Date2018-02-04 14:22 -0800
Message-ID<f408a5b1-0bdc-4733-8f08-5db7b86e5e83@googlegroups.com>
In reply to#171862
On Sunday, February 4, 2018 at 7:15:24 PM UTC+3, Khong Dong wrote:
> On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
> > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > > > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > > > 
> > > > OK, you have the proof and of course you are free
> > > > to present it the way you think it the best.
> > > 
> > > As mentioned, I'll try to do my best but thanks for being interested. 
> > > 
> > > > > ====================> 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.
> > > > > 
> > > > OK
> > > 
> > > > > 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)
> > > > > 
> > > > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> > > 
> > > To be precise N is an assumed language structure for the language of arithmetic
> > > L(0,<,S,+,*) that we think of as a particular model (called "the standard
> > > model") of PA - we assuming PA has a model. 
> > > 
> > > > > 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. 
> > > > > 
> > > > OK 
> > > 
> > > > > 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.
> > > > > 
> > > > Agreed!
> > > 
> > > > > 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).
> > > > >
> > > > Just a question, do you think that PA is sane, i.e. do you think the following:
> > > > 
> > > > for all S: PA proves S -> N|=S
> > > > 
> > > > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> > > >  
> > > 
> > > That's an _assumption_ *not a verifiable assertion*.
> > > 
> > > > > 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.
> > > 
> > > ==================> the proof of undecide(N |= gGC).
> > > 
> > > We assume the following: there exists a language structure, denoted by N, 
> > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > following conditions:
> > > 
> > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > 
> > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > 
> > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > >     The encoding is as following: if the numeral X encodes the element e in 
> > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > >     represented in the Wiki page).
> > > 
> > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > >     or one, two, or any non-prime number, then in meta level the language
> > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > 
> > > (5) If an element n of U(N) is interpreted as an informal natural prime number
> > >     other than two, then in meta level the language numeral (term) denoting
> > >     (referring to) n might or might NOT be equal to the numeral n itself.
> > > 
> > > (6) We take for granted there exists an uncountable collection of language
> > >     structures, denoted by K, all having the very same universe U(N), and like
> > >     N, all satisfying (1) - (5).
> > >     
> > > ======> The proof.
> > > 
> > > We'll then first show if gGC is true of the natural number then it must be true
> > > in any element N of K but since in N, for a general even number e within the
> > > range stipulated by gGC, we can't identify the existences of two primes p1, p2
> > > such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> > > 
> > > Assuming we're:
> > > 
> > > - in the context of an N being in K, and 
> > > - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> > > 
> > > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> > > 
> > > Proof: By (5), p might not be numeral(p).
> > >         
> > > Lemma 2: Let N be in K, e be a general even number within the half open
> > >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
> > >          then nK((p1+p2) <= e).
> > > 
> > > Proof: By Lemma 1:
> > > 
> > >        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
> > >        nk(length(numeral(p1+p2)), hence 
> > >        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
> > >        nK((p1+p2) <= e).
> > >               
> > > Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> > > numbers, it's not possible to know.
> > > 
> > > [In the next few posts, we'll also show that if ~gGC is true it's not possible
> > > to know it either.]
> > 
> > Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 
> > 
> > The question is:
> > 
> > Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
> > 
> > In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
> > So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 
> > 
> > Zuhair
> 
> Apparently you weren't telling the truth (even if unintentionally) when you
> said "Ok" or "Agreed" my road-maps R1-R4 as seen in:
> 
> https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/IJmbAYjnBQAJ
> 
> In particular R4 stipulates:
> 
> <quote>
>   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.
> </quote>
> 
> To which you clearly responded "Agreed!".
> 
> I also clearly indicated I'd stop explaining to you if there's any step you'd
> fail to understand. So I won't further my explanation now.
> 
> So long and thank you for your time. Regards.

Well perhaps I missed something in that Roadmap, but for now, I'm not seeing your proof achieving anything related to that Roadmap itself. You only managed to bring a system in which gGC is undecidable in it. That's not surprising at all, one can your the very same trick of yours to prove that 1+1=2 is undecidable!, it doesn't mean anything really apart from meaning that the system is so weak to do the job.

 There is no clue how your system conforms to that Roadmap.  

Anyhow. Thanks for clarifying and presenting to me your "proof". 

Zuhair

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


#171875

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-04 14:45 -0800
Message-ID<daf8f605-f028-42ea-9453-83c4d92b59bf@googlegroups.com>
In reply to#171872
On Sunday, 4 February 2018 15:22:21 UTC-7, Zuhair  wrote:
> On Sunday, February 4, 2018 at 7:15:24 PM UTC+3, Khong Dong wrote:
> > On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
> > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > > > > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > > > > 
> > > > > OK, you have the proof and of course you are free
> > > > > to present it the way you think it the best.
> > > > 
> > > > As mentioned, I'll try to do my best but thanks for being interested. 
> > > > 
> > > > > > ====================> 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.
> > > > > > 
> > > > > OK
> > > > 
> > > > > > 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)
> > > > > > 
> > > > > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> > > > 
> > > > To be precise N is an assumed language structure for the language of arithmetic
> > > > L(0,<,S,+,*) that we think of as a particular model (called "the standard
> > > > model") of PA - we assuming PA has a model. 
> > > > 
> > > > > > 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. 
> > > > > > 
> > > > > OK 
> > > > 
> > > > > > 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.
> > > > > > 
> > > > > Agreed!
> > > > 
> > > > > > 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).
> > > > > >
> > > > > Just a question, do you think that PA is sane, i.e. do you think the following:
> > > > > 
> > > > > for all S: PA proves S -> N|=S
> > > > > 
> > > > > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> > > > >  
> > > > 
> > > > That's an _assumption_ *not a verifiable assertion*.
> > > > 
> > > > > > 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.
> > > > 
> > > > ==================> the proof of undecide(N |= gGC).
> > > > 
> > > > We assume the following: there exists a language structure, denoted by N, 
> > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > following conditions:
> > > > 
> > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > 
> > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > 
> > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > >     represented in the Wiki page).
> > > > 
> > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > >     or one, two, or any non-prime number, then in meta level the language
> > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > 
> > > > (5) If an element n of U(N) is interpreted as an informal natural prime number
> > > >     other than two, then in meta level the language numeral (term) denoting
> > > >     (referring to) n might or might NOT be equal to the numeral n itself.
> > > > 
> > > > (6) We take for granted there exists an uncountable collection of language
> > > >     structures, denoted by K, all having the very same universe U(N), and like
> > > >     N, all satisfying (1) - (5).
> > > >     
> > > > ======> The proof.
> > > > 
> > > > We'll then first show if gGC is true of the natural number then it must be true
> > > > in any element N of K but since in N, for a general even number e within the
> > > > range stipulated by gGC, we can't identify the existences of two primes p1, p2
> > > > such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> > > > 
> > > > Assuming we're:
> > > > 
> > > > - in the context of an N being in K, and 
> > > > - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> > > > 
> > > > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> > > > 
> > > > Proof: By (5), p might not be numeral(p).
> > > >         
> > > > Lemma 2: Let N be in K, e be a general even number within the half open
> > > >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
> > > >          then nK((p1+p2) <= e).
> > > > 
> > > > Proof: By Lemma 1:
> > > > 
> > > >        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
> > > >        nk(length(numeral(p1+p2)), hence 
> > > >        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
> > > >        nK((p1+p2) <= e).
> > > >               
> > > > Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> > > > numbers, it's not possible to know.
> > > > 
> > > > [In the next few posts, we'll also show that if ~gGC is true it's not possible
> > > > to know it either.]
> > > 
> > > Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 
> > > 
> > > The question is:
> > > 
> > > Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
> > > 
> > > In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
> > > So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 
> > > 
> > > Zuhair
> > 
> > Apparently you weren't telling the truth (even if unintentionally) when you
> > said "Ok" or "Agreed" my road-maps R1-R4 as seen in:
> > 
> > https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/IJmbAYjnBQAJ
> > 
> > In particular R4 stipulates:
> > 
> > <quote>
> >   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.
> > </quote>
> > 
> > To which you clearly responded "Agreed!".
> > 
> > I also clearly indicated I'd stop explaining to you if there's any step you'd
> > fail to understand. So I won't further my explanation now.
> > 
> > So long and thank you for your time. Regards.
> 
> Well perhaps I missed something in that Roadmap, but for now, I'm not seeing your proof achieving anything related to that Roadmap itself. You only managed to bring a system in which gGC is undecidable in it. That's not surprising at all, one can your the very same trick of yours to prove that 1+1=2 is undecidable!, it doesn't mean anything really apart from meaning that the system is so weak to do the job.
> 
>  There is no clue how your system conforms to that Roadmap.  

First you weren't telling the truth at least four times and now you begin to lie. Very typical 
of my sci.logic opponents.

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


#171876

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-04 23:04 +0000
Message-ID<p583i0$ujs$1@news.albasani.net>
In reply to#171875
Khong Dong wrote:
> On Sunday, 4 February 2018 15:22:21 UTC-7, Zuhair  wrote:
>> On Sunday, February 4, 2018 at 7:15:24 PM UTC+3, Khong Dong wrote:
>>> On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
>>>> On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
>>>>> On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
>>>>>> On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
>>>>>>>
>>>>>> OK, you have the proof and of course you are free
>>>>>> to present it the way you think it the best.
>>>>>
>>>>> As mentioned, I'll try to do my best but thanks for being interested.
>>>>>
>>>>>>> ====================> 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.
>>>>>>>
>>>>>> OK
>>>>>
>>>>>>> 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)
>>>>>>>
>>>>>> Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
>>>>>
>>>>> To be precise N is an assumed language structure for the language of arithmetic
>>>>> L(0,<,S,+,*) that we think of as a particular model (called "the standard
>>>>> model") of PA - we assuming PA has a model.
>>>>>
>>>>>>> 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.
>>>>>>>
>>>>>> OK
>>>>>
>>>>>>> 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.
>>>>>>>
>>>>>> Agreed!
>>>>>
>>>>>>> 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).
>>>>>>>
>>>>>> Just a question, do you think that PA is sane, i.e. do you think the following:
>>>>>>
>>>>>> for all S: PA proves S -> N|=S
>>>>>>
>>>>>> i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
>>>>>>   
>>>>>
>>>>> That's an _assumption_ *not a verifiable assertion*.
>>>>>
>>>>>>> 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.
>>>>>
>>>>> ==================> the proof of undecide(N |= gGC).
>>>>>
>>>>> We assume the following: there exists a language structure, denoted by N,
>>>>> for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the
>>>>> following conditions:
>>>>>
>>>>> (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
>>>>>
>>>>> (2) The universe (domain of discourse) of N, denoted by U(N), is the set of
>>>>>      the numerals (strings) written in L = L(0,<,S,+,*).
>>>>>
>>>>> (3) Each element in U(N) encodes exactly one element of the Zermelo set
>>>>>      (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
>>>>>      of the Zermelo set is encoded exactly by one numeral [element] in U(N).
>>>>>      The encoding is as following: if the numeral X encodes the element e in
>>>>>      the Zermelo set then the number of occurrences of 'S' in X is equal to the
>>>>>      number of occurrences of '{' - minus the leftmost '{' - of e (as e is
>>>>>      represented in the Wiki page).
>>>>>
>>>>> (4) If an element n of U(N) is interpreted as the informal natural number zero,
>>>>>      or one, two, or any non-prime number, then in meta level the language
>>>>>      numeral (term) denoting (referring to) n is equal to the numeral n itself.
>>>>>
>>>>> (5) If an element n of U(N) is interpreted as an informal natural prime number
>>>>>      other than two, then in meta level the language numeral (term) denoting
>>>>>      (referring to) n might or might NOT be equal to the numeral n itself.
>>>>>
>>>>> (6) We take for granted there exists an uncountable collection of language
>>>>>      structures, denoted by K, all having the very same universe U(N), and like
>>>>>      N, all satisfying (1) - (5).
>>>>>      
>>>>> ======> The proof.
>>>>>
>>>>> We'll then first show if gGC is true of the natural number then it must be true
>>>>> in any element N of K but since in N, for a general even number e within the
>>>>> range stipulated by gGC, we can't identify the existences of two primes p1, p2
>>>>> such that e = p1+p2, hence it's impossible to verify e = p1+p2.
>>>>>
>>>>> Assuming we're:
>>>>>
>>>>> - in the context of an N being in K, and
>>>>> - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
>>>>>
>>>>> Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
>>>>>
>>>>> Proof: By (5), p might not be numeral(p).
>>>>>          
>>>>> Lemma 2: Let N be in K, e be a general even number within the half open
>>>>>           interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
>>>>>           then nK((p1+p2) <= e).
>>>>>
>>>>> Proof: By Lemma 1:
>>>>>
>>>>>         nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
>>>>>         nk(length(numeral(p1+p2)), hence
>>>>>         nk(length(numeral(p1+p2)) <= length(numeral(e))), hence
>>>>>         nK((p1+p2) <= e).
>>>>>                
>>>>> Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
>>>>> numbers, it's not possible to know.
>>>>>
>>>>> [In the next few posts, we'll also show that if ~gGC is true it's not possible
>>>>> to know it either.]
>>>>
>>>> Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system.
>>>>
>>>> The question is:
>>>>
>>>> Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
>>>>
>>>> In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
>>>> So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has?
>>>>
>>>> Zuhair
>>>
>>> Apparently you weren't telling the truth (even if unintentionally) when you
>>> said "Ok" or "Agreed" my road-maps R1-R4 as seen in:
>>>
>>> https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/IJmbAYjnBQAJ
>>>
>>> In particular R4 stipulates:
>>>
>>> <quote>
>>>    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.
>>> </quote>
>>>
>>> To which you clearly responded "Agreed!".
>>>
>>> I also clearly indicated I'd stop explaining to you if there's any step you'd
>>> fail to understand. So I won't further my explanation now.
>>>
>>> So long and thank you for your time. Regards.
>>
>> Well perhaps I missed something in that Roadmap, but for now, I'm not seeing your proof achieving anything related to that Roadmap itself. You only managed to bring a system in which gGC is undecidable in it. That's not surprising at all, one can your the very same trick of yours to prove that 1+1=2 is undecidable!, it doesn't mean anything really apart from meaning that the system is so weak to do the job.
>>
>>   There is no clue how your system conforms to that Roadmap.
> 
> First you weren't telling the truth at least four times and now you begin to lie. Very typical
> of my sci.logic opponents.

What lie is Zuhair telling?  Note that to lie is to wilfully tell an 
untruth with the intention to deceive.

> 

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


#171952

FromZuhair <zaljohar@gmail.com>
Date2018-02-05 14:42 -0800
Message-ID<674c54ee-081b-49b9-910e-cba2f5696bd9@googlegroups.com>
In reply to#171875
On Monday, February 5, 2018 at 1:45:33 AM UTC+3, Khong Dong wrote:
> On Sunday, 4 February 2018 15:22:21 UTC-7, Zuhair  wrote:
> > On Sunday, February 4, 2018 at 7:15:24 PM UTC+3, Khong Dong wrote:
> > > On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
> > > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > > On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > > > > > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > > > > > 
> > > > > > OK, you have the proof and of course you are free
> > > > > > to present it the way you think it the best.
> > > > > 
> > > > > As mentioned, I'll try to do my best but thanks for being interested. 
> > > > > 
> > > > > > > ====================> 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.
> > > > > > > 
> > > > > > OK
> > > > > 
> > > > > > > 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)
> > > > > > > 
> > > > > > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> > > > > 
> > > > > To be precise N is an assumed language structure for the language of arithmetic
> > > > > L(0,<,S,+,*) that we think of as a particular model (called "the standard
> > > > > model") of PA - we assuming PA has a model. 
> > > > > 
> > > > > > > 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. 
> > > > > > > 
> > > > > > OK 
> > > > > 
> > > > > > > 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.
> > > > > > > 
> > > > > > Agreed!
> > > > > 
> > > > > > > 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).
> > > > > > >
> > > > > > Just a question, do you think that PA is sane, i.e. do you think the following:
> > > > > > 
> > > > > > for all S: PA proves S -> N|=S
> > > > > > 
> > > > > > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> > > > > >  
> > > > > 
> > > > > That's an _assumption_ *not a verifiable assertion*.
> > > > > 
> > > > > > > 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.
> > > > > 
> > > > > ==================> the proof of undecide(N |= gGC).
> > > > > 
> > > > > We assume the following: there exists a language structure, denoted by N, 
> > > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > > following conditions:
> > > > > 
> > > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > > 
> > > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > > 
> > > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > > >     represented in the Wiki page).
> > > > > 
> > > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > > >     or one, two, or any non-prime number, then in meta level the language
> > > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > 
> > > > > (5) If an element n of U(N) is interpreted as an informal natural prime number
> > > > >     other than two, then in meta level the language numeral (term) denoting
> > > > >     (referring to) n might or might NOT be equal to the numeral n itself.
> > > > > 
> > > > > (6) We take for granted there exists an uncountable collection of language
> > > > >     structures, denoted by K, all having the very same universe U(N), and like
> > > > >     N, all satisfying (1) - (5).
> > > > >     
> > > > > ======> The proof.
> > > > > 
> > > > > We'll then first show if gGC is true of the natural number then it must be true
> > > > > in any element N of K but since in N, for a general even number e within the
> > > > > range stipulated by gGC, we can't identify the existences of two primes p1, p2
> > > > > such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> > > > > 
> > > > > Assuming we're:
> > > > > 
> > > > > - in the context of an N being in K, and 
> > > > > - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> > > > > 
> > > > > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> > > > > 
> > > > > Proof: By (5), p might not be numeral(p).
> > > > >         
> > > > > Lemma 2: Let N be in K, e be a general even number within the half open
> > > > >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
> > > > >          then nK((p1+p2) <= e).
> > > > > 
> > > > > Proof: By Lemma 1:
> > > > > 
> > > > >        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
> > > > >        nk(length(numeral(p1+p2)), hence 
> > > > >        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
> > > > >        nK((p1+p2) <= e).
> > > > >               
> > > > > Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> > > > > numbers, it's not possible to know.
> > > > > 
> > > > > [In the next few posts, we'll also show that if ~gGC is true it's not possible
> > > > > to know it either.]
> > > > 
> > > > Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 
> > > > 
> > > > The question is:
> > > > 
> > > > Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
> > > > 
> > > > In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
> > > > So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 
> > > > 
> > > > Zuhair
> > > 
> > > Apparently you weren't telling the truth (even if unintentionally) when you
> > > said "Ok" or "Agreed" my road-maps R1-R4 as seen in:
> > > 
> > > https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/IJmbAYjnBQAJ
> > > 
> > > In particular R4 stipulates:
> > > 
> > > <quote>
> > >   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.
> > > </quote>
> > > 
> > > To which you clearly responded "Agreed!".
> > > 
> > > I also clearly indicated I'd stop explaining to you if there's any step you'd
> > > fail to understand. So I won't further my explanation now.
> > > 
> > > So long and thank you for your time. Regards.
> > 
> > Well perhaps I missed something in that Roadmap, but for now, I'm not seeing your proof achieving anything related to that Roadmap itself. You only managed to bring a system in which gGC is undecidable in it. That's not surprising at all, one can your the very same trick of yours to prove that 1+1=2 is undecidable!, it doesn't mean anything really apart from meaning that the system is so weak to do the job.
> > 
> >  There is no clue how your system conforms to that Roadmap.  
> 
> First you weren't telling the truth at least four times and now you begin to lie. Very typical 
> of my sci.logic opponents.

I don't know why you are making these accusations. I don't see how your alleged 'proof' satisfies your Roadmap. I mean what's the relationship between having an undecidable result in some weak system to Your Roadmap. 

Why you think that YOUR defined system meets the truth of the matter??? just because you held these assumptions doesn't mean that they are TRUE. so why you see your system where one cannot know the successor numerals denoting primes while can know the successor numerals for the evens and non-prime odds and for 1, why you see that premise to be true??? You need to provide justification for TRUTH of your system. what is that justification?

There is a gap in your argument. And it appears that you
know that missing information but not convaying it and I think this is un-intentional on your side. It appears that you expect us all to know that concealed information that provides the justification for truth of your system. But we don't. So if you have such justification and please put it forth, so that we can understand it.
This is better than accusing others and wasting time in hard feelings.

Zuhair

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


#171958

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-05 16:28 -0800
Message-ID<12091842-4bff-4247-b617-57ac6c8936b8@googlegroups.com>
In reply to#171952
On Monday, 5 February 2018 15:42:37 UTC-7, Zuhair  wrote:
> On Monday, February 5, 2018 at 1:45:33 AM UTC+3, Khong Dong wrote:
> > On Sunday, 4 February 2018 15:22:21 UTC-7, Zuhair  wrote:
> > > On Sunday, February 4, 2018 at 7:15:24 PM UTC+3, Khong Dong wrote:
> > > > On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
> > > > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > > > On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > > > > > > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > > > > > > 
> > > > > > > OK, you have the proof and of course you are free
> > > > > > > to present it the way you think it the best.
> > > > > > 
> > > > > > As mentioned, I'll try to do my best but thanks for being interested. 
> > > > > > 
> > > > > > > > ====================> 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.
> > > > > > > > 
> > > > > > > OK
> > > > > > 
> > > > > > > > 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)
> > > > > > > > 
> > > > > > > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> > > > > > 
> > > > > > To be precise N is an assumed language structure for the language of arithmetic
> > > > > > L(0,<,S,+,*) that we think of as a particular model (called "the standard
> > > > > > model") of PA - we assuming PA has a model. 
> > > > > > 
> > > > > > > > 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. 
> > > > > > > > 
> > > > > > > OK 
> > > > > > 
> > > > > > > > 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.
> > > > > > > > 
> > > > > > > Agreed!
> > > > > > 
> > > > > > > > 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).
> > > > > > > >
> > > > > > > Just a question, do you think that PA is sane, i.e. do you think the following:
> > > > > > > 
> > > > > > > for all S: PA proves S -> N|=S
> > > > > > > 
> > > > > > > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> > > > > > >  
> > > > > > 
> > > > > > That's an _assumption_ *not a verifiable assertion*.
> > > > > > 
> > > > > > > > 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.
> > > > > > 
> > > > > > ==================> the proof of undecide(N |= gGC).
> > > > > > 
> > > > > > We assume the following: there exists a language structure, denoted by N, 
> > > > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > > > following conditions:
> > > > > > 
> > > > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > > > 
> > > > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > > > 
> > > > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > > > >     represented in the Wiki page).
> > > > > > 
> > > > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > > > >     or one, two, or any non-prime number, then in meta level the language
> > > > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > 
> > > > > > (5) If an element n of U(N) is interpreted as an informal natural prime number
> > > > > >     other than two, then in meta level the language numeral (term) denoting
> > > > > >     (referring to) n might or might NOT be equal to the numeral n itself.
> > > > > > 
> > > > > > (6) We take for granted there exists an uncountable collection of language
> > > > > >     structures, denoted by K, all having the very same universe U(N), and like
> > > > > >     N, all satisfying (1) - (5).
> > > > > >     
> > > > > > ======> The proof.
> > > > > > 
> > > > > > We'll then first show if gGC is true of the natural number then it must be true
> > > > > > in any element N of K but since in N, for a general even number e within the
> > > > > > range stipulated by gGC, we can't identify the existences of two primes p1, p2
> > > > > > such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> > > > > > 
> > > > > > Assuming we're:
> > > > > > 
> > > > > > - in the context of an N being in K, and 
> > > > > > - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> > > > > > 
> > > > > > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> > > > > > 
> > > > > > Proof: By (5), p might not be numeral(p).
> > > > > >         
> > > > > > Lemma 2: Let N be in K, e be a general even number within the half open
> > > > > >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
> > > > > >          then nK((p1+p2) <= e).
> > > > > > 
> > > > > > Proof: By Lemma 1:
> > > > > > 
> > > > > >        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
> > > > > >        nk(length(numeral(p1+p2)), hence 
> > > > > >        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
> > > > > >        nK((p1+p2) <= e).
> > > > > >               
> > > > > > Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> > > > > > numbers, it's not possible to know.
> > > > > > 
> > > > > > [In the next few posts, we'll also show that if ~gGC is true it's not possible
> > > > > > to know it either.]
> > > > > 
> > > > > Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 
> > > > > 
> > > > > The question is:
> > > > > 
> > > > > Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
> > > > > 
> > > > > In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
> > > > > So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 
> > > > > 
> > > > > Zuhair
> > > > 
> > > > Apparently you weren't telling the truth (even if unintentionally) when you
> > > > said "Ok" or "Agreed" my road-maps R1-R4 as seen in:
> > > > 
> > > > https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/IJmbAYjnBQAJ
> > > > 
> > > > In particular R4 stipulates:
> > > > 
> > > > <quote>
> > > >   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.
> > > > </quote>
> > > > 
> > > > To which you clearly responded "Agreed!".
> > > > 
> > > > I also clearly indicated I'd stop explaining to you if there's any step you'd
> > > > fail to understand. So I won't further my explanation now.
> > > > 
> > > > So long and thank you for your time. Regards.
> > > 
> > > Well perhaps I missed something in that Roadmap, but for now, I'm not seeing your proof achieving anything related to that Roadmap itself. You only managed to bring a system in which gGC is undecidable in it. That's not surprising at all, one can your the very same trick of yours to prove that 1+1=2 is undecidable!, it doesn't mean anything really apart from meaning that the system is so weak to do the job.
> > > 
> > >  There is no clue how your system conforms to that Roadmap.  
> > 
> > First you weren't telling the truth at least four times and now you begin to lie. Very typical 
> > of my sci.logic opponents.
> 
> I don't know why you are making these accusations. I don't see how your alleged 'proof' satisfies your Roadmap. I mean what's the relationship between having an undecidable result in some weak system to Your Roadmap. 

I think you'd agree with me in academic or technical matters you don't distort
your peer's or opponent's position by and because of your not being truthful
accidentally or not. Four times you didn't tell me the truth that you didn't
understand my positions via R1-R4 and yet you accused me as performing some
"trick" ("magic") in, say, proving "that 1+1=2 is undecidable. Just stop
arguing in that manner. You don't understand something I've said, just simply
ask for clarification and things would move forward.

> Why you think that YOUR defined system meets the truth of the matter???

Apparently you didn't understand what my R2 and R3 say! It's not my fault
that you now don't understand because your previously having answered "Ok" to
them all robbed me an opportunity to explain them to you thoroughly!

> just because you held these assumptions doesn't mean that they are TRUE. so
> why you see your system where one cannot know the successor numerals denoting
> primes while can know the successor numerals for the evens and non-prime odds
> and for 1, why you see that premise to be true??? You need to provide
> justification for TRUTH of your system. what is that justification?

Your protest here is due to the fact that you didn't and don't quite understand
what R2 _really_ says:

<quote>

 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) 
</quote>

> 
> There is a gap in your argument. And it appears that you
> know that missing information but not convaying it and I think this is
> un-intentional on your side. It appears that you expect us all to know that
> concealed information that provides the justification for truth of your
> system. But we don't. So if you have such justification and please put it
> forth, so that we can understand it.
> This is better than accusing others and wasting time in hard feelings.

Sure. But there's no gap: just what you perceived as a gap based on your
_preconceived_ notion of "standard model". Let me prove it to you. 

Your main protest is contained in your previous "you [Nam] did that by not
fixing a successor numeral representation for the primes". Ok. Let's suppose
you know a family of 6 siblings with their ages as following:

 John (1), Joe (2), Jim (3), Jane (4), Joyce (5), Janet (6)

Suppose further you formalize the siblings' information with the FOL language
L(John, younger, S), where "John" is an individual constant symbol, "younger"
is a binary relation symbol, and S is a unary function symbol. Your "standard"
language structure or "model" would include the following:

U (the universe) = 

  {
    {{}}, {{{}}}, {{{{}}}}, {{{{{}}}}}, {{{{{{}}}}}}, {{{{{{{}}}}}}}
  }
                   }

<John, {{}}>

<S, { <{{}}, {{{}}}>, <{{{}}}, {{{{}}}}>, <{{{{}}}}, {{{{{}}}}}>, ... }>

<younger,{ <{{}},{{{}}}>, <{{}},{{{{}}}}>, <{{{}}},{{{{{{}}}}}}>, ...}>

Of course the elements of U are Zermelo's sets. Now few questions for you:

Q1: Does the youngest sibling John have to _be_  the Zermelo's element {{}}?
    Of course not. No more than the intuitive number zero _is_ the Zermelo's
    (or for that matter Von Neumann's) element {}. Right?

Q2: If I have the _meta_ expression "there's a sibling next older than John but
    whose age is a prime number", must that be logically necessarily be the
    element {{{{}}}} which in the example above is an _individual surrogate_
    for Jim? The answer is NO - *in general*. If you alter the denotation of
    the symbols John, S, or younger, different Zermelo's element could or could
    not be Jim!

So you got the picture now, and would understand the role of "individual
surrogate" vis-a-viz language structures or "models", right? This is a finite
example but in the case of the natural numbers and any alleged corresponding
language structure we'd be talking about infinite cardinality of course, and
in such case the ttruth about the prime numbers can be much more convoluted
- and even more malleable.

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


#171963

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-05 16:45 -0800
Message-ID<3dc86fea-d01b-4f8d-830b-c7785ab5daf5@googlegroups.com>
In reply to#171958
On Monday, 5 February 2018 17:28:18 UTC-7, Khong Dong  wrote:
> On Monday, 5 February 2018 15:42:37 UTC-7, Zuhair  wrote:
> > On Monday, February 5, 2018 at 1:45:33 AM UTC+3, Khong Dong wrote:
> > > On Sunday, 4 February 2018 15:22:21 UTC-7, Zuhair  wrote:
> > > > On Sunday, February 4, 2018 at 7:15:24 PM UTC+3, Khong Dong wrote:
> > > > > On Sunday, 4 February 2018 04:51:40 UTC-7, Zuhair  wrote:
> > > > > > On Friday, February 2, 2018 at 7:33:07 AM UTC+3, Khong Dong wrote:
> > > > > > > On Wednesday, 31 January 2018 13:08:53 UTC-7, Zuhair  wrote:
> > > > > > > > On Monday, January 29, 2018 at 1:51:49 AM UTC+3, 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.
> > > > > > > > > 
> > > > > > > > OK, you have the proof and of course you are free
> > > > > > > > to present it the way you think it the best.
> > > > > > > 
> > > > > > > As mentioned, I'll try to do my best but thanks for being interested. 
> > > > > > > 
> > > > > > > > > ====================> 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.
> > > > > > > > > 
> > > > > > > > OK
> > > > > > > 
> > > > > > > > > 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)
> > > > > > > > > 
> > > > > > > > Ok, I'll take that to mean that N is a standard model of arithmetic. Right?
> > > > > > > 
> > > > > > > To be precise N is an assumed language structure for the language of arithmetic
> > > > > > > L(0,<,S,+,*) that we think of as a particular model (called "the standard
> > > > > > > model") of PA - we assuming PA has a model. 
> > > > > > > 
> > > > > > > > > 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. 
> > > > > > > > > 
> > > > > > > > OK 
> > > > > > > 
> > > > > > > > > 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.
> > > > > > > > > 
> > > > > > > > Agreed!
> > > > > > > 
> > > > > > > > > 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).
> > > > > > > > >
> > > > > > > > Just a question, do you think that PA is sane, i.e. do you think the following:
> > > > > > > > 
> > > > > > > > for all S: PA proves S -> N|=S
> > > > > > > > 
> > > > > > > > i.e. whatever sentence S that PA proves as being true, then S is satisfied in N (since N satisfies only and all true sentences about the naturals)
> > > > > > > >  
> > > > > > > 
> > > > > > > That's an _assumption_ *not a verifiable assertion*.
> > > > > > > 
> > > > > > > > > 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.
> > > > > > > 
> > > > > > > ==================> the proof of undecide(N |= gGC).
> > > > > > > 
> > > > > > > We assume the following: there exists a language structure, denoted by N, 
> > > > > > > for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> > > > > > > following conditions:
> > > > > > > 
> > > > > > > (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
> > > > > > > 
> > > > > > > (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
> > > > > > >     the numerals (strings) written in L = L(0,<,S,+,*).
> > > > > > > 
> > > > > > > (3) Each element in U(N) encodes exactly one element of the Zermelo set
> > > > > > >     (https://en.wikipedia.org/wiki/Natural_number), and vice versa each element
> > > > > > >     of the Zermelo set is encoded exactly by one numeral [element] in U(N). 
> > > > > > >     The encoding is as following: if the numeral X encodes the element e in 
> > > > > > >     the Zermelo set then the number of occurrences of 'S' in X is equal to the
> > > > > > >     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
> > > > > > >     represented in the Wiki page).
> > > > > > > 
> > > > > > > (4) If an element n of U(N) is interpreted as the informal natural number zero,
> > > > > > >     or one, two, or any non-prime number, then in meta level the language
> > > > > > >     numeral (term) denoting (referring to) n is equal to the numeral n itself.
> > > > > > > 
> > > > > > > (5) If an element n of U(N) is interpreted as an informal natural prime number
> > > > > > >     other than two, then in meta level the language numeral (term) denoting
> > > > > > >     (referring to) n might or might NOT be equal to the numeral n itself.
> > > > > > > 
> > > > > > > (6) We take for granted there exists an uncountable collection of language
> > > > > > >     structures, denoted by K, all having the very same universe U(N), and like
> > > > > > >     N, all satisfying (1) - (5).
> > > > > > >     
> > > > > > > ======> The proof.
> > > > > > > 
> > > > > > > We'll then first show if gGC is true of the natural number then it must be true
> > > > > > > in any element N of K but since in N, for a general even number e within the
> > > > > > > range stipulated by gGC, we can't identify the existences of two primes p1, p2
> > > > > > > such that e = p1+p2, hence it's impossible to verify e = p1+p2.
> > > > > > > 
> > > > > > > Assuming we're:
> > > > > > > 
> > > > > > > - in the context of an N being in K, and 
> > > > > > > - length(numeral(n)) <=> (The number of occurrences of 'S' in the numeral of n).
> > > > > > > 
> > > > > > > Lemma 1: Ep[prime(p)] => nk(length(numeral(p))).
> > > > > > > 
> > > > > > > Proof: By (5), p might not be numeral(p).
> > > > > > >         
> > > > > > > Lemma 2: Let N be in K, e be a general even number within the half open
> > > > > > >          interval stipulated by gGC, and Ep1[prime(p1)] and Ep2[prime(p2)],
> > > > > > >          then nK((p1+p2) <= e).
> > > > > > > 
> > > > > > > Proof: By Lemma 1:
> > > > > > > 
> > > > > > >        nk(length(numeral(p1)) and nk(length(numeral(p2)), hence
> > > > > > >        nk(length(numeral(p1+p2)), hence 
> > > > > > >        nk(length(numeral(p1+p2)) <= length(numeral(e))), hence 
> > > > > > >        nK((p1+p2) <= e).
> > > > > > >               
> > > > > > > Lemma 1 and Lemma 2 are sufficient to show that if gGC is true of the natural
> > > > > > > numbers, it's not possible to know.
> > > > > > > 
> > > > > > > [In the next few posts, we'll also show that if ~gGC is true it's not possible
> > > > > > > to know it either.]
> > > > > > 
> > > > > > Now that I know what your terminology stands for (I think?), then I see what you mean by undecidability of gGC, but this undecidability only holds in YOUR defined system. You've weakened your system too much as to render it indecisive from the outset!?, you did that by not fixing a successor numeral representation for the primes, so of course in that case, since everything is dependent on this successor notation, then if we don't know what is it for the primes, then of course the system will be indecisive. This demonstrates just undecidability of gGC in YOUR system. 
> > > > > > 
> > > > > > The question is:
> > > > > > 
> > > > > > Why should I believe that YOUR system represents the TRUTH of matter so far! in other words, why should I take this result to constitute a proof that for example, PA cannot decide on gGC?
> > > > > > 
> > > > > > In PA, for example, we do indeed have a FIXED numeral representation of the naturals, whether they are primes or not, prime number 11 has 11 successor symbols in it, and we have the rule length(numeral(p))=p itself for all primes, and also this is the case for every natural really. At least this is what the standard model says.
> > > > > > So we don't have the premises that you incline on in your system. So why should we think that PA will bear the same inabilities that your system has? 
> > > > > > 
> > > > > > Zuhair
> > > > > 
> > > > > Apparently you weren't telling the truth (even if unintentionally) when you
> > > > > said "Ok" or "Agreed" my road-maps R1-R4 as seen in:
> > > > > 
> > > > > https://groups.google.com/d/msg/sci.logic/qJ62HXLYluM/IJmbAYjnBQAJ
> > > > > 
> > > > > In particular R4 stipulates:
> > > > > 
> > > > > <quote>
> > > > >   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.
> > > > > </quote>
> > > > > 
> > > > > To which you clearly responded "Agreed!".
> > > > > 
> > > > > I also clearly indicated I'd stop explaining to you if there's any step you'd
> > > > > fail to understand. So I won't further my explanation now.
> > > > > 
> > > > > So long and thank you for your time. Regards.
> > > > 
> > > > Well perhaps I missed something in that Roadmap, but for now, I'm not seeing your proof achieving anything related to that Roadmap itself. You only managed to bring a system in which gGC is undecidable in it. That's not surprising at all, one can your the very same trick of yours to prove that 1+1=2 is undecidable!, it doesn't mean anything really apart from meaning that the system is so weak to do the job.
> > > > 
> > > >  There is no clue how your system conforms to that Roadmap.  
> > > 
> > > First you weren't telling the truth at least four times and now you begin to lie. Very typical 
> > > of my sci.logic opponents.
> > 
> > I don't know why you are making these accusations. I don't see how your alleged 'proof' satisfies your Roadmap. I mean what's the relationship between having an undecidable result in some weak system to Your Roadmap. 
> 
> I think you'd agree with me in academic or technical matters you don't distort
> your peer's or opponent's position by and because of your not being truthful
> accidentally or not. Four times you didn't tell me the truth that you didn't
> understand my positions via R1-R4 and yet you accused me as performing some
> "trick" ("magic") in, say, proving "that 1+1=2 is undecidable. Just stop
> arguing in that manner. You don't understand something I've said, just simply
> ask for clarification and things would move forward.
> 
> > Why you think that YOUR defined system meets the truth of the matter???
> 
> Apparently you didn't understand what my R2 and R3 say! It's not my fault
> that you now don't understand because your previously having answered "Ok" to
> them all robbed me an opportunity to explain them to you thoroughly!
> 
> > just because you held these assumptions doesn't mean that they are TRUE. so
> > why you see your system where one cannot know the successor numerals denoting
> > primes while can know the successor numerals for the evens and non-prime odds
> > and for 1, why you see that premise to be true??? You need to provide
> > justification for TRUTH of your system. what is that justification?
> 
> Your protest here is due to the fact that you didn't and don't quite understand
> what R2 _really_ says:
> 
> <quote>
> 
>  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) 
> </quote>
> 
> > 
> > There is a gap in your argument. And it appears that you
> > know that missing information but not convaying it and I think this is
> > un-intentional on your side. It appears that you expect us all to know that
> > concealed information that provides the justification for truth of your
> > system. But we don't. So if you have such justification and please put it
> > forth, so that we can understand it.
> > This is better than accusing others and wasting time in hard feelings.
> 
> Sure. But there's no gap: just what you perceived as a gap based on your
> _preconceived_ notion of "standard model". Let me prove it to you. 
> 
> Your main protest is contained in your previous "you [Nam] did that by not
> fixing a successor numeral representation for the primes". Ok. Let's suppose
> you know a family of 6 siblings with their ages as following:
> 
>  John (1), Joe (2), Jim (3), Jane (4), Joyce (5), Janet (6)
> 
> Suppose further you formalize the siblings' information with the FOL language
> L(John, younger, S), where "John" is an individual constant symbol, "younger"
> is a binary relation symbol, and S is a unary function symbol. Your "standard"
> language structure or "model" would include the following:
> 
> U (the universe) = 
> 
>   {
>     {{}}, {{{}}}, {{{{}}}}, {{{{{}}}}}, {{{{{{}}}}}}, {{{{{{{}}}}}}}
>   }
>                    }
> 
> <John, {{}}>
> 
> <S, { <{{}}, {{{}}}>, <{{{}}}, {{{{}}}}>, <{{{{}}}}, {{{{{}}}}}>, ... }>
> 
> <younger,{ <{{}},{{{}}}>, <{{}},{{{{}}}}>, <{{{}}},{{{{{{}}}}}}>, ...}>
> 
> Of course the elements of U are Zermelo's sets. Now few questions for you:
> 
> Q1: Does the youngest sibling John have to _be_  the Zermelo's element {{}}?
>     Of course not. No more than the intuitive number zero _is_ the Zermelo's
>     (or for that matter Von Neumann's) element {}. Right?
> 
> Q2: If I have the _meta_ expression "there's a sibling next older than John but
>     whose age is a prime number", must that be logically necessarily be the
>     element {{{{}}}} which in the example above is an _individual surrogate_
>     for Jim? The answer is NO - *in general*. If you alter the denotation of
>     the symbols John, S, or younger, different Zermelo's element could or could
>     not be Jim!
> 
> So you got the picture now, and would understand the role of "individual
> surrogate" vis-a-viz language structures or "models", right? This is a finite
> example but in the case of the natural numbers and any alleged corresponding
> language structure we'd be talking about infinite cardinality of course, and
> in such case the ttruth about the prime numbers can be much more convoluted
> - and even more malleable.

Iow, the prime "fixing" you alluded to above is inaccessible in the case of the
concept of the "natural numbers", or any "model" worthy of conveying or being a
surrogate for the concept: you can't positively encode this "fixing" as you
intend, desire!

In my presentation I couldn't prime-number "fix" it because I can't. Neither
can you. Neither can  any mortal mathematician: it's impossible to "fix" all
the infinitely many prime numbers that way!

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


#172000

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-06 13:43 +0000
Message-ID<p5cbem$e01$1@news.albasani.net>
In reply to#171875
Khong Dong wrote:

> First you [Zuhair] weren't telling the truth at least four times and now you begin to lie. Very typical
> of my sci.logic opponents.

It never takes long for the insult slinging to begin, does it?  I think 
Zuhair entered the discussion on the 27th of last month, that's just ten 
days ago.  How are you in real life?  Do you start snarling insults at 
everyone you meet within a couple of weeks?

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


#172001

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-06 14:58 +0000
Message-ID<87eflykvvd.fsf@bsb.me.uk>
In reply to#172000
Peter Percival <peterxpercival@hotmail.com> writes:

> Khong Dong wrote:
>
>> First you [Zuhair] weren't telling the truth at least four times and
>> now you begin to lie. Very typical of my sci.logic opponents.
>
> It never takes long for the insult slinging to begin, does it?

It's so common it must be taught in "Crank 101".  And it's very
effective.  Once you make it clear (often by accidentally answering a
question) that you are posting nonsense, how else can you get people to
keep talking to you?  Insulting them will often get a rise.

-- 
Ben.

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


#172007

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-06 07:27 -0800
Message-ID<8c1553c3-3f9d-43b2-b09b-c8b3b4398a8c@googlegroups.com>
In reply to#172001
On Tuesday, 6 February 2018 07:58:48 UTC-7, Ben Bacarisse  wrote:
> Peter Percival <peterxpercival@hotmail.com> writes:
> 
> > Khong Dong wrote:
> >
> >> First you [Zuhair] weren't telling the truth at least four times and
> >> now you begin to lie. Very typical of my sci.logic opponents.
> >
> > It never takes long for the insult slinging to begin, does it?
> 
> It's so common it must be taught in "Crank 101".  And it's very
> effective.  Once you make it clear (often by accidentally answering a
> question) that you are posting nonsense, how else can you get people to
> keep talking to you?  Insulting them will often get a rise.

Stop being a modern day pathetic inquisition.

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


#171886

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-02-04 17:35 -0800
Message-ID<70b61e76-6fa6-4338-a77f-dc84cd0b72fe@googlegroups.com>
In reply to#171691
On Thursday, February 1, 2018 at 11:33:07 PM UTC-5, Khong Dong wrote:
> We assume the following: there exists a language structure, denoted by N, 
> for the familar language of arithmetic L=L(0,<,S,+,*) statisfying the 
> following conditions:

It would be nice if you understood what you just wrote, but you are
about to prove that you don't.

> 
> (1) N satisfies R2: ARITHMETICALLY-TRUE(F) => (N |= F).
Given that you can already say N|=F, why do you need A LONGER way of saying
that? And why are you using F (for Formula) when that also is the first initial
OF FALSE, but you are trying to mean that the formula is TRUE??
You can do arithmetic in a lot more places than N.  Choosing
"Arithmetical" to connote being limited specifically to N is almost as
unfortunate as choosing "F" for a truth of N.


> (2) The universe (domain of discourse) of N, denoted by U(N), is the set of 
>     the numerals (strings) written in L = L(0,<,S,+,*).
> 
> (3) Each element in U(N) encodes exactly one element of the Zermelo set
>     (https://en.wikipedia.org/wiki/Natural_number),

This is absurd. You already HAVE a universe of discourse.
You are already using the (numeral) terms of the language as your universe
of discourse.  Invoking Z's version of N is NOT going to help!  IF you were
going to invoke it then you SHOULD have allowed THAT (or rather the
von Neumann ones) to be the universe of discourse!

>  and vice versa each element of the Zermelo set is encoded
> exactly by one numeral [element] in U(N). 

Exactly, which is why you don't need both of them.

>     The encoding is as following: 

Oh, SHUT UP. EVERYBODY KNOWS the encoding!
You are just giving yourself more chances to male yourself look
stupid by messing up something simple!

> if the numeral X encodes the element e in 
>     the Zermelo set then the number of occurrences of 'S' in X is equal to the
>     number of occurrences of '{' - minus the leftmost '{' - of e (as e is
>     represented in the Wiki page).
That would be "the number of occurences of '{' minus ONE, you idiot --
if you start with a number and minus, you have to finish with ANOTHER NUMBER,
NOT with "the leftmost '{' - of" something.  And why are you saying "in the wiki page"??  This stuff is broadly known everywhere -- it is not like anyone is
going TO GO TO THE WIKI PAGE, like THAT might be an authority!!

> 
> (4) If an element n of U(N) is interpreted as the
> informal natural number zero,
>     or one, two, or any non-prime number, then in meta level

Oh, shut up. THERE IS NO SUCH PLACE as "in meta level". YOU DO NOT know what
you mean by that.  IF you knew, THEN you would know that "the informal natural
number" level IS ALREADY THAT LEVEL -- you do not need to create two of them.

But this really sort of all went wrong when you started by referring to N
as a language structure.
N was already the set of natural numbers -- that's what N *ALWAYS* is -- that's
just THE GENERAL CONVENTION about what N is going to be in this context.
It's THE DOMAIN of the structure.  You called that U(N) but that's not
conventional either.
Conventional in this case IS JUST TO CONFLATE the model N with its domain N
because there IS ONE KNOWN UNIQUE way that + and x operate on natural numbers.
IT IS NOT like you could be using THAT domain and still mean some OTHER
model of the axioms.  I mean, it's theoretically possible, but it's not what
anyone was about TO DO, around HERE, in the context of Goldbach's conjecture,
which really is about the real N with THE USUAL addition and multiplication.
There was no need to split anything off at all.  You could have just said
the standard model and BEEN DONE with it.

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


#171887

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-04 18:41 -0800
Message-ID<d2cef246-5719-45a3-9c99-33769289f746@googlegroups.com>
In reply to#171886
On Sunday, 4 February 2018 18:35:12 UTC-7, George Greene  wrote:
> On Thursday, February 1, 2018 at 11:33:07 PM UTC-5, Khong Dong wrote:
 
> > (4) If an element n of U(N) is interpreted as the
> > informal natural number zero,
> >     or one, two, or any non-prime number, then in meta level
> 
> Oh, shut up. THERE IS NO SUCH PLACE as "in meta level". YOU DO NOT know what
> you mean by that.  IF you knew, THEN you would know that "the informal natural
> number" level IS ALREADY THAT LEVEL -- you do not need to create two of them.
> 
> But this really sort of all went wrong when you started by referring to N
> as a language structure.
> N was already the set of natural numbers -- that's what N *ALWAYS* is -- that's
> just THE GENERAL CONVENTION about what N is going to be in this context.
> It's THE DOMAIN of the structure.  You called that U(N) but that's not
> conventional either.
> Conventional in this case IS JUST TO CONFLATE the model N with its domain N
> because there IS ONE KNOWN UNIQUE way that + and x operate on natural numbers.
> IT IS NOT like you could be using THAT domain and still mean some OTHER
> model of the axioms.  I mean, it's theoretically possible, but it's not what
> anyone was about TO DO, around HERE, in the context of Goldbach's conjecture,
> which really is about the real N with THE USUAL addition and multiplication.
> There was no need to split anything off at all.  You could have just said
> the standard model and BEEN DONE with it.

  “need for researchers to deactivate the thought patterns that they have
   installed in their brains and taken for granted for so many years”.
                                                       Shinichi Mochizuki

Mochizuki was being polite. Stop being brainwashed, George and my other opponents!

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


#171927

FromKhong Dong <khongdongphong@gmail.com>
Date2018-02-05 11:17 -0800
Message-ID<c92d464b-0187-4d7a-bbcf-295c044a3020@googlegroups.com>
In reply to#171887
On Sunday, 4 February 2018 19:41:40 UTC-7, Khong Dong  wrote:
> On Sunday, 4 February 2018 18:35:12 UTC-7, George Greene  wrote:
> > On Thursday, February 1, 2018 at 11:33:07 PM UTC-5, Khong Dong wrote:
>  
> > > (4) If an element n of U(N) is interpreted as the
> > > informal natural number zero,
> > >     or one, two, or any non-prime number, then in meta level
> > 
> > Oh, shut up. THERE IS NO SUCH PLACE as "in meta level". YOU DO NOT know what
> > you mean by that.  IF you knew, THEN you would know that "the informal natural
> > number" level IS ALREADY THAT LEVEL -- you do not need to create two of them.
> > 
> > But this really sort of all went wrong when you started by referring to N
> > as a language structure.
> > N was already the set of natural numbers -- that's what N *ALWAYS* is -- that's
> > just THE GENERAL CONVENTION about what N is going to be in this context.
> > It's THE DOMAIN of the structure.  You called that U(N) but that's not
> > conventional either.
> > Conventional in this case IS JUST TO CONFLATE the model N with its domain N
> > because there IS ONE KNOWN UNIQUE way that + and x operate on natural numbers.
> > IT IS NOT like you could be using THAT domain and still mean some OTHER
> > model of the axioms.  I mean, it's theoretically possible, but it's not what
> > anyone was about TO DO, around HERE, in the context of Goldbach's conjecture,
> > which really is about the real N with THE USUAL addition and multiplication.
> > There was no need to split anything off at all.  You could have just said
> > the standard model and BEEN DONE with it.
> 
>   “need for researchers to deactivate the thought patterns that they have
>    installed in their brains and taken for granted for so many years”.
>                                                        Shinichi Mochizuki
> 
> Mochizuki was being polite. Stop being brainwashed, George and my other opponents!

Of Mochizuki's work (on his claim of solving the abc conjecture), Fesenko said:

 "one must look at whole numbers in a different light - leaving addition aside
  and seeing the multiplication structure as something malleable and
  deformable. Standard multiplication would then be just one particular case
  of a family of structures, just as a circle is a special case of an ellipse."

"Family of structures"? I have little doubt that that "family of structures"
would be an extension of (if not outright identical to) my uncountable
collection K (mentioned in R5) of language structures for L(PA) in which
through them (the structures) certain arithmetic truths _about_ the natural
numbers expressed as formulas written in L(PA) would be malleable, deformable,
or otherwise relativistic: given only the existence of a _general_ prime
(surrogate) p, any numeral string of any non trivial multiple of p (such as
2*p) can be malleable- bent, stretched, or deformed - to different lengths at
will!

That malleability (deformation) understanding though would require us to
abandon the circular, dubious, unverifiable, and incorrect belief on the
existence of "the standard model" of PA. The belief that has  been "installed
in [our] brains and taken for granted for so many years".

Or, for that matter, (incorrect) belief on the validity of GIT, since GIT would
require the notion of *absolute*, un-malleable, arithmetic truths.

In fact I suspect (but only suspect) that Mochizuki's having not been willing
to explain his abc proof to the mathematics community rooted in one major
reason: he didn't want to offend the mathematicians - his peers - by telling
them that what Godel did in GIT is invalid and that the notion and their belief
that they know precisely what the "standard" model be is an incorrectness
they've taken for granted for so many years. Which is true whether or not my
suspicion is correct.

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


#171928

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-05 19:20 +0000
Message-ID<p5aaq5$sqm$1@news.albasani.net>
In reply to#171927
Khong Dong wrote:

> 
> Or, for that matter, (incorrect) belief on the validity of GIT, since GIT would
> require the notion of *absolute*, un-malleable, arithmetic truths.

What makes you think that?

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


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

Back to top | Article view | sci.logic


csiph-web