Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #170051 > unrolled thread
| Started by | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| First post | 2018-01-12 23:15 -0800 |
| Last post | 2018-01-13 19:20 -0800 |
| Articles | 20 on this page of 244 — 6 participants |
Back to article view | Back to sci.logic
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-12 23:15 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-12 23:26 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 00:19 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 01:43 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 09:46 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 10:33 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 10:53 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 12:26 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 12:40 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 19:17 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-13 14:31 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 12:50 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-13 17:42 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 18:15 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 19:26 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-13 20:21 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 18:30 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 19:28 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 20:22 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 20:45 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 21:24 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 21:47 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 22:05 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-13 22:34 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-14 01:33 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 08:51 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-14 09:17 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 09:29 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-14 09:32 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 11:46 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 12:29 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-14 22:20 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 14:56 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-14 23:14 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 15:21 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-14 18:54 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 17:48 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-14 23:31 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 20:56 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-15 00:21 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 21:37 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-15 12:42 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-15 12:45 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-15 06:06 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-15 16:07 +0000
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-15 13:14 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 20:19 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 21:42 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-15 12:33 +0000
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-14 15:32 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 13:54 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 14:01 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-14 18:41 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 20:49 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 21:08 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-14 21:43 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 21:51 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 21:58 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 22:13 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 22:44 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-15 07:50 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-15 19:28 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-15 22:38 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-15 23:12 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-15 23:53 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 00:05 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 00:46 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 07:45 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 09:31 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 10:16 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 11:14 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 11:48 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 12:19 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 12:22 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 12:52 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 13:13 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 13:27 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 13:40 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 13:39 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 13:55 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 14:33 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 14:38 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 15:05 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 17:07 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 19:00 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 20:42 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 21:27 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-17 12:02 -0500
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 21:49 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 23:14 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 00:36 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 07:51 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 08:01 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 08:56 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 09:15 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 10:23 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 10:37 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 10:54 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 11:16 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 16:31 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 19:37 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 20:36 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 21:33 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 21:50 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 22:00 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 12:36 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 07:33 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-17 22:35 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 22:48 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-18 00:16 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 07:40 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-18 07:55 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 08:59 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 18:00 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 10:10 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 18:23 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 10:39 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 20:22 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 21:44 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 10:59 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-18 12:14 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 14:05 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 20:46 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 14:36 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 07:40 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 17:06 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 14:07 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 16:08 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 00:07 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-18 18:34 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 19:34 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-18 23:16 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 20:34 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-19 12:28 -0500
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 00:09 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 08:38 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 10:28 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 18:38 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 11:09 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 14:08 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 14:05 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 15:40 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 19:50 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 20:31 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 20:37 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 20:48 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 20:52 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 21:06 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 21:17 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 21:37 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 22:13 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 22:28 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 21:36 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 22:11 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-19 22:27 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 23:14 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 23:32 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 20:49 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 21:00 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 15:12 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 07:41 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-19 11:57 -0500
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 18:38 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-17 18:54 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 16:35 +0000
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 14:34 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 12:25 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-16 20:32 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-16 20:11 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 08:50 +0000
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 12:17 -0800
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-16 12:16 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-16 09:05 +0000
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-15 10:31 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-15 07:45 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-15 10:57 -0500
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-15 10:48 -0500
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-18 18:46 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 19:27 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-18 23:08 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-18 23:02 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-19 19:05 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 16:38 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-19 20:03 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-19 20:44 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 13:44 +0000
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-20 19:20 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 16:37 -0800
Re: Some questions on a possible (FOL) transcendental theory. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-21 01:26 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 18:16 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 22:46 -0800
Re: Some questions on a possible (FOL) transcendental theory. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-21 12:56 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-21 07:31 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-21 07:46 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-21 08:18 -0800
Re: Some questions on a possible (FOL) transcendental theory. Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-22 02:06 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-21 20:15 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 18:52 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 19:33 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 15:10 +0000
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 08:19 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 16:06 -0800
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 16:23 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 19:25 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 18:19 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 21:40 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 19:48 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 22:31 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 21:08 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-21 09:07 -0600
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-21 15:13 +0000
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 19:24 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 18:32 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 21:45 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 19:52 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-20 22:32 -0600
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 21:12 -0800
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-21 09:02 -0600
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-21 14:57 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-21 18:18 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-21 11:30 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-22 13:27 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-22 07:41 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-22 11:50 -0500
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-23 19:36 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-22 17:06 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-23 19:31 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 18:47 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-24 21:13 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 00:53 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-02-09 16:31 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-02-09 09:12 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-02-09 17:34 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-02-09 16:25 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-02-09 16:30 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-02-09 09:15 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-02-09 17:27 +0000
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 16:53 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-20 15:41 -0800
Re: Some questions on a possible (FOL) transcendental theory. Peter Percival <peterxpercival@hotmail.com> - 2018-01-14 17:08 +0000
Re: Some questions on a possible (FOL) transcendental theory. Khong Dong <khongdongphong@gmail.com> - 2018-01-14 09:41 -0800
Re: Some questions on a possible (FOL) transcendental theory. Jim Burns <james.g.burns@att.net> - 2018-01-14 14:33 -0500
Re: Some questions on a possible (FOL) transcendental theory. "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-14 16:17 -0600
Re: Some questions on a possible (FOL) transcendental theory. Rupert <rupertmccallum@yahoo.com> - 2018-01-13 19:20 -0800
Page 11 of 13 — ← Prev page 1 … 9 10 [11] 12 13 Next page →
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 08:19 -0600 |
| Message-ID | <p3vj6i$t44$1@dont-email.me> |
| In reply to | #170464 |
On 1/18/2018 9:27 PM, Khong Dong wrote:
> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
>> On 1/14/2018 10:49 PM, Khong Dong wrote:
>>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
>>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
>>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
>>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
>>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
>>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
>>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
>>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
>>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
>>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
>>>>>>>>>>>>>>> denied the trivial fact that such examples are possible. So your example was
>>>>>>>>>>>>>>> not a counter-example to anything I said.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>
>>>>>>>>>>>>> I don't see it as a counter-example because it isn't one.
>>>>>>>>>>>>>
>>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
>>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
>>>>>>>>>>>>>> (for lack of better grouping names).
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ======> Group Hypotheses (GH)
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
>>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
>>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
>>>>>>>>>>>>>> subset of the deductive closure of A."
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
>>>>>>>>>>>>>> a subset of B and B is a subset of T."
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ======> Group Inference (GI)
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
>>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
>>>>>>>>>>>>>> That was my claim, and it was correct."
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
>>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ======> Group Conclusion (GC)
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
>>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> ***************************
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
>>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
>>>>>>>>>>>>>
>>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
>>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
>>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
>>>>>>>>>>>>> A must be either A or T.
>>>>>>>>>>>>
>>>>>>>>>>>> So, can A<S or S<T or both be true?
>>>>>>>>>>>
>>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
>>>>>>>>>>>
>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
>>>>>>>>>>
>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
>>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
>>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
>>>>>>>>>> case?
>>>>>>>>>
>>>>>>>>> I don't see any reason to revise anything I've already said.
>>>>>>>>
>>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
>>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
>>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
>>>>>>>
>>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
>>>>>>>
>>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
>>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
>>>>>>>
>>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
>>>>>>
>>>>>> You must show it has an _AXIOM_ set which you have failed to show.
>>>>>
>>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
>>>>
>>>> Let me put it in simple English first and see if we have to be more technical.
>>>>
>>>> You need to show in T there's no infinite deduction chain - infinite to the left!
>>>>
>>>> If you stil don't, I'll go more technical.
>>>
>>> Assuming A0 is a non-logical theorem in T in all of the below.
>>>
>>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
>>> equivalence or syntactical elimination/replacement, you'd have the following
>>> deduction sequence - deduction chain - (*) from left to right:
>>>
>>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
>>>
>>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
>>>
>>> In a _transcendental_ T, given the theorem A0, and up to formula logical
>>> equivalence or syntactical elimination/replacement, you'd have the following
>>> deduction sequence - deduction chain - (*') from left to right:
>>>
>>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
>>> A0,
>>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
>>>
>>> Of course (*') is infinite to the right, and to the left. And in (*') there's
>>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
>>>
>>> In either one of (*) and(*'), any two formulas of different positions have to
>>> be deductively different: they aren't logically equivalent.
>>
>> I believe we can add "logically equivalent" to the list of terms you use
>> without a clue as to what it means.
>
> Idiotic ranting of the liar Martin Shobe, as usual.
>
>> In your example of a deductive chain
>> that is infinite to the right, all the formulas are logically equivalent.
>
> At least you seem to be more knowledgeable than Rupert in that you know what
> what an infinite deduction chain is while he doesn't.
>
>>
>> That can be fixed by using disjunction and adding a new formula instead
>> of conjunction with the same one.
>
> You don't have any clue in what you're arguing about. The reason why (*) is
> simple is because at your side of people (Peter, Jim, Rupert) didn't seem
> to know what an infinite deduction chain is so I had to cooked up a
> "kindergarten" example to help them understand.
>
> Anyway, so now you understand (*') is also an infinite deduction chain, right?
According to the definition you've given, it's not. A0 is logically
equivalent to A0 & A0. Since your definition requires that they are not
logically equivalent, (*') is not an infinite deduction chain.
> If you do, perhaps you could help explaining that to Rupert, for I think he
> still has problem in understanding what an infinite deduction chain of theorems
> be.
I think it's you who is having the problem here.
>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
>>> have the chain (*'), then that could be taken as proving there's no
>>> transcendental theory. So far you haven't proved it yet.
>>>
>>> On a hunch, I don't think it's possible to prove that. But you could prove me
>>> wrong: that's what Question 1 is for.
>>>
>>
>> Given this, it's rather obvious that there are infinite chains both ways
>> regardless of the theory.
>
> So wise guy, why don't you use your knowledge about infinite deductive chain
> of theorems to find out which consistent theory would have my (***) below
> (which I defined previously) as infinite deductive chain of theorems:
>
> (***):
>
> ....
> There are n+1 counter examples of Goldbach Conjecture,
> There are n counter examples of Goldbach Conjecture,
> ....
> There are 3 counter examples of Goldbach Conjecture,
> There are 2 counter examples of Goldbach Conjecture,
> There are 1 counter examples of Goldbach Conjecture,
> ~(Goldbach Conjecture),
> ~(Goldbach Conjecture) \/ 0=0,
> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
> ....
>
> Well, Martin, what's an example of a consistent theory T having (***) as
> an infinite deductive chain of theorem?
>
It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
theory, consistent or not, has it as an infinite deductive chain.
If we drop the not logically equivalent requirement, any consistent
theory that is capable of expressing the above statements would do. E.g. PA.
Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 16:06 -0800 |
| Message-ID | <1a5fa19c-c054-4198-9099-dd7d69a1bcf6@googlegroups.com> |
| In reply to | #170608 |
On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
> On 1/18/2018 9:27 PM, Khong Dong wrote:
> > On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
> >> On 1/14/2018 10:49 PM, Khong Dong wrote:
> >>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
> >>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
> >>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
> >>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
> >>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
> >>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
> >>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
> >>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
> >>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
> >>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
> >>>>>>>>>>>>>>> denied the trivial fact that such examples are possible. So your example was
> >>>>>>>>>>>>>>> not a counter-example to anything I said.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
> >>>>>>>>>>>>>> invalid.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> I don't see it as a counter-example because it isn't one.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
> >>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
> >>>>>>>>>>>>>> (for lack of better grouping names).
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> ======> Group Hypotheses (GH)
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
> >>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
> >>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
> >>>>>>>>>>>>>> subset of the deductive closure of A."
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
> >>>>>>>>>>>>>> a subset of B and B is a subset of T."
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> ======> Group Inference (GI)
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
> >>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
> >>>>>>>>>>>>>> That was my claim, and it was correct."
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
> >>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> ======> Group Conclusion (GC)
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
> >>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> ***************************
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
> >>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
> >>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
> >>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
> >>>>>>>>>>>>> A must be either A or T.
> >>>>>>>>>>>>
> >>>>>>>>>>>> So, can A<S or S<T or both be true?
> >>>>>>>>>>>
> >>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
> >>>>>>>>>>>
> >>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
> >>>>>>>>>>
> >>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
> >>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
> >>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
> >>>>>>>>>> case?
> >>>>>>>>>
> >>>>>>>>> I don't see any reason to revise anything I've already said.
> >>>>>>>>
> >>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
> >>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
> >>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
> >>>>>>>
> >>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
> >>>>>>>
> >>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
> >>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
> >>>>>>>
> >>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
> >>>>>>
> >>>>>> You must show it has an _AXIOM_ set which you have failed to show.
> >>>>>
> >>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
> >>>>
> >>>> Let me put it in simple English first and see if we have to be more technical.
> >>>>
> >>>> You need to show in T there's no infinite deduction chain - infinite to the left!
> >>>>
> >>>> If you stil don't, I'll go more technical.
> >>>
> >>> Assuming A0 is a non-logical theorem in T in all of the below.
> >>>
> >>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
> >>> equivalence or syntactical elimination/replacement, you'd have the following
> >>> deduction sequence - deduction chain - (*) from left to right:
> >>>
> >>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
> >>>
> >>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
> >>>
> >>> In a _transcendental_ T, given the theorem A0, and up to formula logical
> >>> equivalence or syntactical elimination/replacement, you'd have the following
> >>> deduction sequence - deduction chain - (*') from left to right:
> >>>
> >>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
> >>> A0,
> >>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
> >>>
> >>> Of course (*') is infinite to the right, and to the left. And in (*') there's
> >>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
> >>>
> >>> In either one of (*) and(*'), any two formulas of different positions have to
> >>> be deductively different: they aren't logically equivalent.
> >>
> >> I believe we can add "logically equivalent" to the list of terms you use
> >> without a clue as to what it means.
> >
> > Idiotic ranting of the liar Martin Shobe, as usual.
> >
> >> In your example of a deductive chain
> >> that is infinite to the right, all the formulas are logically equivalent.
> >
> > At least you seem to be more knowledgeable than Rupert in that you know what
> > what an infinite deduction chain is while he doesn't.
> >
> >>
> >> That can be fixed by using disjunction and adding a new formula instead
> >> of conjunction with the same one.
> >
> > You don't have any clue in what you're arguing about. The reason why (*) is
> > simple is because at your side of people (Peter, Jim, Rupert) didn't seem
> > to know what an infinite deduction chain is so I had to cooked up a
> > "kindergarten" example to help them understand.
> >
> > Anyway, so now you understand (*') is also an infinite deduction chain, right?
>
> According to the definition you've given, it's not. A0 is logically
> equivalent to A0 & A0. Since your definition requires that they are not
> logically equivalent, (*') is not an infinite deduction chain.
>
> > If you do, perhaps you could help explaining that to Rupert, for I think he
> > still has problem in understanding what an infinite deduction chain of theorems
> > be.
>
> I think it's you who is having the problem here.
>
> >>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
> >>> have the chain (*'), then that could be taken as proving there's no
> >>> transcendental theory. So far you haven't proved it yet.
> >>>
> >>> On a hunch, I don't think it's possible to prove that. But you could prove me
> >>> wrong: that's what Question 1 is for.
> >>>
> >>
> >> Given this, it's rather obvious that there are infinite chains both ways
> >> regardless of the theory.
> >
> > So wise guy, why don't you use your knowledge about infinite deductive chain
> > of theorems to find out which consistent theory would have my (***) below
> > (which I defined previously) as infinite deductive chain of theorems:
> >
> > (***):
> >
> > ....
> > There are n+1 counter examples of Goldbach Conjecture,
> > There are n counter examples of Goldbach Conjecture,
> > ....
> > There are 3 counter examples of Goldbach Conjecture,
> > There are 2 counter examples of Goldbach Conjecture,
> > There are 1 counter examples of Goldbach Conjecture,
> > ~(Goldbach Conjecture),
> > ~(Goldbach Conjecture) \/ 0=0,
> > ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
> > ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
> > ....
> >
> > Well, Martin, what's an example of a consistent theory T having (***) as
> > an infinite deductive chain of theorem?
> >
>
> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
> theory, consistent or not, has it as an infinite deductive chain.
Obviously you lack the competency to correctly answer the question. It doesn'nt
matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
(~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
segment of the infinite deductive chain of theorems we've denoted by (***).
> If we drop the not logically equivalent requirement, any consistent
> theory that is capable of expressing the above statements would do. E.g. PA.
You're using the phrase "logically equivalent" as a buzzword without realizing
what it would or would _NOT_ do for your failed arguments.
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 16:23 -0800 |
| Message-ID | <2e769579-79c7-412f-bb2e-7153359c0f51@googlegroups.com> |
| In reply to | #170647 |
On Saturday, 20 January 2018 17:06:19 UTC-7, Khong Dong wrote:
> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
> > On 1/18/2018 9:27 PM, Khong Dong wrote:
> > > On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
> > >> On 1/14/2018 10:49 PM, Khong Dong wrote:
> > >>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
> > >>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
> > >>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
> > >>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
> > >>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
> > >>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
> > >>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
> > >>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
> > >>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
> > >>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
> > >>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
> > >>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
> > >>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
> > >>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
> > >>>>>>>>>>>>>>> denied the trivial fact that such examples are possible. So your example was
> > >>>>>>>>>>>>>>> not a counter-example to anything I said.
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
> > >>>>>>>>>>>>>> invalid.
> > >>>>>>>>>>>>>
> > >>>>>>>>>>>>> I don't see it as a counter-example because it isn't one.
> > >>>>>>>>>>>>>
> > >>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
> > >>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
> > >>>>>>>>>>>>>> (for lack of better grouping names).
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> ======> Group Hypotheses (GH)
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
> > >>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
> > >>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
> > >>>>>>>>>>>>>> subset of the deductive closure of A."
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
> > >>>>>>>>>>>>>> a subset of B and B is a subset of T."
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> ======> Group Inference (GI)
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
> > >>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
> > >>>>>>>>>>>>>> That was my claim, and it was correct."
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
> > >>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> ======> Group Conclusion (GC)
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
> > >>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> ***************************
> > >>>>>>>>>>>>>>
> > >>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
> > >>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
> > >>>>>>>>>>>>>
> > >>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
> > >>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
> > >>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
> > >>>>>>>>>>>>> A must be either A or T.
> > >>>>>>>>>>>>
> > >>>>>>>>>>>> So, can A<S or S<T or both be true?
> > >>>>>>>>>>>
> > >>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
> > >>>>>>>>>>>
> > >>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
> > >>>>>>>>>>
> > >>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
> > >>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
> > >>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
> > >>>>>>>>>> case?
> > >>>>>>>>>
> > >>>>>>>>> I don't see any reason to revise anything I've already said.
> > >>>>>>>>
> > >>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
> > >>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
> > >>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
> > >>>>>>>
> > >>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
> > >>>>>>>
> > >>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
> > >>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
> > >>>>>>>
> > >>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
> > >>>>>>
> > >>>>>> You must show it has an _AXIOM_ set which you have failed to show.
> > >>>>>
> > >>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
> > >>>>
> > >>>> Let me put it in simple English first and see if we have to be more technical.
> > >>>>
> > >>>> You need to show in T there's no infinite deduction chain - infinite to the left!
> > >>>>
> > >>>> If you stil don't, I'll go more technical.
> > >>>
> > >>> Assuming A0 is a non-logical theorem in T in all of the below.
> > >>>
> > >>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
> > >>> equivalence or syntactical elimination/replacement, you'd have the following
> > >>> deduction sequence - deduction chain - (*) from left to right:
> > >>>
> > >>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
> > >>>
> > >>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
> > >>>
> > >>> In a _transcendental_ T, given the theorem A0, and up to formula logical
> > >>> equivalence or syntactical elimination/replacement, you'd have the following
> > >>> deduction sequence - deduction chain - (*') from left to right:
> > >>>
> > >>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
> > >>> A0,
> > >>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
> > >>>
> > >>> Of course (*') is infinite to the right, and to the left. And in (*') there's
> > >>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
> > >>>
> > >>> In either one of (*) and(*'), any two formulas of different positions have to
> > >>> be deductively different: they aren't logically equivalent.
> > >>
> > >> I believe we can add "logically equivalent" to the list of terms you use
> > >> without a clue as to what it means.
> > >
> > > Idiotic ranting of the liar Martin Shobe, as usual.
> > >
> > >> In your example of a deductive chain
> > >> that is infinite to the right, all the formulas are logically equivalent.
> > >
> > > At least you seem to be more knowledgeable than Rupert in that you know what
> > > what an infinite deduction chain is while he doesn't.
> > >
> > >>
> > >> That can be fixed by using disjunction and adding a new formula instead
> > >> of conjunction with the same one.
> > >
> > > You don't have any clue in what you're arguing about. The reason why (*) is
> > > simple is because at your side of people (Peter, Jim, Rupert) didn't seem
> > > to know what an infinite deduction chain is so I had to cooked up a
> > > "kindergarten" example to help them understand.
> > >
> > > Anyway, so now you understand (*') is also an infinite deduction chain, right?
> >
> > According to the definition you've given, it's not. A0 is logically
> > equivalent to A0 & A0. Since your definition requires that they are not
> > logically equivalent, (*') is not an infinite deduction chain.
> >
> > > If you do, perhaps you could help explaining that to Rupert, for I think he
> > > still has problem in understanding what an infinite deduction chain of theorems
> > > be.
> >
> > I think it's you who is having the problem here.
> >
> > >>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
> > >>> have the chain (*'), then that could be taken as proving there's no
> > >>> transcendental theory. So far you haven't proved it yet.
> > >>>
> > >>> On a hunch, I don't think it's possible to prove that. But you could prove me
> > >>> wrong: that's what Question 1 is for.
> > >>>
> > >>
> > >> Given this, it's rather obvious that there are infinite chains both ways
> > >> regardless of the theory.
> > >
> > > So wise guy, why don't you use your knowledge about infinite deductive chain
> > > of theorems to find out which consistent theory would have my (***) below
> > > (which I defined previously) as infinite deductive chain of theorems:
> > >
> > > (***):
> > >
> > > ....
> > > There are n+1 counter examples of Goldbach Conjecture,
> > > There are n counter examples of Goldbach Conjecture,
> > > ....
> > > There are 3 counter examples of Goldbach Conjecture,
> > > There are 2 counter examples of Goldbach Conjecture,
> > > There are 1 counter examples of Goldbach Conjecture,
> > > ~(Goldbach Conjecture),
> > > ~(Goldbach Conjecture) \/ 0=0,
> > > ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
> > > ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
> > > ....
> > >
> > > Well, Martin, what's an example of a consistent theory T having (***) as
> > > an infinite deductive chain of theorem?
> > >
> >
> > It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
> > logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
> > theory, consistent or not, has it as an infinite deductive chain.
>
> Obviously you lack the competency to correctly answer the question. It doesn'nt
> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
> segment of the infinite deductive chain of theorems we've denoted by (***).
Btw, Martin, an inconsistent T of the language will have (***) as an infinite
deductive chain, last time one can check.
> > If we drop the not logically equivalent requirement, any consistent
> > theory that is capable of expressing the above statements would do. E.g. PA.
>
> You're using the phrase "logically equivalent" as a buzzword without realizing
> what it would or would _NOT_ do for your failed arguments.
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 19:25 -0600 |
| Message-ID | <p40q6l$fn$2@dont-email.me> |
| In reply to | #170650 |
On 1/20/2018 6:23 PM, Khong Dong wrote:
> On Saturday, 20 January 2018 17:06:19 UTC-7, Khong Dong wrote:
>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
>>> On 1/18/2018 9:27 PM, Khong Dong wrote:
>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote:
>>>>>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
>>>>>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
>>>>>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
>>>>>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
>>>>>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
>>>>>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
>>>>>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
>>>>>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
>>>>>>>>>>>>>>>>>> denied the trivial fact that such examples are possible.. So your example was
>>>>>>>>>>>>>>>>>> not a counter-example to anything I said.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> I don't see it as a counter-example because it isn't one.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
>>>>>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
>>>>>>>>>>>>>>>>> (for lack of better grouping names).
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> ======> Group Hypotheses (GH)
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
>>>>>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
>>>>>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
>>>>>>>>>>>>>>>>> subset of the deductive closure of A."
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
>>>>>>>>>>>>>>>>> a subset of B and B is a subset of T."
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> ======> Group Inference (GI)
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
>>>>>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
>>>>>>>>>>>>>>>>> That was my claim, and it was correct."
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
>>>>>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> ======> Group Conclusion (GC)
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
>>>>>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> ***************************
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
>>>>>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
>>>>>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
>>>>>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
>>>>>>>>>>>>>>>> A must be either A or T.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> So, can A<S or S<T or both be true?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
>>>>>>>>>>>>>
>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
>>>>>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
>>>>>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
>>>>>>>>>>>>> case?
>>>>>>>>>>>>
>>>>>>>>>>>> I don't see any reason to revise anything I've already said.
>>>>>>>>>>>
>>>>>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
>>>>>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
>>>>>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
>>>>>>>>>>
>>>>>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
>>>>>>>>>>
>>>>>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
>>>>>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
>>>>>>>>>>
>>>>>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
>>>>>>>>>
>>>>>>>>> You must show it has an _AXIOM_ set which you have failed to show.
>>>>>>>>
>>>>>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
>>>>>>>
>>>>>>> Let me put it in simple English first and see if we have to be more technical.
>>>>>>>
>>>>>>> You need to show in T there's no infinite deduction chain - infinite to the left!
>>>>>>>
>>>>>>> If you stil don't, I'll go more technical.
>>>>>>
>>>>>> Assuming A0 is a non-logical theorem in T in all of the below.
>>>>>>
>>>>>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
>>>>>> deduction sequence - deduction chain - (*) from left to right:
>>>>>>
>>>>>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
>>>>>>
>>>>>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
>>>>>>
>>>>>> In a _transcendental_ T, given the theorem A0, and up to formula logical
>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
>>>>>> deduction sequence - deduction chain - (*') from left to right:
>>>>>>
>>>>>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
>>>>>> A0,
>>>>>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
>>>>>>
>>>>>> Of course (*') is infinite to the right, and to the left. And in (*') there's
>>>>>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
>>>>>>
>>>>>> In either one of (*) and(*'), any two formulas of different positions have to
>>>>>> be deductively different: they aren't logically equivalent.
>>>>>
>>>>> I believe we can add "logically equivalent" to the list of terms you use
>>>>> without a clue as to what it means.
>>>>
>>>> Idiotic ranting of the liar Martin Shobe, as usual.
>>>>
>>>>> In your example of a deductive chain
>>>>> that is infinite to the right, all the formulas are logically equivalent.
>>>>
>>>> At least you seem to be more knowledgeable than Rupert in that you know what
>>>> what an infinite deduction chain is while he doesn't.
>>>>
>>>>>
>>>>> That can be fixed by using disjunction and adding a new formula instead
>>>>> of conjunction with the same one.
>>>>
>>>> You don't have any clue in what you're arguing about. The reason why (*) is
>>>> simple is because at your side of people (Peter, Jim, Rupert) didn't seem
>>>> to know what an infinite deduction chain is so I had to cooked up a
>>>> "kindergarten" example to help them understand.
>>>>
>>>> Anyway, so now you understand (*') is also an infinite deduction chain, right?
>>>
>>> According to the definition you've given, it's not. A0 is logically
>>> equivalent to A0 & A0. Since your definition requires that they are not
>>> logically equivalent, (*') is not an infinite deduction chain.
>>>
>>>> If you do, perhaps you could help explaining that to Rupert, for I think he
>>>> still has problem in understanding what an infinite deduction chain of theorems
>>>> be.
>>>
>>> I think it's you who is having the problem here.
>>>
>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
>>>>>> have the chain (*'), then that could be taken as proving there's no
>>>>>> transcendental theory. So far you haven't proved it yet.
>>>>>>
>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me
>>>>>> wrong: that's what Question 1 is for.
>>>>>>
>>>>>
>>>>> Given this, it's rather obvious that there are infinite chains both ways
>>>>> regardless of the theory.
>>>>
>>>> So wise guy, why don't you use your knowledge about infinite deductive chain
>>>> of theorems to find out which consistent theory would have my (***) below
>>>> (which I defined previously) as infinite deductive chain of theorems:
>>>>
>>>> (***):
>>>>
>>>> ....
>>>> There are n+1 counter examples of Goldbach Conjecture,
>>>> There are n counter examples of Goldbach Conjecture,
>>>> ....
>>>> There are 3 counter examples of Goldbach Conjecture,
>>>> There are 2 counter examples of Goldbach Conjecture,
>>>> There are 1 counter examples of Goldbach Conjecture,
>>>> ~(Goldbach Conjecture),
>>>> ~(Goldbach Conjecture) \/ 0=0,
>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
>>>> ....
>>>>
>>>> Well, Martin, what's an example of a consistent theory T having (***) as
>>>> an infinite deductive chain of theorem?
>>>>
>>>
>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
>>> theory, consistent or not, has it as an infinite deductive chain.
>>
>> Obviously you lack the competency to correctly answer the question. It doesn'nt
>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
>> segment of the infinite deductive chain of theorems we've denoted by (***).
>
> Btw, Martin, an inconsistent T of the language will have (***) as an infinite
> deductive chain, last time one can check.
Yes. And so will a consistent one.
Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 18:19 -0800 |
| Message-ID | <4a859a79-c864-49d7-9485-5ca86b6f12e8@googlegroups.com> |
| In reply to | #170654 |
On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote:
> On 1/20/2018 6:23 PM, Khong Dong wrote:
> > On Saturday, 20 January 2018 17:06:19 UTC-7, Khong Dong wrote:
> >> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
> >>> On 1/18/2018 9:27 PM, Khong Dong wrote:
> >>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
> >>>>> On 1/14/2018 10:49 PM, Khong Dong wrote:
> >>>>>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
> >>>>>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
> >>>>>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
> >>>>>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
> >>>>>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
> >>>>>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
> >>>>>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
> >>>>>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
> >>>>>>>>>>>>>>>>>> denied the trivial fact that such examples are possible.. So your example was
> >>>>>>>>>>>>>>>>>> not a counter-example to anything I said.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
> >>>>>>>>>>>>>>>>> invalid.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> I don't see it as a counter-example because it isn't one.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
> >>>>>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
> >>>>>>>>>>>>>>>>> (for lack of better grouping names).
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> ======> Group Hypotheses (GH)
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
> >>>>>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
> >>>>>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
> >>>>>>>>>>>>>>>>> subset of the deductive closure of A."
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
> >>>>>>>>>>>>>>>>> a subset of B and B is a subset of T."
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> ======> Group Inference (GI)
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
> >>>>>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
> >>>>>>>>>>>>>>>>> That was my claim, and it was correct."
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
> >>>>>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> ======> Group Conclusion (GC)
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
> >>>>>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> ***************************
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
> >>>>>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
> >>>>>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
> >>>>>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
> >>>>>>>>>>>>>>>> A must be either A or T.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> So, can A<S or S<T or both be true?
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
> >>>>>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
> >>>>>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
> >>>>>>>>>>>>> case?
> >>>>>>>>>>>>
> >>>>>>>>>>>> I don't see any reason to revise anything I've already said.
> >>>>>>>>>>>
> >>>>>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
> >>>>>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
> >>>>>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
> >>>>>>>>>>
> >>>>>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
> >>>>>>>>>>
> >>>>>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
> >>>>>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
> >>>>>>>>>>
> >>>>>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
> >>>>>>>>>
> >>>>>>>>> You must show it has an _AXIOM_ set which you have failed to show.
> >>>>>>>>
> >>>>>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
> >>>>>>>
> >>>>>>> Let me put it in simple English first and see if we have to be more technical.
> >>>>>>>
> >>>>>>> You need to show in T there's no infinite deduction chain - infinite to the left!
> >>>>>>>
> >>>>>>> If you stil don't, I'll go more technical.
> >>>>>>
> >>>>>> Assuming A0 is a non-logical theorem in T in all of the below.
> >>>>>>
> >>>>>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
> >>>>>> equivalence or syntactical elimination/replacement, you'd have the following
> >>>>>> deduction sequence - deduction chain - (*) from left to right:
> >>>>>>
> >>>>>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
> >>>>>>
> >>>>>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
> >>>>>>
> >>>>>> In a _transcendental_ T, given the theorem A0, and up to formula logical
> >>>>>> equivalence or syntactical elimination/replacement, you'd have the following
> >>>>>> deduction sequence - deduction chain - (*') from left to right:
> >>>>>>
> >>>>>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
> >>>>>> A0,
> >>>>>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
> >>>>>>
> >>>>>> Of course (*') is infinite to the right, and to the left. And in (*') there's
> >>>>>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
> >>>>>>
> >>>>>> In either one of (*) and(*'), any two formulas of different positions have to
> >>>>>> be deductively different: they aren't logically equivalent.
> >>>>>
> >>>>> I believe we can add "logically equivalent" to the list of terms you use
> >>>>> without a clue as to what it means.
> >>>>
> >>>> Idiotic ranting of the liar Martin Shobe, as usual.
> >>>>
> >>>>> In your example of a deductive chain
> >>>>> that is infinite to the right, all the formulas are logically equivalent.
> >>>>
> >>>> At least you seem to be more knowledgeable than Rupert in that you know what
> >>>> what an infinite deduction chain is while he doesn't.
> >>>>
> >>>>>
> >>>>> That can be fixed by using disjunction and adding a new formula instead
> >>>>> of conjunction with the same one.
> >>>>
> >>>> You don't have any clue in what you're arguing about. The reason why (*) is
> >>>> simple is because at your side of people (Peter, Jim, Rupert) didn't seem
> >>>> to know what an infinite deduction chain is so I had to cooked up a
> >>>> "kindergarten" example to help them understand.
> >>>>
> >>>> Anyway, so now you understand (*') is also an infinite deduction chain, right?
> >>>
> >>> According to the definition you've given, it's not. A0 is logically
> >>> equivalent to A0 & A0. Since your definition requires that they are not
> >>> logically equivalent, (*') is not an infinite deduction chain.
> >>>
> >>>> If you do, perhaps you could help explaining that to Rupert, for I think he
> >>>> still has problem in understanding what an infinite deduction chain of theorems
> >>>> be.
> >>>
> >>> I think it's you who is having the problem here.
> >>>
> >>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
> >>>>>> have the chain (*'), then that could be taken as proving there's no
> >>>>>> transcendental theory. So far you haven't proved it yet.
> >>>>>>
> >>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me
> >>>>>> wrong: that's what Question 1 is for.
> >>>>>>
> >>>>>
> >>>>> Given this, it's rather obvious that there are infinite chains both ways
> >>>>> regardless of the theory.
> >>>>
> >>>> So wise guy, why don't you use your knowledge about infinite deductive chain
> >>>> of theorems to find out which consistent theory would have my (***) below
> >>>> (which I defined previously) as infinite deductive chain of theorems:
> >>>>
> >>>> (***):
> >>>>
> >>>> ....
> >>>> There are n+1 counter examples of Goldbach Conjecture,
> >>>> There are n counter examples of Goldbach Conjecture,
> >>>> ....
> >>>> There are 3 counter examples of Goldbach Conjecture,
> >>>> There are 2 counter examples of Goldbach Conjecture,
> >>>> There are 1 counter examples of Goldbach Conjecture,
> >>>> ~(Goldbach Conjecture),
> >>>> ~(Goldbach Conjecture) \/ 0=0,
> >>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
> >>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
> >>>> ....
> >>>>
> >>>> Well, Martin, what's an example of a consistent theory T having (***) as
> >>>> an infinite deductive chain of theorem?
> >>>>
> >>>
> >>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
> >>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
> >>> theory, consistent or not, has it as an infinite deductive chain.
> >>
> >> Obviously you lack the competency to correctly answer the question. It doesn'nt
> >> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
> >> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
> >> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
> >> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
> >> segment of the infinite deductive chain of theorems we've denoted by (***).
> >
> > Btw, Martin, an inconsistent T of the language will have (***) as an infinite
> > deductive chain, last time one can check.
>
> Yes. And so will a consistent one.
Name _THAT consistent theory_ then, if you know what you're talking about.
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 21:40 -0600 |
| Message-ID | <p4123n$jpt$1@dont-email.me> |
| In reply to | #170657 |
On 1/20/2018 8:19 PM, Khong Dong wrote:
> On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote:
>> On 1/20/2018 6:23 PM, Khong Dong wrote:
>>> On Saturday, 20 January 2018 17:06:19 UTC-7, Khong Dong wrote:
>>>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
>>>>> On 1/18/2018 9:27 PM, Khong Dong wrote:
>>>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
>>>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote:
>>>>>>>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
>>>>>>>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
>>>>>>>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
>>>>>>>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
>>>>>>>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
>>>>>>>>>>>>>>>>>>>> denied the trivial fact that such examples are possible.. So your example was
>>>>>>>>>>>>>>>>>>>> not a counter-example to anything I said.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
>>>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> I don't see it as a counter-example because it isn't one..
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
>>>>>>>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
>>>>>>>>>>>>>>>>>>> (for lack of better grouping names).
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> ======> Group Hypotheses (GH)
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
>>>>>>>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
>>>>>>>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
>>>>>>>>>>>>>>>>>>> subset of the deductive closure of A."
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
>>>>>>>>>>>>>>>>>>> a subset of B and B is a subset of T."
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> ======> Group Inference (GI)
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
>>>>>>>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
>>>>>>>>>>>>>>>>>>> That was my claim, and it was correct."
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
>>>>>>>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> ======> Group Conclusion (GC)
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
>>>>>>>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> ***************************
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
>>>>>>>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
>>>>>>>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
>>>>>>>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
>>>>>>>>>>>>>>>>>> A must be either A or T.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> So, can A<S or S<T or both be true?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
>>>>>>>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
>>>>>>>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
>>>>>>>>>>>>>>> case?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I don't see any reason to revise anything I've already said.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
>>>>>>>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
>>>>>>>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
>>>>>>>>>>>>
>>>>>>>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
>>>>>>>>>>>>
>>>>>>>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
>>>>>>>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
>>>>>>>>>>>>
>>>>>>>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
>>>>>>>>>>>
>>>>>>>>>>> You must show it has an _AXIOM_ set which you have failed to show.
>>>>>>>>>>
>>>>>>>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
>>>>>>>>>
>>>>>>>>> Let me put it in simple English first and see if we have to be more technical.
>>>>>>>>>
>>>>>>>>> You need to show in T there's no infinite deduction chain - infinite to the left!
>>>>>>>>>
>>>>>>>>> If you stil don't, I'll go more technical.
>>>>>>>>
>>>>>>>> Assuming A0 is a non-logical theorem in T in all of the below.
>>>>>>>>
>>>>>>>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
>>>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
>>>>>>>> deduction sequence - deduction chain - (*) from left to right:
>>>>>>>>
>>>>>>>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
>>>>>>>>
>>>>>>>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
>>>>>>>>
>>>>>>>> In a _transcendental_ T, given the theorem A0, and up to formula logical
>>>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
>>>>>>>> deduction sequence - deduction chain - (*') from left to right:
>>>>>>>>
>>>>>>>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
>>>>>>>> A0,
>>>>>>>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
>>>>>>>>
>>>>>>>> Of course (*') is infinite to the right, and to the left. And in (*') there's
>>>>>>>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
>>>>>>>>
>>>>>>>> In either one of (*) and(*'), any two formulas of different positions have to
>>>>>>>> be deductively different: they aren't logically equivalent.
>>>>>>>
>>>>>>> I believe we can add "logically equivalent" to the list of terms you use
>>>>>>> without a clue as to what it means.
>>>>>>
>>>>>> Idiotic ranting of the liar Martin Shobe, as usual.
>>>>>>
>>>>>>> In your example of a deductive chain
>>>>>>> that is infinite to the right, all the formulas are logically equivalent.
>>>>>>
>>>>>> At least you seem to be more knowledgeable than Rupert in that you know what
>>>>>> what an infinite deduction chain is while he doesn't.
>>>>>>
>>>>>>>
>>>>>>> That can be fixed by using disjunction and adding a new formula instead
>>>>>>> of conjunction with the same one.
>>>>>>
>>>>>> You don't have any clue in what you're arguing about. The reason why (*) is
>>>>>> simple is because at your side of people (Peter, Jim, Rupert) didn't seem
>>>>>> to know what an infinite deduction chain is so I had to cooked up a
>>>>>> "kindergarten" example to help them understand.
>>>>>>
>>>>>> Anyway, so now you understand (*') is also an infinite deduction chain, right?
>>>>>
>>>>> According to the definition you've given, it's not. A0 is logically
>>>>> equivalent to A0 & A0. Since your definition requires that they are not
>>>>> logically equivalent, (*') is not an infinite deduction chain.
>>>>>
>>>>>> If you do, perhaps you could help explaining that to Rupert, for I think he
>>>>>> still has problem in understanding what an infinite deduction chain of theorems
>>>>>> be.
>>>>>
>>>>> I think it's you who is having the problem here.
>>>>>
>>>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
>>>>>>>> have the chain (*'), then that could be taken as proving there's no
>>>>>>>> transcendental theory. So far you haven't proved it yet.
>>>>>>>>
>>>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me
>>>>>>>> wrong: that's what Question 1 is for.
>>>>>>>>
>>>>>>>
>>>>>>> Given this, it's rather obvious that there are infinite chains both ways
>>>>>>> regardless of the theory.
>>>>>>
>>>>>> So wise guy, why don't you use your knowledge about infinite deductive chain
>>>>>> of theorems to find out which consistent theory would have my (***) below
>>>>>> (which I defined previously) as infinite deductive chain of theorems:
>>>>>>
>>>>>> (***):
>>>>>>
>>>>>> ....
>>>>>> There are n+1 counter examples of Goldbach Conjecture,
>>>>>> There are n counter examples of Goldbach Conjecture,
>>>>>> ....
>>>>>> There are 3 counter examples of Goldbach Conjecture,
>>>>>> There are 2 counter examples of Goldbach Conjecture,
>>>>>> There are 1 counter examples of Goldbach Conjecture,
>>>>>> ~(Goldbach Conjecture),
>>>>>> ~(Goldbach Conjecture) \/ 0=0,
>>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
>>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
>>>>>> ....
>>>>>>
>>>>>> Well, Martin, what's an example of a consistent theory T having (***) as
>>>>>> an infinite deductive chain of theorem?
>>>>>>
>>>>>
>>>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
>>>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
>>>>> theory, consistent or not, has it as an infinite deductive chain.
>>>>
>>>> Obviously you lack the competency to correctly answer the question. It doesn'nt
>>>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
>>>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
>>>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
>>>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
>>>> segment of the infinite deductive chain of theorems we've denoted by (***).
>>>
>>> Btw, Martin, an inconsistent T of the language will have (***) as an infinite
>>> deductive chain, last time one can check.
>>
>> Yes. And so will a consistent one.
>
> Name _THAT consistent theory_ then, if you know what you're talking about.
>
As I've said before, you can using any consistent theory. PA will do. If
you want something simpler, use the theory that consists of the group
axioms.
Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 19:48 -0800 |
| Message-ID | <fc474513-022a-4521-b85e-6179e23a34d4@googlegroups.com> |
| In reply to | #170661 |
On Saturday, 20 January 2018 20:40:42 UTC-7, Shobe, Martin wrote:
> On 1/20/2018 8:19 PM, Khong Dong wrote:
> > On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote:
> >> On 1/20/2018 6:23 PM, Khong Dong wrote:
> >>> On Saturday, 20 January 2018 17:06:19 UTC-7, Khong Dong wrote:
> >>>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
> >>>>> On 1/18/2018 9:27 PM, Khong Dong wrote:
> >>>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
> >>>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote:
> >>>>>>>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
> >>>>>>>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
> >>>>>>>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
> >>>>>>>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
> >>>>>>>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
> >>>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
> >>>>>>>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
> >>>>>>>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
> >>>>>>>>>>>>>>>>>>>> denied the trivial fact that such examples are possible.. So your example was
> >>>>>>>>>>>>>>>>>>>> not a counter-example to anything I said.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
> >>>>>>>>>>>>>>>>>>> invalid.
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> I don't see it as a counter-example because it isn't one..
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
> >>>>>>>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
> >>>>>>>>>>>>>>>>>>> (for lack of better grouping names).
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> ======> Group Hypotheses (GH)
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
> >>>>>>>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
> >>>>>>>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
> >>>>>>>>>>>>>>>>>>> subset of the deductive closure of A."
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
> >>>>>>>>>>>>>>>>>>> a subset of B and B is a subset of T."
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> ======> Group Inference (GI)
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
> >>>>>>>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
> >>>>>>>>>>>>>>>>>>> That was my claim, and it was correct."
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
> >>>>>>>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> ======> Group Conclusion (GC)
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
> >>>>>>>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> ***************************
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
> >>>>>>>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
> >>>>>>>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
> >>>>>>>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
> >>>>>>>>>>>>>>>>>> A must be either A or T.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> So, can A<S or S<T or both be true?
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
> >>>>>>>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
> >>>>>>>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
> >>>>>>>>>>>>>>> case?
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> I don't see any reason to revise anything I've already said.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
> >>>>>>>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
> >>>>>>>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
> >>>>>>>>>>>>
> >>>>>>>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
> >>>>>>>>>>>>
> >>>>>>>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
> >>>>>>>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
> >>>>>>>>>>>>
> >>>>>>>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
> >>>>>>>>>>>
> >>>>>>>>>>> You must show it has an _AXIOM_ set which you have failed to show.
> >>>>>>>>>>
> >>>>>>>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
> >>>>>>>>>
> >>>>>>>>> Let me put it in simple English first and see if we have to be more technical.
> >>>>>>>>>
> >>>>>>>>> You need to show in T there's no infinite deduction chain - infinite to the left!
> >>>>>>>>>
> >>>>>>>>> If you stil don't, I'll go more technical.
> >>>>>>>>
> >>>>>>>> Assuming A0 is a non-logical theorem in T in all of the below.
> >>>>>>>>
> >>>>>>>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
> >>>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
> >>>>>>>> deduction sequence - deduction chain - (*) from left to right:
> >>>>>>>>
> >>>>>>>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
> >>>>>>>>
> >>>>>>>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
> >>>>>>>>
> >>>>>>>> In a _transcendental_ T, given the theorem A0, and up to formula logical
> >>>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
> >>>>>>>> deduction sequence - deduction chain - (*') from left to right:
> >>>>>>>>
> >>>>>>>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
> >>>>>>>> A0,
> >>>>>>>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
> >>>>>>>>
> >>>>>>>> Of course (*') is infinite to the right, and to the left. And in (*') there's
> >>>>>>>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
> >>>>>>>>
> >>>>>>>> In either one of (*) and(*'), any two formulas of different positions have to
> >>>>>>>> be deductively different: they aren't logically equivalent.
> >>>>>>>
> >>>>>>> I believe we can add "logically equivalent" to the list of terms you use
> >>>>>>> without a clue as to what it means.
> >>>>>>
> >>>>>> Idiotic ranting of the liar Martin Shobe, as usual.
> >>>>>>
> >>>>>>> In your example of a deductive chain
> >>>>>>> that is infinite to the right, all the formulas are logically equivalent.
> >>>>>>
> >>>>>> At least you seem to be more knowledgeable than Rupert in that you know what
> >>>>>> what an infinite deduction chain is while he doesn't.
> >>>>>>
> >>>>>>>
> >>>>>>> That can be fixed by using disjunction and adding a new formula instead
> >>>>>>> of conjunction with the same one.
> >>>>>>
> >>>>>> You don't have any clue in what you're arguing about. The reason why (*) is
> >>>>>> simple is because at your side of people (Peter, Jim, Rupert) didn't seem
> >>>>>> to know what an infinite deduction chain is so I had to cooked up a
> >>>>>> "kindergarten" example to help them understand.
> >>>>>>
> >>>>>> Anyway, so now you understand (*') is also an infinite deduction chain, right?
> >>>>>
> >>>>> According to the definition you've given, it's not. A0 is logically
> >>>>> equivalent to A0 & A0. Since your definition requires that they are not
> >>>>> logically equivalent, (*') is not an infinite deduction chain.
> >>>>>
> >>>>>> If you do, perhaps you could help explaining that to Rupert, for I think he
> >>>>>> still has problem in understanding what an infinite deduction chain of theorems
> >>>>>> be.
> >>>>>
> >>>>> I think it's you who is having the problem here.
> >>>>>
> >>>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
> >>>>>>>> have the chain (*'), then that could be taken as proving there's no
> >>>>>>>> transcendental theory. So far you haven't proved it yet.
> >>>>>>>>
> >>>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me
> >>>>>>>> wrong: that's what Question 1 is for.
> >>>>>>>>
> >>>>>>>
> >>>>>>> Given this, it's rather obvious that there are infinite chains both ways
> >>>>>>> regardless of the theory.
> >>>>>>
> >>>>>> So wise guy, why don't you use your knowledge about infinite deductive chain
> >>>>>> of theorems to find out which consistent theory would have my (***) below
> >>>>>> (which I defined previously) as infinite deductive chain of theorems:
> >>>>>>
> >>>>>> (***):
> >>>>>>
> >>>>>> ....
> >>>>>> There are n+1 counter examples of Goldbach Conjecture,
> >>>>>> There are n counter examples of Goldbach Conjecture,
> >>>>>> ....
> >>>>>> There are 3 counter examples of Goldbach Conjecture,
> >>>>>> There are 2 counter examples of Goldbach Conjecture,
> >>>>>> There are 1 counter examples of Goldbach Conjecture,
> >>>>>> ~(Goldbach Conjecture),
> >>>>>> ~(Goldbach Conjecture) \/ 0=0,
> >>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
> >>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
> >>>>>> ....
> >>>>>>
> >>>>>> Well, Martin, what's an example of a consistent theory T having (***) as
> >>>>>> an infinite deductive chain of theorem?
> >>>>>>
> >>>>>
> >>>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
> >>>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
> >>>>> theory, consistent or not, has it as an infinite deductive chain.
> >>>>
> >>>> Obviously you lack the competency to correctly answer the question. It doesn'nt
> >>>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
> >>>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
> >>>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
> >>>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
> >>>> segment of the infinite deductive chain of theorems we've denoted by (***).
> >>>
> >>> Btw, Martin, an inconsistent T of the language will have (***) as an infinite
> >>> deductive chain, last time one can check.
> >>
> >> Yes. And so will a consistent one.
> >
> > Name _THAT consistent theory_ then, if you know what you're talking about.
> >
>
> As I've said before, you can using any consistent theory. PA will do.
You're bluffing of course. No known textbooks would say PA proves, say, "There
are 3 counter examples of Goldbach Conjecture".
> If
> you want something simpler, use the theory that consists of the group
> axioms.
As shown above you don't have any clue to what you're talking about.
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 22:31 -0600 |
| Message-ID | <p4153s$29f$1@dont-email.me> |
| In reply to | #170663 |
On 1/20/2018 9:48 PM, Khong Dong wrote:
> On Saturday, 20 January 2018 20:40:42 UTC-7, Shobe, Martin wrote:
>> On 1/20/2018 8:19 PM, Khong Dong wrote:
>>> On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote:
>>>> On 1/20/2018 6:23 PM, Khong Dong wrote:
>>>>> On Saturday, 20 January 2018 17:06:19 UTC-7, Khong Dong wrote:
>>>>>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote:
>>>>>>> On 1/18/2018 9:27 PM, Khong Dong wrote:
>>>>>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote:
>>>>>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote:
>>>>>>>>>> On Sunday, 14 January 2018 12:46:55 UTC-7, Khong Dong wrote:
>>>>>>>>>>> On Sunday, 14 January 2018 10:32:56 UTC-7, Rupert wrote:
>>>>>>>>>>>> On Sunday, January 14, 2018 at 6:29:31 PM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>> On Sunday, 14 January 2018 10:17:10 UTC-7, Rupert wrote:
>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:51:51 PM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>> On Sunday, 14 January 2018 02:33:37 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 7:34:56 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 23:05:30 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 6:47:44 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 22:24:36 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>>>>>> On Sunday, January 14, 2018 at 5:22:21 AM UTC+1, Khong Dong wrote:
>>>>>>>>>>>>>>>>>>>>> On Saturday, 13 January 2018 20:28:59 UTC-7, Rupert wrote:
>>>>>>>>>>>>>>>>>>>>>> You gave an example of a set A' which was a proper subset of a theory T such
>>>>>>>>>>>>>>>>>>>>>> that the deductive closure of A' is not equal to T. Obviously I never once
>>>>>>>>>>>>>>>>>>>>>> denied the trivial fact that such examples are possible.. So your example was
>>>>>>>>>>>>>>>>>>>>>> not a counter-example to anything I said.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You don't see it as a counter example because you don't see your proof is
>>>>>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> I don't see it as a counter-example because it isn't one..
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> But let's examine your proofs again based on your own writing from
>>>>>>>>>>>>>>>>>>>>> various posts. I'm going to group them in the below groups with some "names"
>>>>>>>>>>>>>>>>>>>>> (for lack of better grouping names).
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> ======> Group Hypotheses (GH)
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> H1 - 'A refers to the complement of the singleton set whose sole member is
>>>>>>>>>>>>>>>>>>>>> "Ax(x=x)" in the set T.'
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> H2 - "A is a subset of T so the deductive closure of A is a susbet of the
>>>>>>>>>>>>>>>>>>>>> deductive closure of T, and the deductive closure of T is T."
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> H3 - So the deductive closure of A is a subset of T, and also clearly A is a
>>>>>>>>>>>>>>>>>>>>> subset of the deductive closure of A."
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> H4 - So the deductive closure of A, let's call it B, is a set B such that A is
>>>>>>>>>>>>>>>>>>>>> a subset of B and B is a subset of T."
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> ======> Group Inference (GI)
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> I1a - "There are only two sets with that property, A and T."
>>>>>>>>>>>>>>>>>>>>> I1b - "There are exactly two sets S such that A<=S<=T, namely A and T.
>>>>>>>>>>>>>>>>>>>>> That was my claim, and it was correct."
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> I2 - 'But a deductively closed set of formulas has to include every logically
>>>>>>>>>>>>>>>>>>>>> valid formula, including "Ax[x=x]".'
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> ======> Group Conclusion (GC)
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> C1 - "So the deductive closure of A has to be T."
>>>>>>>>>>>>>>>>>>>>> C2 - "Therefore A is a set of axioms for T."
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> ***************************
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Do you mind elaborating _in detail_ how you'd reach to your conclusion C1, from
>>>>>>>>>>>>>>>>>>>>> your inferences I1a/I1b, and I2?
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> We have established that the deductive closure of A is a set S with the
>>>>>>>>>>>>>>>>>>>> property that A<=S<=T (as H4 says). I1a says there are only two sets with
>>>>>>>>>>>>>>>>>>>> that property, A and T. We can conclude then, that the deductive closure of
>>>>>>>>>>>>>>>>>>>> A must be either A or T.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> So, can A<S or S<T or both be true?
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Let S denote the deductive closure of A. I established that A is a subset of S and S is a subset of T. The best sense I can make of your question is "Is it possible that either A is a proper subset of S or S is a proper subset of T or both?" The answer is yes.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, consider the case where S=A. Then A is a subset of S, but not a proper subset of S, and S is a proper subset of T. Now consider the case where S=T. Then S is a subset of T, but not a proper subset of T, and A is a proper subset of S.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> In an attempt to clear up any confusion you may be experiencing, why don't you
>>>>>>>>>>>>>>>>> consider the case that, to begin with, T has non-logical theorems but _no_
>>>>>>>>>>>>>>>>> non-logical axiom: what is the relationship between your A, S, and T in that
>>>>>>>>>>>>>>>>> case?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> I don't see any reason to revise anything I've already said.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Of course there is a reason. By the definitions in this thread (algebraic and
>>>>>>>>>>>>>>> transcendental theories) you MUST be able to formulate ONE specific non-logical
>>>>>>>>>>>>>>> canonical axiom to _PROVE_ there's no transcendental theory - a tall order.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> To prove that there is no transcendental theory according to your definition, I must show that every deductively closed set of formulas has a proper subset whose deductive closure is the entire set. I did this.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Your selecting A = T - {Ax[x=x]} does _NOT_ show any formulated ONE specific
>>>>>>>>>>>>>>> non-logical canonical axiom *in A*. So you haven't proved your tall order yet.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I don't understand your objection. Obviously the members of A will depend what T is, tell me what T is then I'll give you an example of a non-logical axiom in A.
>>>>>>>>>>>>>
>>>>>>>>>>>>> You must show it has an _AXIOM_ set which you have failed to show.
>>>>>>>>>>>>
>>>>>>>>>>>> Well, I did show it had a proper subset whose deductive closure was equal to the entire set. So if that's not the same as showing that it has an axiom set, then what is required to show that?
>>>>>>>>>>>
>>>>>>>>>>> Let me put it in simple English first and see if we have to be more technical.
>>>>>>>>>>>
>>>>>>>>>>> You need to show in T there's no infinite deduction chain - infinite to the left!
>>>>>>>>>>>
>>>>>>>>>>> If you stil don't, I'll go more technical.
>>>>>>>>>>
>>>>>>>>>> Assuming A0 is a non-logical theorem in T in all of the below.
>>>>>>>>>>
>>>>>>>>>> In an _algebraic_ T, given the (canonical) axiom A0, and up to formula logical
>>>>>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
>>>>>>>>>> deduction sequence - deduction chain - (*) from left to right:
>>>>>>>>>>
>>>>>>>>>> (*) A0, A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ....
>>>>>>>>>>
>>>>>>>>>> Of course (*) is infinite to the right. And in (*) there's a non-logical axiom: A0.
>>>>>>>>>>
>>>>>>>>>> In a _transcendental_ T, given the theorem A0, and up to formula logical
>>>>>>>>>> equivalence or syntactical elimination/replacement, you'd have the following
>>>>>>>>>> deduction sequence - deduction chain - (*') from left to right:
>>>>>>>>>>
>>>>>>>>>> (*') ..., A-(n+1), A-n, ..., A-3, A-2, A-1,
>>>>>>>>>> A0,
>>>>>>>>>> A0 & A0, A0 & A0 & A0, A0 & A0 & A0 & A0, A0 & A0 & A0 & A0 & A0, ...
>>>>>>>>>>
>>>>>>>>>> Of course (*') is infinite to the right, and to the left. And in (*') there's
>>>>>>>>>> _NO_ non-logical axiom: the set of non-logical canonical axioms is empty!
>>>>>>>>>>
>>>>>>>>>> In either one of (*) and(*'), any two formulas of different positions have to
>>>>>>>>>> be deductively different: they aren't logically equivalent.
>>>>>>>>>
>>>>>>>>> I believe we can add "logically equivalent" to the list of terms you use
>>>>>>>>> without a clue as to what it means.
>>>>>>>>
>>>>>>>> Idiotic ranting of the liar Martin Shobe, as usual.
>>>>>>>>
>>>>>>>>> In your example of a deductive chain
>>>>>>>>> that is infinite to the right, all the formulas are logically equivalent.
>>>>>>>>
>>>>>>>> At least you seem to be more knowledgeable than Rupert in that you know what
>>>>>>>> what an infinite deduction chain is while he doesn't.
>>>>>>>>
>>>>>>>>>
>>>>>>>>> That can be fixed by using disjunction and adding a new formula instead
>>>>>>>>> of conjunction with the same one.
>>>>>>>>
>>>>>>>> You don't have any clue in what you're arguing about. The reason why (*) is
>>>>>>>> simple is because at your side of people (Peter, Jim, Rupert) didn't seem
>>>>>>>> to know what an infinite deduction chain is so I had to cooked up a
>>>>>>>> "kindergarten" example to help them understand.
>>>>>>>>
>>>>>>>> Anyway, so now you understand (*') is also an infinite deduction chain, right?
>>>>>>>
>>>>>>> According to the definition you've given, it's not. A0 is logically
>>>>>>> equivalent to A0 & A0. Since your definition requires that they are not
>>>>>>> logically equivalent, (*') is not an infinite deduction chain.
>>>>>>>
>>>>>>>> If you do, perhaps you could help explaining that to Rupert, for I think he
>>>>>>>> still has problem in understanding what an infinite deduction chain of theorems
>>>>>>>> be.
>>>>>>>
>>>>>>> I think it's you who is having the problem here.
>>>>>>>
>>>>>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly
>>>>>>>>>> have the chain (*'), then that could be taken as proving there's no
>>>>>>>>>> transcendental theory. So far you haven't proved it yet.
>>>>>>>>>>
>>>>>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me
>>>>>>>>>> wrong: that's what Question 1 is for.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Given this, it's rather obvious that there are infinite chains both ways
>>>>>>>>> regardless of the theory.
>>>>>>>>
>>>>>>>> So wise guy, why don't you use your knowledge about infinite deductive chain
>>>>>>>> of theorems to find out which consistent theory would have my (***) below
>>>>>>>> (which I defined previously) as infinite deductive chain of theorems:
>>>>>>>>
>>>>>>>> (***):
>>>>>>>>
>>>>>>>> ....
>>>>>>>> There are n+1 counter examples of Goldbach Conjecture,
>>>>>>>> There are n counter examples of Goldbach Conjecture,
>>>>>>>> ....
>>>>>>>> There are 3 counter examples of Goldbach Conjecture,
>>>>>>>> There are 2 counter examples of Goldbach Conjecture,
>>>>>>>> There are 1 counter examples of Goldbach Conjecture,
>>>>>>>> ~(Goldbach Conjecture),
>>>>>>>> ~(Goldbach Conjecture) \/ 0=0,
>>>>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0,
>>>>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0,
>>>>>>>> ....
>>>>>>>>
>>>>>>>> Well, Martin, what's an example of a consistent theory T having (***) as
>>>>>>>> an infinite deductive chain of theorem?
>>>>>>>>
>>>>>>>
>>>>>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is
>>>>>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no
>>>>>>> theory, consistent or not, has it as an infinite deductive chain.
>>>>>>
>>>>>> Obviously you lack the competency to correctly answer the question. It doesn'nt
>>>>>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the
>>>>>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence
>>>>>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence
>>>>>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite
>>>>>> segment of the infinite deductive chain of theorems we've denoted by (***).
>>>>>
>>>>> Btw, Martin, an inconsistent T of the language will have (***) as an infinite
>>>>> deductive chain, last time one can check.
>>>>
>>>> Yes. And so will a consistent one.
>>>
>>> Name _THAT consistent theory_ then, if you know what you're talking about.
>>>
>>
>> As I've said before, you can using any consistent theory. PA will do.
>
> You're bluffing of course. No known textbooks would say PA proves, say, "There
> are 3 counter examples of Goldbach Conjecture".
Of course they wouldn't. But that's not necessary to meet your
definition. We only need to have "there are 3 counter examples of the
Golbach Conjecture" to follow from "there are 4 counter examples of the
Golbach Conjecture". (And the same for all the other formulas in the
chain). Obviously, this all is assuming that we've dropped the "not
logically equivalent" requirement needed to make (***) an infinite
deductive chain.
Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 21:08 -0800 |
| Message-ID | <e224fc56-740d-4d37-ab54-a490eab04c42@googlegroups.com> |
| In reply to | #170667 |
On Saturday, 20 January 2018 21:31:58 UTC-7, Shobe, Martin wrote: > On 1/20/2018 9:48 PM, Khong Dong wrote: > > On Saturday, 20 January 2018 20:40:42 UTC-7, Shobe, Martin wrote: > >> On 1/20/2018 8:19 PM, Khong Dong wrote: > >>> On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote: > >>>> On 1/20/2018 6:23 PM, Khong Dong wrote: > >>>>> Btw, Martin, an inconsistent T of the language will have (***) as an infinite > >>>>> deductive chain, last time one can check. > >>>> > >>>> Yes. And so will a consistent one. > >>> > >>> Name _THAT consistent theory_ then, if you know what you're talking about. > >>> > >> > >> As I've said before, you can using any consistent theory. PA will do. > > > > You're bluffing of course. No known textbooks would say PA proves, say, "There > > are 3 counter examples of Goldbach Conjecture". > > Of course they wouldn't. Which proves you were lying above with your "As I've said before, you can using any consistent theory. PA will do"
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-21 09:07 -0600 |
| Message-ID | <p42ac7$iuu$1@dont-email.me> |
| In reply to | #170673 |
On 1/20/2018 11:08 PM, Khong Dong wrote: > On Saturday, 20 January 2018 21:31:58 UTC-7, Shobe, Martin wrote: >> On 1/20/2018 9:48 PM, Khong Dong wrote: >>> On Saturday, 20 January 2018 20:40:42 UTC-7, Shobe, Martin wrote: >>>> On 1/20/2018 8:19 PM, Khong Dong wrote: >>>>> On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote: >>>>>> On 1/20/2018 6:23 PM, Khong Dong wrote: > >>>>>>> Btw, Martin, an inconsistent T of the language will have (***) as an infinite >>>>>>> deductive chain, last time one can check. >>>>>> >>>>>> Yes. And so will a consistent one. >>>>> >>>>> Name _THAT consistent theory_ then, if you know what you're talking about. >>>>> >>>> >>>> As I've said before, you can using any consistent theory. PA will do. >>> >>> You're bluffing of course. No known textbooks would say PA proves, say, "There >>> are 3 counter examples of Goldbach Conjecture". >> >> Of course they wouldn't. > > Which proves you were lying above with your "As I've said before, you can using > any consistent theory. PA will do" > I see you dishonestly cut out why they won't. By your definition, there's no need for any of the formulas to be theorems of T. They only need to be provable in T *given the previous formula*. So "There are 3 counter examples of Goldbach Conjecture" doesn't need to follow from T. It just needs to follow from T and "There are 4 counter examples of Goldbach Conjecture". It's certainly true that if there are 4 counter examples, then there are 3 counter examples. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-21 15:13 +0000 |
| Message-ID | <p42an0$2fu$1@news.albasani.net> |
| In reply to | #170673 |
Khong Dong wrote: > On Saturday, 20 January 2018 21:31:58 UTC-7, Shobe, Martin wrote: >> On 1/20/2018 9:48 PM, Khong Dong wrote: >>> On Saturday, 20 January 2018 20:40:42 UTC-7, Shobe, Martin wrote: >>>> On 1/20/2018 8:19 PM, Khong Dong wrote: >>>>> On Saturday, 20 January 2018 18:25:43 UTC-7, Shobe, Martin wrote: >>>>>> On 1/20/2018 6:23 PM, Khong Dong wrote: > >>>>>>> Btw, Martin, an inconsistent T of the language will have (***) as an infinite >>>>>>> deductive chain, last time one can check. >>>>>> >>>>>> Yes. And so will a consistent one. >>>>> >>>>> Name _THAT consistent theory_ then, if you know what you're talking about. >>>>> >>>> >>>> As I've said before, you can using any consistent theory. PA will do. >>> >>> You're bluffing of course. No known textbooks would say PA proves, say, "There >>> are 3 counter examples of Goldbach Conjecture". >> >> Of course they wouldn't. > > Which proves you were lying above with your "As I've said before, you can using > any consistent theory. PA will do" Whatever the status of the Goldbach Conjecture, 'there are n+1 counter examples to the Goldbach Conjecture' implies 'there are n counter examples to the Goldbach Conjecture' just so long as n=/=0. >
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 19:24 -0600 |
| Message-ID | <p40q52$fn$1@dont-email.me> |
| In reply to | #170647 |
On 1/20/2018 6:06 PM, Khong Dong wrote: > On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote: >> On 1/18/2018 9:27 PM, Khong Dong wrote: >>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote: >>>> On 1/14/2018 10:49 PM, Khong Dong wrote: >>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly >>>>> have the chain (*'), then that could be taken as proving there's no >>>>> transcendental theory. So far you haven't proved it yet. >>>>> >>>>> On a hunch, I don't think it's possible to prove that. But you could prove me >>>>> wrong: that's what Question 1 is for. >>>>> >>>> >>>> Given this, it's rather obvious that there are infinite chains both ways >>>> regardless of the theory. >>> >>> So wise guy, why don't you use your knowledge about infinite deductive chain >>> of theorems to find out which consistent theory would have my (***) below >>> (which I defined previously) as infinite deductive chain of theorems: >>> >>> (***): >>> >>> .... >>> There are n+1 counter examples of Goldbach Conjecture, >>> There are n counter examples of Goldbach Conjecture, >>> .... >>> There are 3 counter examples of Goldbach Conjecture, >>> There are 2 counter examples of Goldbach Conjecture, >>> There are 1 counter examples of Goldbach Conjecture, >>> ~(Goldbach Conjecture), >>> ~(Goldbach Conjecture) \/ 0=0, >>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0, >>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0, >>> .... >>> >>> Well, Martin, what's an example of a consistent theory T having (***) as >>> an infinite deductive chain of theorem? >>> >> >> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is >> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no >> theory, consistent or not, has it as an infinite deductive chain. > > Obviously you lack the competency to correctly answer the question. It doesn'nt > matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the > hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence > ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence > (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite > segment of the infinite deductive chain of theorems we've denoted by (***). I never said that any of the links in the chain couldn't be proven given the previous link. You placed an *additional* constraint that the formulas are not logically equivalent. It's that *additional* constraint that is violated, not the existence of the proofs. If you were competent, you would have known this. >> If we drop the not logically equivalent requirement, any consistent >> theory that is capable of expressing the above statements would do. E.g. PA. > > You're using the phrase "logically equivalent" as a buzzword without realizing > what it would or would _NOT_ do for your failed arguments. You couldn't even understand what the counter argument was, as evidenced by how you focused on something that wasn't even under contention. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 18:32 -0800 |
| Message-ID | <72aeaaa9-5617-423c-94de-50800526954f@googlegroups.com> |
| In reply to | #170653 |
On Saturday, 20 January 2018 18:24:54 UTC-7, Shobe, Martin wrote: > On 1/20/2018 6:06 PM, Khong Dong wrote: > > On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote: > >> On 1/18/2018 9:27 PM, Khong Dong wrote: > >>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote: > >>>> On 1/14/2018 10:49 PM, Khong Dong wrote: > >>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly > >>>>> have the chain (*'), then that could be taken as proving there's no > >>>>> transcendental theory. So far you haven't proved it yet. > >>>>> > >>>>> On a hunch, I don't think it's possible to prove that. But you could prove me > >>>>> wrong: that's what Question 1 is for. > >>>>> > >>>> > >>>> Given this, it's rather obvious that there are infinite chains both ways > >>>> regardless of the theory. > >>> > >>> So wise guy, why don't you use your knowledge about infinite deductive chain > >>> of theorems to find out which consistent theory would have my (***) below > >>> (which I defined previously) as infinite deductive chain of theorems: > >>> > >>> (***): > >>> > >>> .... > >>> There are n+1 counter examples of Goldbach Conjecture, > >>> There are n counter examples of Goldbach Conjecture, > >>> .... > >>> There are 3 counter examples of Goldbach Conjecture, > >>> There are 2 counter examples of Goldbach Conjecture, > >>> There are 1 counter examples of Goldbach Conjecture, > >>> ~(Goldbach Conjecture), > >>> ~(Goldbach Conjecture) \/ 0=0, > >>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0, > >>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0, > >>> .... > >>> > >>> Well, Martin, what's an example of a consistent theory T having (***) as > >>> an infinite deductive chain of theorem? > >>> > >> > >> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is > >> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no > >> theory, consistent or not, has it as an infinite deductive chain. > > > > Obviously you lack the competency to correctly answer the question. It doesn'nt > > matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the > > hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence > > ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence > > (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite > > segment of the infinite deductive chain of theorems we've denoted by (***). > > I never said that any of the links in the chain couldn't be proven given > the previous link. You placed an *additional* constraint that the > formulas are not logically equivalent. It's that *additional* constraint > that is violated, not the existence of the proofs. Wow ... but in my challenge to you above it was strictly about (***), and did I mention about "logically equivalent" in my challenging you above?
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 21:45 -0600 |
| Message-ID | <p412c1$kuh$1@dont-email.me> |
| In reply to | #170658 |
On 1/20/2018 8:32 PM, Khong Dong wrote: > On Saturday, 20 January 2018 18:24:54 UTC-7, Shobe, Martin wrote: >> On 1/20/2018 6:06 PM, Khong Dong wrote: >>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote: >>>> On 1/18/2018 9:27 PM, Khong Dong wrote: >>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote: >>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote: >>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly >>>>>>> have the chain (*'), then that could be taken as proving there's no >>>>>>> transcendental theory. So far you haven't proved it yet. >>>>>>> >>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me >>>>>>> wrong: that's what Question 1 is for. >>>>>>> >>>>>> >>>>>> Given this, it's rather obvious that there are infinite chains both ways >>>>>> regardless of the theory. >>>>> >>>>> So wise guy, why don't you use your knowledge about infinite deductive chain >>>>> of theorems to find out which consistent theory would have my (***) below >>>>> (which I defined previously) as infinite deductive chain of theorems: >>>>> >>>>> (***): >>>>> >>>>> .... >>>>> There are n+1 counter examples of Goldbach Conjecture, >>>>> There are n counter examples of Goldbach Conjecture, >>>>> .... >>>>> There are 3 counter examples of Goldbach Conjecture, >>>>> There are 2 counter examples of Goldbach Conjecture, >>>>> There are 1 counter examples of Goldbach Conjecture, >>>>> ~(Goldbach Conjecture), >>>>> ~(Goldbach Conjecture) \/ 0=0, >>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0, >>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0, >>>>> .... >>>>> >>>>> Well, Martin, what's an example of a consistent theory T having (***) as >>>>> an infinite deductive chain of theorem? >>>>> >>>> >>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is >>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no >>>> theory, consistent or not, has it as an infinite deductive chain. >>> >>> Obviously you lack the competency to correctly answer the question. It doesn'nt >>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the >>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence >>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence >>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite >>> segment of the infinite deductive chain of theorems we've denoted by (***). >> >> I never said that any of the links in the chain couldn't be proven given >> the previous link. You placed an *additional* constraint that the >> formulas are not logically equivalent. It's that *additional* constraint >> that is violated, not the existence of the proofs. > > Wow ... but in my challenge to you above it was strictly about (***), and did I > mention about "logically equivalent" in my challenging you above? > Yes. By calling (***) an infinite deductive chain, you are saying that none of the formulas in (***) are logically equivalent. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 19:52 -0800 |
| Message-ID | <a51b4ca9-f39e-4d1c-9de3-4e1e7ee7f6ea@googlegroups.com> |
| In reply to | #170662 |
On Saturday, 20 January 2018 20:45:08 UTC-7, Shobe, Martin wrote: > On 1/20/2018 8:32 PM, Khong Dong wrote: > > On Saturday, 20 January 2018 18:24:54 UTC-7, Shobe, Martin wrote: > >> On 1/20/2018 6:06 PM, Khong Dong wrote: > >>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote: > >>>> On 1/18/2018 9:27 PM, Khong Dong wrote: > >>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote: > >>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote: > >>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly > >>>>>>> have the chain (*'), then that could be taken as proving there's no > >>>>>>> transcendental theory. So far you haven't proved it yet. > >>>>>>> > >>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me > >>>>>>> wrong: that's what Question 1 is for. > >>>>>>> > >>>>>> > >>>>>> Given this, it's rather obvious that there are infinite chains both ways > >>>>>> regardless of the theory. > >>>>> > >>>>> So wise guy, why don't you use your knowledge about infinite deductive chain > >>>>> of theorems to find out which consistent theory would have my (***) below > >>>>> (which I defined previously) as infinite deductive chain of theorems: > >>>>> > >>>>> (***): > >>>>> > >>>>> .... > >>>>> There are n+1 counter examples of Goldbach Conjecture, > >>>>> There are n counter examples of Goldbach Conjecture, > >>>>> .... > >>>>> There are 3 counter examples of Goldbach Conjecture, > >>>>> There are 2 counter examples of Goldbach Conjecture, > >>>>> There are 1 counter examples of Goldbach Conjecture, > >>>>> ~(Goldbach Conjecture), > >>>>> ~(Goldbach Conjecture) \/ 0=0, > >>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0, > >>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0, > >>>>> .... > >>>>> > >>>>> Well, Martin, what's an example of a consistent theory T having (***) as > >>>>> an infinite deductive chain of theorem? > >>>>> > >>>> > >>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is > >>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no > >>>> theory, consistent or not, has it as an infinite deductive chain. > >>> > >>> Obviously you lack the competency to correctly answer the question. It doesn'nt > >>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the > >>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence > >>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence > >>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite > >>> segment of the infinite deductive chain of theorems we've denoted by (***). > >> > >> I never said that any of the links in the chain couldn't be proven given > >> the previous link. You placed an *additional* constraint that the > >> formulas are not logically equivalent. It's that *additional* constraint > >> that is violated, not the existence of the proofs. > > > > Wow ... but in my challenge to you above it was strictly about (***), and did I > > mention about "logically equivalent" in my challenging you above? > > > > Yes. By calling (***) an infinite deductive chain, you are saying that > none of the formulas in (***) are logically equivalent. Wrong. You're too incompetent and you don't have any reason to assert that.
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-20 22:32 -0600 |
| Message-ID | <p41558$29f$2@dont-email.me> |
| In reply to | #170664 |
On 1/20/2018 9:52 PM, Khong Dong wrote: > On Saturday, 20 January 2018 20:45:08 UTC-7, Shobe, Martin wrote: >> On 1/20/2018 8:32 PM, Khong Dong wrote: >>> On Saturday, 20 January 2018 18:24:54 UTC-7, Shobe, Martin wrote: >>>> On 1/20/2018 6:06 PM, Khong Dong wrote: >>>>> On Saturday, 20 January 2018 07:20:05 UTC-7, Shobe, Martin wrote: >>>>>> On 1/18/2018 9:27 PM, Khong Dong wrote: >>>>>>> On Thursday, 18 January 2018 17:46:16 UTC-7, Shobe, Martin wrote: >>>>>>>> On 1/14/2018 10:49 PM, Khong Dong wrote: >>>>>>>>> So if you (Rupert) can prove there's _no_ T satisfying P1 - P3 can possibly >>>>>>>>> have the chain (*'), then that could be taken as proving there's no >>>>>>>>> transcendental theory. So far you haven't proved it yet. >>>>>>>>> >>>>>>>>> On a hunch, I don't think it's possible to prove that. But you could prove me >>>>>>>>> wrong: that's what Question 1 is for. >>>>>>>>> >>>>>>>> >>>>>>>> Given this, it's rather obvious that there are infinite chains both ways >>>>>>>> regardless of the theory. >>>>>>> >>>>>>> So wise guy, why don't you use your knowledge about infinite deductive chain >>>>>>> of theorems to find out which consistent theory would have my (***) below >>>>>>> (which I defined previously) as infinite deductive chain of theorems: >>>>>>> >>>>>>> (***): >>>>>>> >>>>>>> .... >>>>>>> There are n+1 counter examples of Goldbach Conjecture, >>>>>>> There are n counter examples of Goldbach Conjecture, >>>>>>> .... >>>>>>> There are 3 counter examples of Goldbach Conjecture, >>>>>>> There are 2 counter examples of Goldbach Conjecture, >>>>>>> There are 1 counter examples of Goldbach Conjecture, >>>>>>> ~(Goldbach Conjecture), >>>>>>> ~(Goldbach Conjecture) \/ 0=0, >>>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0, >>>>>>> ~(Goldbach Conjecture) \/ 0=0 \/ 0=0 \/ 0=0, >>>>>>> .... >>>>>>> >>>>>>> Well, Martin, what's an example of a consistent theory T having (***) as >>>>>>> an infinite deductive chain of theorem? >>>>>>> >>>>>> >>>>>> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is >>>>>> logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no >>>>>> theory, consistent or not, has it as an infinite deductive chain. >>>>> >>>>> Obviously you lack the competency to correctly answer the question. It doesn'nt >>>>> matter which formula ~(Goldbach Conjecture) is equivalent to: we're under the >>>>> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence >>>>> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence >>>>> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite >>>>> segment of the infinite deductive chain of theorems we've denoted by (***). >>>> >>>> I never said that any of the links in the chain couldn't be proven given >>>> the previous link. You placed an *additional* constraint that the >>>> formulas are not logically equivalent. It's that *additional* constraint >>>> that is violated, not the existence of the proofs. >>> >>> Wow ... but in my challenge to you above it was strictly about (***), and did I >>> mention about "logically equivalent" in my challenging you above? >>> >> >> Yes. By calling (***) an infinite deductive chain, you are saying that >> none of the formulas in (***) are logically equivalent. > > Wrong. You're too incompetent and you don't have any reason to assert that. > The reason is stated above. So far, you have avoided addressing it. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Khong Dong <khongdongphong@gmail.com> |
|---|---|
| Date | 2018-01-20 21:12 -0800 |
| Message-ID | <139e087a-a808-4c9e-a69e-49c0cc1190bf@googlegroups.com> |
| In reply to | #170668 |
On Saturday, 20 January 2018 21:32:41 UTC-7, Shobe, Martin wrote: > On 1/20/2018 9:52 PM, Khong Dong wrote: > > On Saturday, 20 January 2018 20:45:08 UTC-7, Shobe, Martin wrote: > >> On 1/20/2018 8:32 PM, Khong Dong wrote: > >>> Wow ... but in my challenge to you above it was strictly about (***), and did I > >>> mention about "logically equivalent" in my challenging you above? > >>> > >> > >> Yes. By calling (***) an infinite deductive chain, you are saying that > >> none of the formulas in (***) are logically equivalent. > > > > Wrong. You're too incompetent and you don't have any reason to assert that. > > > > The reason is stated above. So far, you have avoided addressing it. Idiotic lie from the liar Martin Shobe.
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-21 09:02 -0600 |
| Message-ID | <p42a25$gvj$1@dont-email.me> |
| In reply to | #170674 |
On 1/20/2018 11:12 PM, Khong Dong wrote: > On Saturday, 20 January 2018 21:32:41 UTC-7, Shobe, Martin wrote: >> On 1/20/2018 9:52 PM, Khong Dong wrote: >>> On Saturday, 20 January 2018 20:45:08 UTC-7, Shobe, Martin wrote: >>>> On 1/20/2018 8:32 PM, Khong Dong wrote: > >>>>> Wow ... but in my challenge to you above it was strictly about (***), and did I >>>>> mention about "logically equivalent" in my challenging you above? >>>>> >>>> >>>> Yes. By calling (***) an infinite deductive chain, you are saying that >>>> none of the formulas in (***) are logically equivalent. >>> >>> Wrong. You're too incompetent and you don't have any reason to assert that. >>> >> >> The reason is stated above. So far, you have avoided addressing it. > > Idiotic lie from the liar Martin Shobe. > Since you've decided to cut it out, I'll repeat it here. <quote> It's not an infinite deductive chain (~(Goldbach Conjecture) \/ 0=0 is logically equivalent to ~(Goldbach Conjecture) \/ 0=0 \/ 0=0), so no theory, consistent or not, has it as an infinite deductive chain. </quote> Here's the quote of you saying that the formulas may not be logically equivalent. <quote> In either one of (*) and(*'), any two formulas of different positions have to be deductively different: they aren't logically equivalent. </quote> You've not dealt with the fact that every last example of your infinite deductive chains has used logically equivalent formulas. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-21 14:57 +0000 |
| Message-ID | <p429pg$3ft$1@news.albasani.net> |
| In reply to | #170647 |
Khong Dong wrote: > we're under the > hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence There's no need to hypothesize that because... > ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, hence ... ~(Goldbach Conjecture) \/ 0=0 is a theorem even if it's false. > (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid finite > segment of the infinite deductive chain of theorems we've denoted by (***). > >> If we drop the not logically equivalent requirement, any consistent >> theory that is capable of expressing the above statements would do. E.g. PA. > > You're using the phrase "logically equivalent" as a buzzword without realizing > what it would or would _NOT_ do for your failed arguments. >
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-21 18:18 +0000 |
| Message-ID | <p42li1$8b7$1@news.albasani.net> |
| In reply to | #170690 |
Peter Percival wrote: > Khong Dong wrote: > >> we're under the >> hypothetical that ~(Goldbach Conjecture) is a theorem in T, hence > > There's no need to hypothesize that because... > >> ~(Goldbach Conjecture) \/ 0=0 is a theorem in T by the Expansion Rule, >> hence > > ... ~(Goldbach Conjecture) \/ 0=0 is a theorem even if it's false. That's not very clear. What I meant was "even if the Goldbach Conjecture is false". > >> (~(Goldbach Conjecture), (~(Goldbach Conjecture) \/ 0=0)), is a valid >> finite >> segment of the infinite deductive chain of theorems we've denoted by >> (***). >> >>> If we drop the not logically equivalent requirement, any consistent >>> theory that is capable of expressing the above statements would do. >>> E.g. PA. >> >> You're using the phrase "logically equivalent" as a buzzword without >> realizing >> what it would or would _NOT_ do for your failed arguments. >> >
[toc] | [prev] | [next] | [standalone]
Page 11 of 13 — ← Prev page 1 … 9 10 [11] 12 13 Next page →
Back to top | Article view | sci.logic
csiph-web