Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #171074 > unrolled thread
| Started by | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| First post | 2018-01-25 22:27 -0800 |
| Last post | 2018-02-05 19:18 -0800 |
| Articles | 20 on this page of 141 — 7 participants |
Back to article view | Back to sci.logic
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 4 of 8 — ← Prev page 1 2 3 [4] 5 6 7 8 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-30 16:26 +0000 |
| Message-ID | <87zi4vcnyz.fsf@bsb.me.uk> |
| In reply to | #171294 |
Khong Dong <khongdongphong@gmail.com> writes: > On Monday, 29 January 2018 05:03:14 UTC-7, Ben Bacarisse wrote: >> Khong Dong <khongdongphong@gmail.com> writes: >> <snip> >> > I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can >> > always go back to them at ease. >> >> Or you could send him the proof that now benefits from 6-8 years of >> refinement. Isn't it that a better place to start? > > Mind your own business. This is a public group. What you choose to post becomes my business if I choose to make it such. The fact that after 6-8 years of refinement you appear not to have a well-written argument to which you can refer curious posters is significant and worth pointing out. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-30 18:40 -0800 |
| Message-ID | <9114c110-6939-49f6-96b8-d1a611033242@googlegroups.com> |
| In reply to | #171367 |
On Tuesday, 30 January 2018 09:26:15 UTC-7, Ben Bacarisse wrote: > Khong Dong <khongdongphong@gmail.com> writes: > > > On Monday, 29 January 2018 05:03:14 UTC-7, Ben Bacarisse wrote: > >> Khong Dong <khongdongphong@gmail.com> writes: > >> <snip> > >> > I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can > >> > always go back to them at ease. > >> > >> Or you could send him the proof that now benefits from 6-8 years of > >> refinement. Isn't it that a better place to start? > > > > Mind your own business. > > This is a public group. What you choose to post becomes my business if > I choose to make it such. The fact that after 6-8 years of refinement > you appear not to have a well-written argument to which you can refer > curious posters is significant and worth pointing out. "Not to have a well-written argument" "after 6-8 years"? That's sounds like a lie, Ben. Remember the MSE arguments I posted here? You were unable to know I wasn't referring to Roman numerals when I talked about "numerals" in the context of language structure for L(PA) and that had nothing to do with my well-written arguments there: it had something to do with your apparent inability to understand the underlying context. Don't you have anything else to contribute beside making character assassination on your opponent? Remember years ago at the start of your presence in my posting, you accused (or alluded to your accusation) that I was a narcissist? Why don't you stop your continuing flame-war before it goes out of control.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-31 04:16 +0000 |
| Message-ID | <87bmhad5o3.fsf@bsb.me.uk> |
| In reply to | #171412 |
Khong Dong <khongdongphong@gmail.com> writes: > On Tuesday, 30 January 2018 09:26:15 UTC-7, Ben Bacarisse wrote: >> Khong Dong <khongdongphong@gmail.com> writes: >> >> > On Monday, 29 January 2018 05:03:14 UTC-7, Ben Bacarisse wrote: >> >> Khong Dong <khongdongphong@gmail.com> writes: >> >> <snip> >> >> > I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can >> >> > always go back to them at ease. >> >> >> >> Or you could send him the proof that now benefits from 6-8 years of >> >> refinement. Isn't it that a better place to start? >> > >> > Mind your own business. >> >> This is a public group. What you choose to post becomes my business if >> I choose to make it such. The fact that after 6-8 years of refinement >> you appear not to have a well-written argument to which you can refer >> curious posters is significant and worth pointing out. > > "Not to have a well-written argument" "after 6-8 years"? That's sounds like > a lie, Ben. Nice misquoting! You either don't have this well-written argument or you do and are keeping it from everyone. The end effect is the same. People starting out talking to you should know that. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-30 20:29 -0800 |
| Message-ID | <a3e2b0a5-3f99-403d-a588-22738b4889c2@googlegroups.com> |
| In reply to | #171445 |
On Tuesday, 30 January 2018 21:16:14 UTC-7, Ben Bacarisse wrote: > Khong Dong <khongdongphong@gmail.com> writes: > > > On Tuesday, 30 January 2018 09:26:15 UTC-7, Ben Bacarisse wrote: > >> Khong Dong <khongdongphong@gmail.com> writes: > >> > >> > On Monday, 29 January 2018 05:03:14 UTC-7, Ben Bacarisse wrote: > >> >> Khong Dong <khongdongphong@gmail.com> writes: > >> >> <snip> > >> >> > I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can > >> >> > always go back to them at ease. > >> >> > >> >> Or you could send him the proof that now benefits from 6-8 years of > >> >> refinement. Isn't it that a better place to start? > >> > > >> > Mind your own business. > >> > >> This is a public group. What you choose to post becomes my business if > >> I choose to make it such. The fact that after 6-8 years of refinement > >> you appear not to have a well-written argument to which you can refer > >> curious posters is significant and worth pointing out. > > > > "Not to have a well-written argument" "after 6-8 years"? That's sounds like > > a lie, Ben. > > Nice misquoting! I quoted what you had written, nice or not! > You either don't have this well-written argument or > you do and are keeping it from everyone. The end effect is the same. > People starting out talking to you should know that. That's an Inquisitional lie, and you should know that.
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-30 20:52 -0800 |
| Message-ID | <5b2522f5-9046-4706-a1c5-78c158ccf9e2@googlegroups.com> |
| In reply to | #171447 |
On Tuesday, 30 January 2018 21:29:13 UTC-7, Khong Dong wrote: > On Tuesday, 30 January 2018 21:16:14 UTC-7, Ben Bacarisse wrote: > > Khong Dong <khongdongphong@gmail.com> writes: > > > > > On Tuesday, 30 January 2018 09:26:15 UTC-7, Ben Bacarisse wrote: > > >> Khong Dong <khongdongphong@gmail.com> writes: > > >> > > >> > On Monday, 29 January 2018 05:03:14 UTC-7, Ben Bacarisse wrote: > > >> >> Khong Dong <khongdongphong@gmail.com> writes: > > >> >> <snip> > > >> >> > I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can > > >> >> > always go back to them at ease. > > >> >> > > >> >> Or you could send him the proof that now benefits from 6-8 years of > > >> >> refinement. Isn't it that a better place to start? > > >> > > > >> > Mind your own business. > > >> > > >> This is a public group. What you choose to post becomes my business if > > >> I choose to make it such. The fact that after 6-8 years of refinement > > >> you appear not to have a well-written argument to which you can refer > > >> curious posters is significant and worth pointing out. > > > > > > "Not to have a well-written argument" "after 6-8 years"? That's sounds like > > > a lie, Ben. > > > > Nice misquoting! > > I quoted what you had written, nice or not! > > > You either don't have this well-written argument or > > you do and are keeping it from everyone. The end effect is the same. > > People starting out talking to you should know that. > > That's an Inquisitional lie, and you should know that. For instance my definitions of algebraic and transcendental theories are very clear cut and people on your side weren't competent enough to have a clue. Ditto for the simple definition of an infinite deductive chain of theorems!
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-30 21:14 -0800 |
| Message-ID | <6020e79f-8dba-4bca-8c9e-969cf15c8ad5@googlegroups.com> |
| In reply to | #171451 |
On Tuesday, 30 January 2018 21:52:35 UTC-7, Khong Dong wrote: > On Tuesday, 30 January 2018 21:29:13 UTC-7, Khong Dong wrote: > > On Tuesday, 30 January 2018 21:16:14 UTC-7, Ben Bacarisse wrote: > > > Khong Dong <khongdongphong@gmail.com> writes: > > > > > > > On Tuesday, 30 January 2018 09:26:15 UTC-7, Ben Bacarisse wrote: > > > >> Khong Dong <khongdongphong@gmail.com> writes: > > > >> > > > >> > On Monday, 29 January 2018 05:03:14 UTC-7, Ben Bacarisse wrote: > > > >> >> Khong Dong <khongdongphong@gmail.com> writes: > > > >> >> <snip> > > > >> >> > I have a suggestion, Zuhair. let's start from R4: R1-R3 are easy and we can > > > >> >> > always go back to them at ease. > > > >> >> > > > >> >> Or you could send him the proof that now benefits from 6-8 years of > > > >> >> refinement. Isn't it that a better place to start? > > > >> > > > > >> > Mind your own business. > > > >> > > > >> This is a public group. What you choose to post becomes my business if > > > >> I choose to make it such. The fact that after 6-8 years of refinement > > > >> you appear not to have a well-written argument to which you can refer > > > >> curious posters is significant and worth pointing out. > > > > > > > > "Not to have a well-written argument" "after 6-8 years"? That's sounds like > > > > a lie, Ben. > > > > > > Nice misquoting! > > > > I quoted what you had written, nice or not! > > > > > You either don't have this well-written argument or > > > you do and are keeping it from everyone. The end effect is the same. > > > People starting out talking to you should know that. > > > > That's an Inquisitional lie, and you should know that. > > For instance my definitions of algebraic and transcendental theories are very > clear cut and people on your side weren't competent enough to have a clue. > > Ditto for the simple definition of an infinite deductive chain of theorems! Besides, gGC is a new formula and Zuhair might have never paid attention to what was going on for the past 8 years so why are you keeping being afraid of me proving something about gGC to him (as he has agreed that I do)?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-31 20:40 +0000 |
| Message-ID | <87zi4tbw38.fsf@bsb.me.uk> |
| In reply to | #171447 |
Khong Dong <khongdongphong@gmail.com> writes: > On Tuesday, 30 January 2018 21:16:14 UTC-7, Ben Bacarisse wrote: <snip> >> You either don't have this well-written argument or >> you do and are keeping it from everyone. The end effect is the same. >> People starting out talking to you should know that. > > That's an Inquisitional lie, and you should know that. Which bit it untrue? I am very happy to be shown to be wrong on this. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2018-01-31 12:08 -0800 |
| Message-ID | <16113ade-e759-4f35-aab0-2dff4ec18784@googlegroups.com> |
| In reply to | #171245 |
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. > ====================> 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? > 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 a road map and let's proceed one step at a time: if we don't succeed in > having a mutual understanding at one particular step we'll not move to the > next one. If you could just let me know which of road map steps above you'd > like for me to begin that would be great. Thanks.
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-01 20:33 -0800 |
| Message-ID | <a115f944-a834-4322-a629-1243adeb0e66@googlegroups.com> |
| In reply to | #171513 |
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.]
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-01 22:02 -0800 |
| Message-ID | <8ccd6cca-3db2-4b40-8a2b-72863f622ecb@googlegroups.com> |
| In reply to | #171691 |
On Thursday, 1 February 2018 21:33:07 UTC-7, 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.]
==========================================================================
Let me make a detour, a break, and say that I wasn't 100% sure why I was
searching what I was searching last night but I came across the story of this
Mathematics Professor Shinichi Mochizuki:
https://www.nature.com/news/the-biggest-mystery-in-mathematics-shinichi-mochizuki-and-the-impenetrable-proof-1.18509
Reading his real life story there's something ... (I'm not quite sure exactly
what) that I think would make me remember his story and work, and achievement,
for a long time. I paused (in the link) above with a little "sad" smile when
reading:
<quote>
The respected mathematician, who works at Kyoto University's Research
Institute for Mathematical Sciences (RIMS) in Japan, did not even announce
his work to peers around the world. He simply posted the papers, and waited
for the world to find out.
</quote>
[He did in the end if I'm not mistaken did publish in a journal but that way
after his silent internet posting.]
Try to read his 4-paper work which you can download:
http://www.nature.com/news/proof-claimed-for-deep-connection-between-primes-1.11378
Anyway his work is way ... over my head but I did download and took a quick
look! You know ... if one complains my meta expression undecide(N |= cGC) <=>
nK(N |= cGC) and nK(N |= ~cGC)) is a meaningless stream of symbols, try to wade
through the professor's 500 page work full of symbols that some think as coming
from a future or even an alien world.
Anyway another thing that caught my attention in the 1st link:
<quote>
Fesenko has studied Mochizuki's work in detail over the past year, visited him
at RIMS again in the autumn of 2014 and says that he has now verified the
proof. (The other three mathematicians who say they have corroborated it have
also spent considerable time working alongside Mochizuki in Japan.)
The overarching theme of inter-universal geometry, as Fesenko describes it,
is that 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.
</quote>
Fwiw, to me the phrase "one must look at whole numbers in a different light —
leaving addition aside and seeing the multiplication structure as something
malleable and deformable" implicitly suggests a sense of relativity in truth
values of some prime-based multiplication expressions, like cGC. I don't know
and I could be wrong but his 500-page work might be hard to understand because
it touches mathematical relativity without mentioning it at all. Who knows ...
We'll see I guess.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2018-02-02 03:24 -0800 |
| Message-ID | <837e2ad9-ffd3-4358-9e98-b7115814f35c@googlegroups.com> |
| In reply to | #171691 |
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
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-02 19:08 -0800 |
| Message-ID | <f9c5688e-fb75-42d6-a295-ba1c5b970d27@googlegroups.com> |
| In reply to | #171706 |
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?
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-02 20:50 -0800 |
| Message-ID | <827eeb8f-71a1-4cc3-a5a6-bb3bcd27d3af@googlegroups.com> |
| In reply to | #171743 |
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.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2018-02-02 20:58 -0800 |
| Message-ID | <1fe87c43-afbe-4c2d-ae03-cafaf7e5314a@googlegroups.com> |
| In reply to | #171750 |
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.
YOU said:.. On "meta-level" the language numerals denoting n.
YOu wrote that in point 4.
what exactly did you mean by that?
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2018-02-02 21:03 -0800 |
| Message-ID | <67c35a76-b310-47eb-b036-ae975e237769@googlegroups.com> |
| In reply to | #171750 |
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.
so what is the formal definition of "language structure"? Can you point me to a website that gives such a definition?
Zuhair
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2018-02-02 21:36 -0800 |
| Message-ID | <9f0bf34f-47b6-4c2a-b268-8dfe471557d6@googlegroups.com> |
| In reply to | #171750 |
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???
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-02 23:49 -0800 |
| Message-ID | <35886947-b8f3-4648-9431-73d6412c0ac1@googlegroups.com> |
| In reply to | #171754 |
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?
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-03 00:07 -0800 |
| Message-ID | <4750f3f4-8d87-4928-a25e-f07459e30862@googlegroups.com> |
| In reply to | #171760 |
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).
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-02-03 00:19 -0800 |
| Message-ID | <296da91c-0472-4805-9ab4-73fc9a7a815a@googlegroups.com> |
| In reply to | #171761 |
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).
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2018-02-03 04:05 -0800 |
| Message-ID | <d78b6a6d-7b08-4d06-93ea-ae114e10825b@googlegroups.com> |
| In reply to | #171762 |
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"
now what does nk mean?
also what is =>? is it equal or greater than or is it the implication symbol, to me it appears to be the latter?
I think also "length(numeral(p))" means the total number of occurrences of the symbol S in numeral(p) [which is the numeral denoting p and not the surrogate of p, Right?].
also what is the "half open interval stipulated by gGC".
Also you didn't explicitly state gGC here in your proof, is it the same in the head post?
Please give examples of all what those symbols stand for, so that I can fathom what you are trying to say.
[toc] | [prev] | [next] | [standalone]
Page 4 of 8 — ← Prev page 1 2 3 [4] 5 6 7 8 Next page →
Back to top | Article view | sci.logic
csiph-web