Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #23621 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-09-28 16:22 -0500 |
| Last post | 2020-09-29 13:18 -0500 |
| Articles | 20 on this page of 408 — 15 participants |
Back to article view | Back to comp.theory
Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-28 16:22 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-28 15:29 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-28 16:36 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-28 16:31 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-28 19:00 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-28 19:04 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-28 22:00 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 01:48 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 10:49 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 12:34 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 14:17 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 11:31 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 12:40 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 14:34 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 14:06 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 15:47 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 16:44 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-29 23:26 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 19:40 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 02:12 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 21:38 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 12:43 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 11:38 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 20:07 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 14:42 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 21:24 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 15:45 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 21:32 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 22:47 -0500
Re: Formal specification of Minimal Type Theory (updated) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-09-29 21:29 -0700
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 22:54 -0600
Re: Formal specification of Minimal Type Theory (updated) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-09-29 22:47 -0700
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-30 06:33 -0600
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 16:40 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 19:51 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 02:38 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 21:46 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-09-30 06:45 +0000
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 12:40 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 10:58 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 19:55 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 14:25 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 21:01 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 15:12 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-09-30 15:30 -0600
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-30 08:57 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 12:04 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 19:40 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 14:21 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 20:50 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 14:57 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-09-30 15:42 -0600
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 21:25 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 22:41 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-29 22:22 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 00:54 -0500
Re: Formal specification of Minimal Type Theory (updated) Richard Damon <Richard@Damon-Family.org> - 2020-09-30 09:08 -0400
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 10:39 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-09-29 21:04 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 22:28 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 11:42 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 14:03 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 20:44 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 14:55 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-09-30 21:40 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 17:48 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-01 01:17 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 19:33 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-30 16:22 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 17:51 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-30 19:10 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 20:41 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-09-30 20:06 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-30 21:37 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-01 12:15 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-01 14:34 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-01 14:32 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-01 16:29 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-03 11:11 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-05 08:04 -0600
Re: Formal specification of Minimal Type Theory (updated) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-05 07:37 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-05 09:43 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-05 12:27 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-07 10:18 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-07 12:44 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-07 13:10 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-07 15:44 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-07 16:26 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-07 19:39 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-07 20:45 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-08 00:56 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-08 15:42 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-08 20:15 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-08 22:33 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-09 00:31 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 09:04 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-09 10:39 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 11:55 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-09 13:23 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 15:06 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-08 23:53 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-08 23:44 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 09:28 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-09 09:26 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 11:17 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-09 10:40 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 15:28 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-09 14:39 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 16:26 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-09 15:00 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-09 19:11 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-09 21:35 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 00:24 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-10 03:37 -0600
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-10 07:00 -0700
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-10 10:26 -0700
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-10 16:43 -0700
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-12 07:23 -0700
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-10 17:29 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 13:17 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-10 18:51 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 14:37 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-10 20:24 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 19:09 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-11 09:01 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 10:12 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-11 16:51 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 17:31 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-12 09:59 +0000
Re: Formal specification of Minimal Type Theory (updated) R Kym Horsell <kym@kymhorsell.com> - 2020-10-12 11:13 +0000
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-12 05:40 -0600
Re: Formal specification of Minimal Type Theory (updated) R Kym Horsell <kym@kymhorsell.com> - 2020-10-12 13:18 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-12 09:23 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-12 16:27 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-12 20:21 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-12 22:48 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 01:05 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Smaill <smaill@foxtrot.inf.ed.ac.uk> - 2020-10-13 09:29 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 10:18 -0500
Re: Formal specification of Minimal Type Theory (updated) Kaz Kylheku <793-849-0957@kylheku.com> - 2020-10-13 16:31 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 12:43 -0500
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-13 11:14 +0100
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-13 07:51 -0700
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-13 20:56 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 15:07 -0500
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-14 08:09 -0700
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-14 08:39 -0700
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-14 09:28 -0700
Re: Formal specification of Minimal Type Theory (updated) DV <xlt.pjw@gmail.com> - 2020-10-14 12:17 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 10:12 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-13 09:55 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 16:47 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-14 00:25 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 10:34 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-14 10:47 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 13:12 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 19:14 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 05:55 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 09:35 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 10:31 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 11:40 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 11:02 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 12:46 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 12:26 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 14:07 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 13:26 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 14:46 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 13:49 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 14:59 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 14:25 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 15:41 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 21:29 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 23:30 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-16 03:07 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 09:19 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-16 08:34 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 09:50 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-16 09:07 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 10:27 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-16 09:43 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 11:45 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-16 10:50 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 12:27 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-16 21:03 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 15:20 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 15:25 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-16 22:15 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 16:32 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 16:56 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-17 00:33 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 18:54 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-17 01:33 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 19:53 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-17 13:32 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 09:36 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-18 02:25 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 21:23 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-17 21:31 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 22:53 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 14:58 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-18 15:34 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:24 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 10:42 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 15:01 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 14:18 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 17:21 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 21:11 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 01:21 -0600
Re: Formal specification of Minimal Type Theory (updated) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2020-10-18 00:48 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 09:58 -0500
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-18 16:07 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:18 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-18 09:05 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:16 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-18 10:44 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 13:04 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-18 15:55 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 18:05 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-19 01:17 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 20:52 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-19 21:29 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 15:59 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-20 01:53 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 20:16 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-20 02:56 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 21:43 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-21 02:04 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-20 20:22 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-21 03:13 +0100
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-20 23:41 -0600
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-21 14:25 +0100
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 08:13 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 10:16 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 09:40 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 11:57 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 11:25 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 13:00 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 12:29 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 14:59 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 14:42 -0600
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-21 14:05 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 19:41 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-21 20:57 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 23:12 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-21 17:29 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 12:10 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 11:41 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 13:16 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-21 12:49 -0600
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-21 21:13 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-21 20:13 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-22 03:00 +0100
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-18 18:54 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 21:33 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-19 09:39 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 11:41 -0500
Re: Formal specification of Minimal Type Theory (updated) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-18 09:44 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 13:47 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:12 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-18 21:25 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 21:28 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-19 09:38 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 11:38 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-19 11:05 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 12:19 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-19 11:43 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 12:57 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-19 11:41 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 14:09 -0500
Re: Formal specification of Minimal Type Theory (updated) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-19 12:46 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 14:52 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-19 13:08 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 14:36 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-19 14:21 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 16:24 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-20 01:49 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-20 10:42 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-20 21:50 -0600
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-17 07:33 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 09:58 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 14:58 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-16 22:00 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 16:16 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-17 07:23 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 09:46 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 01:14 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:09 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 10:40 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 14:21 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-18 20:59 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 21:00 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-19 21:47 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-19 17:27 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-16 11:29 -0600
Re: Formal specification of Minimal Type Theory (updated) R Kym Horsell <kym@kymhorsell.com> - 2020-10-16 18:42 +0000
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-16 19:02 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 13:11 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-17 07:26 -0600
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-17 17:07 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 13:45 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-15 20:32 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 15:36 -0500
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-13 21:20 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 15:37 -0500
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-13 23:43 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 19:42 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-14 05:46 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 10:46 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-14 00:42 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 10:42 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-14 10:44 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 13:06 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-14 19:10 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 14:35 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-14 20:11 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 15:58 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 18:54 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-15 05:52 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 09:29 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-13 11:41 +0000
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-13 08:53 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 16:37 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-14 00:17 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 10:14 -0500
Re: Formal specification of Minimal Type Theory [ sound argument ] olcott <NoOne@NoWhere.com> - 2020-10-14 19:35 -0500
Re: Formal specification of Minimal Type Theory [ sound argument ] David Kleinecke <dkleinecke@gmail.com> - 2020-10-14 21:42 -0700
Re: Formal specification of Minimal Type Theory [ sound argument ] olcott <NoOne@NoWhere.com> - 2020-10-15 00:13 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-13 13:06 -0600
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-13 22:10 +0100
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-13 21:41 -0600
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-14 15:15 +0100
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-14 12:39 -0600
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-14 22:59 +0100
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-15 15:57 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 11:06 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-15 17:54 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 12:00 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-15 21:12 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 15:33 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-15 23:23 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-15 17:31 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-16 06:23 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-16 09:35 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-16 18:12 -0600
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-17 04:11 +0100
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-17 00:00 -0600
Re: Formal specification of Minimal Type Theory (updated) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-10-17 12:55 +0100
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-17 16:25 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 13:15 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-17 11:34 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 13:45 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-17 15:32 -0600
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-17 12:45 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 13:55 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-10-17 15:24 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-17 16:35 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 01:24 -0600
Re: Formal specification of Minimal Type Theory (updated) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-10-18 06:31 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 10:58 -0500
Re: Formal specification of Minimal Type Theory (updated) David Kleinecke <dkleinecke@gmail.com> - 2020-10-18 09:18 -0700
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:13 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 10:35 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 11:45 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-18 11:14 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-18 15:38 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-10 13:24 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 14:59 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-10 14:20 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 15:30 -0500
Re: Formal specification of Minimal Type Theory (updated) Alan Mackenzie <acm@muc.de> - 2020-10-10 20:49 +0000
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 10:02 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-10 09:58 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 21:29 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-11 06:33 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 09:49 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-11 18:05 -0600
Re: Formal specification of Minimal Type Theory (updated) Andy Walker <anw@cuboid.co.uk> - 2020-10-11 13:52 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 09:05 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-11 17:55 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 22:45 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-11 21:56 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 23:07 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-11 22:45 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-12 00:07 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-11 23:14 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-12 01:24 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-12 03:18 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-12 09:41 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-12 08:56 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 15:01 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-13 23:36 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 19:01 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-14 01:37 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-13 19:42 -0500
Re: Formal specification of Minimal Type Theory (updated) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-10-14 15:19 +0100
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-14 10:11 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-11 23:09 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-10 02:09 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 09:47 -0500
Re: Formal specification of Minimal Type Theory (updated) André G. Isaak <agisaak@gm.invalid> - 2020-10-10 09:18 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-10 20:40 -0500
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-10-02 10:22 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-09-28 23:29 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 01:02 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-09-29 01:01 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 10:20 -0500
Re: Formal specification of Minimal Type Theory (updated) Jeff Barnett <jbb@notatt.com> - 2020-09-29 12:06 -0600
Re: Formal specification of Minimal Type Theory (updated) olcott <NoOne@NoWhere.com> - 2020-09-29 13:18 -0500
Page 12 of 21 — ← Prev page 1 … 10 11 [12] 13 14 … 21 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-19 21:29 +0100 |
| Message-ID | <87y2k2gdsx.fsf@bsb.me.uk> |
| In reply to | #23975 |
olcott <NoOne@NoWhere.com> writes: > On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> <cut> >>> Undecidable propositions are only undecidable because they are >>> incorrect. >> >> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >> >> What is incorrect about x+y=y+x? > > Not provable by any means what-so-ever and true is impossible. You keep dodging this question. You decided that an "expression of language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. By your definition, the one you keep banging on about again and again and again, x+y=y+x must be incorrect. What is incorrect about it? Whatever you mean by "provable by any means" is a red herring. Your criterion for "incorrect" is neither provable nor refutable /in Q/. That applies to x+y=y+x, but you know as well as I do that there is nothing incorrect about that formula. You want to exclude it from your version of Q, PO-Q, but no one else wants to exclude it. The fact that it is undecidable is an interesting and important fact about this set of axioms. The fact is you thought you could capture the notion of "pathological self-reference" (that thing you have been unable to define for two decades) with the simple criterion T ⊬ e and T ⊬ ¬e. After all, that applies to the dreaded Gödel sentence so you went with that. The trouble is you don't know enough about either logical entailment or mathematical truth to make such claims without getting stuck. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-19 15:59 -0500 |
| Message-ID | <Mf2dnQh26O_QYxDCnZ2dnUU7-RfNnZ2d@giganews.com> |
| In reply to | #24001 |
On 10/19/2020 3:29 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> <cut> >>>> Undecidable propositions are only undecidable because they are >>>> incorrect. >>> >>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>> >>> What is incorrect about x+y=y+x? >> >> Not provable by any means what-so-ever and true is impossible. > > You keep dodging this question. You decided that an "expression of > language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. > By your definition, the one you keep banging on about again and again > and again, x+y=y+x must be incorrect. What is incorrect about it? > My revised claim is that if an expression of language representing the commutative property of addition can be expressed in a formal system yet neither proved not disproven in this formal system, then it is not a proposition of this formal system. > Whatever you mean by "provable by any means" is a red herring. Your > criterion for "incorrect" is neither provable nor refutable /in Q/. > That applies to x+y=y+x, but you know as well as I do that there is > nothing incorrect about that formula. Correct / incorrect is focused on expressions of language that cannot be evaluated as true or false because their evaluation never terminates. > You want to exclude it from your version of Q, PO-Q, but no one else > wants to exclude it. The fact that it is undecidable is an interesting > and important fact about this set of axioms. > > The fact is you thought you could capture the notion of "pathological > self-reference" (that thing you have been unable to define for two > decades) with the simple criterion T ⊬ e and T ⊬ ¬e. After all, that > applies to the dreaded Gödel sentence so you went with that. The > trouble is you don't know enough about either logical entailment or > mathematical truth to make such claims without getting stuck. I have already explained this completely to you far too many times. Your bias makes you goofy. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-20 01:53 +0100 |
| Message-ID | <875z75hg5m.fsf@bsb.me.uk> |
| In reply to | #24006 |
olcott <NoOne@NoWhere.com> writes: > On 10/19/2020 3:29 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> <cut> >>>>> Undecidable propositions are only undecidable because they are >>>>> incorrect. >>>> >>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>>> >>>> What is incorrect about x+y=y+x? >>> >>> Not provable by any means what-so-ever and true is impossible. >> >> You keep dodging this question. You decided that an "expression of >> language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. >> By your definition, the one you keep banging on about again and again >> and again, x+y=y+x must be incorrect. What is incorrect about it? > > My revised claim is that if an expression of language representing the > commutative property of addition can be expressed in a formal system > yet neither proved not disproven in this formal system, then it is not > a proposition of this formal system. In other words you were wrong. And you repeated the "un-revised" claim again and again, banging on about it as people tried to point our how silly it was. But you can't say "I was wrong", and you certainly won't apologise for wasting everyone's time. Instead you "revise" the claim so that it is wrong in a new way. It's wrong because you don't get to say what the sentences of Q are. Robinson defined Q, and x+y=y+x is one of them. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-19 20:16 -0500 |
| Message-ID | <N-SdnZ3KgsH_pxPCnZ2dnUU7-e3NnZ2d@giganews.com> |
| In reply to | #24026 |
On 10/19/2020 7:53 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/19/2020 3:29 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> <cut> >>>>>> Undecidable propositions are only undecidable because they are >>>>>> incorrect. >>>>> >>>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>>>> >>>>> What is incorrect about x+y=y+x? >>>> >>>> Not provable by any means what-so-ever and true is impossible. >>> >>> You keep dodging this question. You decided that an "expression of >>> language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. >>> By your definition, the one you keep banging on about again and again >>> and again, x+y=y+x must be incorrect. What is incorrect about it? >> >> My revised claim is that if an expression of language representing the >> commutative property of addition can be expressed in a formal system >> yet neither proved not disproven in this formal system, then it is not >> a proposition of this formal system. > > In other words you were wrong. And you repeated the "un-revised" claim > again and again, banging on about it as people tried to point our how > silly it was. But you can't say "I was wrong", and you certainly won't > apologise for wasting everyone's time. > Not exactly. My original claim still applies with a narrower scope: The original author of this paragraph says that it applies to every formal system that has Q as a subset. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F https://plato.stanford.edu/entries/goedel-incompleteness/ The only way that an expression of language is neither provable nor disprovable in any formal system of Q or greater is if the expression of language is incorrect. > Instead you "revise" the claim so that it is wrong in a new way. > It's wrong because you don't get to say what the sentences of Q are. > Robinson defined Q, and x+y=y+x is one of them. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-20 02:56 +0100 |
| Message-ID | <87tuupfyn6.fsf@bsb.me.uk> |
| In reply to | #24029 |
olcott <NoOne@NoWhere.com> writes: > On 10/19/2020 7:53 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/19/2020 3:29 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> <cut> >>>>>>> Undecidable propositions are only undecidable because they are >>>>>>> incorrect. >>>>>> >>>>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>>>>> >>>>>> What is incorrect about x+y=y+x? >>>>> >>>>> Not provable by any means what-so-ever and true is impossible. >>>> >>>> You keep dodging this question. You decided that an "expression of >>>> language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. >>>> By your definition, the one you keep banging on about again and again >>>> and again, x+y=y+x must be incorrect. What is incorrect about it? >>> >>> My revised claim is that if an expression of language representing the >>> commutative property of addition can be expressed in a formal system >>> yet neither proved not disproven in this formal system, then it is not >>> a proposition of this formal system. >> >> In other words you were wrong. And you repeated the "un-revised" claim >> again and again, banging on about it as people tried to point our how >> silly it was. But you can't say "I was wrong", and you certainly won't >> apologise for wasting everyone's time. > > Not exactly. Yes, exactly. > My original claim still applies with a narrower scope: No. Your original claim was about which sentences are to be called incorrect. Your "revised" claim does not label any sentences as incorrect. Your original was wrong and you don't have the guts to simply say so. Your revised claim is also wrong but for other reasons, and you won't have the guts to admit that either. > The original > author of this paragraph says that it applies to every formal system > that has Q as a subset. > > The first incompleteness theorem states that in any consistent formal > system F within which a certain amount of arithmetic can be carried > out, there are statements of the language of F which can neither be > proved nor disproved in F This author does not call these sentences "incorrect" and nor does he or she support your silly notion that they are not "in" the formal system. > https://plato.stanford.edu/entries/goedel-incompleteness/ > > The only way that an expression of language is neither provable nor > disprovable in any formal system of Q or greater is if the expression > of language is incorrect. This is very badly worded, but it seems to say that you still claim that x+y=y+x is incorrect. If so, then answer the question you've tried so hard to dodge: in what way is it incorrect? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-19 21:43 -0500 |
| Message-ID | <DNudnSC4It1d0xPCnZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #24034 |
On 10/19/2020 8:56 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/19/2020 7:53 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/19/2020 3:29 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> <cut> >>>>>>>> Undecidable propositions are only undecidable because they are >>>>>>>> incorrect. >>>>>>> >>>>>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>>>>>> >>>>>>> What is incorrect about x+y=y+x? >>>>>> >>>>>> Not provable by any means what-so-ever and true is impossible. >>>>> >>>>> You keep dodging this question. You decided that an "expression of >>>>> language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. >>>>> By your definition, the one you keep banging on about again and again >>>>> and again, x+y=y+x must be incorrect. What is incorrect about it? >>>> >>>> My revised claim is that if an expression of language representing the >>>> commutative property of addition can be expressed in a formal system >>>> yet neither proved not disproven in this formal system, then it is not >>>> a proposition of this formal system. >>> >>> In other words you were wrong. And you repeated the "un-revised" claim >>> again and again, banging on about it as people tried to point our how >>> silly it was. But you can't say "I was wrong", and you certainly won't >>> apologise for wasting everyone's time. >> >> Not exactly. > > Yes, exactly. > >> My original claim still applies with a narrower scope: > > No. Your original claim was about which sentences are to be called > incorrect. Your "revised" claim does not label any sentences as > incorrect. Your original was wrong and you don't have the guts to > simply say so. Your revised claim is also wrong but for other reasons, > and you won't have the guts to admit that either. > >> The original >> author of this paragraph says that it applies to every formal system >> that has Q as a subset. >> >> The first incompleteness theorem states that in any consistent formal >> system F within which a certain amount of arithmetic can be carried >> out, there are statements of the language of F which can neither be >> proved nor disproved in F > > This author does not call these sentences "incorrect" and nor does he or > she support your silly notion that they are not "in" the formal system. > >> https://plato.stanford.edu/entries/goedel-incompleteness/ >> >> The only way that an expression of language is neither provable nor >> disprovable in any formal system of Q or greater is if the expression >> of language is incorrect. > > This is very badly worded, but it seems to say that you still claim that > x+y=y+x is incorrect. If so, then answer the question you've tried so > hard to dodge: in what way is it incorrect? > The formal system of the set of all knowledge currently known and can ever possibly be known includes Q. In other words Gödel's proof applies to an omniscient formal system. I call bullshit on this !!! -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-21 02:04 +0100 |
| Message-ID | <87ft68fkyu.fsf@bsb.me.uk> |
| In reply to | #24035 |
olcott <NoOne@NoWhere.com> writes: > On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/19/2020 7:53 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/19/2020 3:29 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> <cut> >>>>>>>>> Undecidable propositions are only undecidable because they are >>>>>>>>> incorrect. >>>>>>>> >>>>>>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>>>>>>> >>>>>>>> What is incorrect about x+y=y+x? >>>>>>> >>>>>>> Not provable by any means what-so-ever and true is impossible. >>>>>> >>>>>> You keep dodging this question. You decided that an "expression of >>>>>> language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. >>>>>> By your definition, the one you keep banging on about again and again >>>>>> and again, x+y=y+x must be incorrect. What is incorrect about it? >>>>> >>>>> My revised claim is that if an expression of language representing the >>>>> commutative property of addition can be expressed in a formal system >>>>> yet neither proved not disproven in this formal system, then it is not >>>>> a proposition of this formal system. >>>> >>>> In other words you were wrong. And you repeated the "un-revised" claim >>>> again and again, banging on about it as people tried to point our how >>>> silly it was. But you can't say "I was wrong", and you certainly won't >>>> apologise for wasting everyone's time. >>> >>> Not exactly. >> >> Yes, exactly. >> >>> My original claim still applies with a narrower scope: >> >> No. Your original claim was about which sentences are to be called >> incorrect. Your "revised" claim does not label any sentences as >> incorrect. Your original was wrong and you don't have the guts to >> simply say so. Your revised claim is also wrong but for other reasons, >> and you won't have the guts to admit that either. >> >>> The original >>> author of this paragraph says that it applies to every formal system >>> that has Q as a subset. >>> >>> The first incompleteness theorem states that in any consistent formal >>> system F within which a certain amount of arithmetic can be carried >>> out, there are statements of the language of F which can neither be >>> proved nor disproved in F >> >> This author does not call these sentences "incorrect" and nor does he or >> she support your silly notion that they are not "in" the formal system. >> >>> https://plato.stanford.edu/entries/goedel-incompleteness/ >>> >>> The only way that an expression of language is neither provable nor >>> disprovable in any formal system of Q or greater is if the expression >>> of language is incorrect. >> >> This is very badly worded, but it seems to say that you still claim that >> x+y=y+x is incorrect. If so, then answer the question you've tried so >> hard to dodge: in what way is it incorrect? > > The formal system of the set of all knowledge currently known and can > ever possibly be known includes Q. In other words Gödel's proof > applies to an omniscient formal system. No answer. What is incorrect about Q's x+y=y+x? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-20 20:22 -0500 |
| Message-ID | <-PmdnZELVLvaEBLCnZ2dnUU7-LnNnZ2d@giganews.com> |
| In reply to | #24047 |
On 10/20/2020 8:04 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/19/2020 7:53 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/19/2020 3:29 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> <cut> >>>>>>>>>> Undecidable propositions are only undecidable because they are >>>>>>>>>> incorrect. >>>>>>>>> >>>>>>>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) >>>>>>>>> >>>>>>>>> What is incorrect about x+y=y+x? >>>>>>>> >>>>>>>> Not provable by any means what-so-ever and true is impossible. >>>>>>> >>>>>>> You keep dodging this question. You decided that an "expression of >>>>>>> language" e of some formal system T is incorrect when T ⊬ e and T ⊬ ¬e. >>>>>>> By your definition, the one you keep banging on about again and again >>>>>>> and again, x+y=y+x must be incorrect. What is incorrect about it? >>>>>> >>>>>> My revised claim is that if an expression of language representing the >>>>>> commutative property of addition can be expressed in a formal system >>>>>> yet neither proved not disproven in this formal system, then it is not >>>>>> a proposition of this formal system. >>>>> >>>>> In other words you were wrong. And you repeated the "un-revised" claim >>>>> again and again, banging on about it as people tried to point our how >>>>> silly it was. But you can't say "I was wrong", and you certainly won't >>>>> apologise for wasting everyone's time. >>>> >>>> Not exactly. >>> >>> Yes, exactly. >>> >>>> My original claim still applies with a narrower scope: >>> >>> No. Your original claim was about which sentences are to be called >>> incorrect. Your "revised" claim does not label any sentences as >>> incorrect. Your original was wrong and you don't have the guts to >>> simply say so. Your revised claim is also wrong but for other reasons, >>> and you won't have the guts to admit that either. >>> >>>> The original >>>> author of this paragraph says that it applies to every formal system >>>> that has Q as a subset. >>>> >>>> The first incompleteness theorem states that in any consistent formal >>>> system F within which a certain amount of arithmetic can be carried >>>> out, there are statements of the language of F which can neither be >>>> proved nor disproved in F >>> >>> This author does not call these sentences "incorrect" and nor does he or >>> she support your silly notion that they are not "in" the formal system. >>> >>>> https://plato.stanford.edu/entries/goedel-incompleteness/ >>>> >>>> The only way that an expression of language is neither provable nor >>>> disprovable in any formal system of Q or greater is if the expression >>>> of language is incorrect. >>> >>> This is very badly worded, but it seems to say that you still claim that >>> x+y=y+x is incorrect. If so, then answer the question you've tried so >>> hard to dodge: in what way is it incorrect? >> >> The formal system of the set of all knowledge currently known and can >> ever possibly be known includes Q. In other words Gödel's proof >> applies to an omniscient formal system. > > No answer. What is incorrect about Q's x+y=y+x? > Your dishonest dodge is noted. Apparently if your goal is to "win an argument" and when you know that you are incorrect then the only tactic available is dishonest dodges. The commutative property of addition is provable in some formal systems therefore it is not erroneous. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. https://plato.stanford.edu/entries/goedel-incompleteness/ G is not provable or disprovable in every formal system what-so-ever that has Q as a subset: ∀F (F ∈ Formal_Systems & Q ⊆ F) → ∃G ∈ L(F) (G ↔ ~(F ⊢ G)) This above expression was written by the author of the above SEP article. Therefore G is erroneous. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-21 03:13 +0100 |
| Message-ID | <XYOdnSTqAZmoBBLCnZ2dnUU78YXNnZ2d@brightview.co.uk> |
| In reply to | #24048 |
On 21/10/2020 02:22, olcott wrote:
> On 10/20/2020 8:04 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 10/19/2020 7:53 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 10/19/2020 3:29 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 10/18/2020 7:17 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>> <cut>
>>>>>>>>>>> Undecidable propositions are only undecidable because they are
>>>>>>>>>>> incorrect.
>>>>>>>>>>
>>>>>>>>>> Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x)
>>>>>>>>>>
>>>>>>>>>> What is incorrect about x+y=y+x?
>>>>>>>>>
>>>>>>>>> Not provable by any means what-so-ever and true is impossible.
>>>>>>>>
>>>>>>>> You keep dodging this question. You decided that an "expression of
>>>>>>>> language" e of some formal system T is incorrect when T ⊬ e and
>>>>>>>> T ⊬ ¬e.
>>>>>>>> By your definition, the one you keep banging on about again and
>>>>>>>> again
>>>>>>>> and again, x+y=y+x must be incorrect. What is incorrect about it?
>>>>>>>
>>>>>>> My revised claim is that if an expression of language
>>>>>>> representing the
>>>>>>> commutative property of addition can be expressed in a formal system
>>>>>>> yet neither proved not disproven in this formal system, then it
>>>>>>> is not
>>>>>>> a proposition of this formal system.
>>>>>>
>>>>>> In other words you were wrong. And you repeated the "un-revised"
>>>>>> claim
>>>>>> again and again, banging on about it as people tried to point our how
>>>>>> silly it was. But you can't say "I was wrong", and you certainly
>>>>>> won't
>>>>>> apologise for wasting everyone's time.
>>>>>
>>>>> Not exactly.
>>>>
>>>> Yes, exactly.
>>>>
>>>>> My original claim still applies with a narrower scope:
>>>>
>>>> No. Your original claim was about which sentences are to be called
>>>> incorrect. Your "revised" claim does not label any sentences as
>>>> incorrect. Your original was wrong and you don't have the guts to
>>>> simply say so. Your revised claim is also wrong but for other reasons,
>>>> and you won't have the guts to admit that either.
>>>>
>>>>> The original
>>>>> author of this paragraph says that it applies to every formal system
>>>>> that has Q as a subset.
>>>>>
>>>>> The first incompleteness theorem states that in any consistent formal
>>>>> system F within which a certain amount of arithmetic can be carried
>>>>> out, there are statements of the language of F which can neither be
>>>>> proved nor disproved in F
>>>>
>>>> This author does not call these sentences "incorrect" and nor does
>>>> he or
>>>> she support your silly notion that they are not "in" the formal system.
>>>>
>>>>> https://plato.stanford.edu/entries/goedel-incompleteness/
>>>>>
>>>>> The only way that an expression of language is neither provable nor
>>>>> disprovable in any formal system of Q or greater is if the expression
>>>>> of language is incorrect.
>>>>
>>>> This is very badly worded, but it seems to say that you still claim
>>>> that
>>>> x+y=y+x is incorrect. If so, then answer the question you've tried so
>>>> hard to dodge: in what way is it incorrect?
>>>
>>> The formal system of the set of all knowledge currently known and can
>>> ever possibly be known includes Q. In other words Gödel's proof
>>> applies to an omniscient formal system.
>>
>> No answer. What is incorrect about Q's x+y=y+x?
>>
>
> Your dishonest dodge is noted. Apparently if your goal is to
> "win an argument" and when you know that you are incorrect then the only
> tactic available is dishonest dodges.
>
> The commutative property of addition is provable in some formal systems
> therefore it is not erroneous.
>
> The first incompleteness theorem states that in any consistent formal
> system F within which a certain amount of arithmetic can be carried out,
> there are statements of the language of F which can neither be proved
> nor disproved in F.
>
> https://plato.stanford.edu/entries/goedel-incompleteness/
>
> G is not provable or disprovable in every formal system what-so-ever
> that has Q as a subset:
This suggest you don't realise that G is not one fixed statement, but is
a different statement for each formal system. Let's write it as G(Q) so
you don't forget this.
So we have:
- x+y = y+x is not provable or disprovable in Q, but is
provable in some formal systems
- G(Q) is not provable or disprovable in Q, but is
provable in some formal systems
(Essentially no difference)
Your dumboness is noted, and it turns out that Ben was not being
dishonest after all! (...as usual)
>
> ∀F (F ∈ Formal_Systems & Q ⊆ F) → ∃G ∈ L(F) (G ↔ ~(F ⊢ G))
> This above expression was written by the author of the above SEP article.
>
> Therefore G is erroneous.
>
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-20 23:41 -0600 |
| Message-ID | <rmohlp$mkc$1@dont-email.me> |
| In reply to | #24048 |
On 2020-10-20 19:22, olcott wrote: > On 10/20/2020 8:04 PM, Ben Bacarisse wrote: <snip> >> No answer. What is incorrect about Q's x+y=y+x? >> > > Your dishonest dodge is noted. Apparently if your goal is to There's no dodge there. He is pointing out that you didn't answer the question, which you did not. > "win an argument" and when you know that you are incorrect then the only > tactic available is dishonest dodges. > > The commutative property of addition is provable in some formal systems > therefore it is not erroneous. > > The first incompleteness theorem states that in any consistent formal > system F within which a certain amount of arithmetic can be carried out, > there are statements of the language of F which can neither be proved > nor disproved in F. > > https://plato.stanford.edu/entries/goedel-incompleteness/ > > G is not provable or disprovable in every formal system what-so-ever > that has Q as a subset: > > ∀F (F ∈ Formal_Systems & Q ⊆ F) → ∃G ∈ L(F) (G ↔ ~(F ⊢ G)) > This above expression was written by the author of the above SEP article. That wasn't written by the author. It was written by you and corrected by the author, but retaining your weird notations. But this doesn't correspond to your English statement above, which would be written as follows (again retaining your weird notations). ∃G ∀F (F ∈ Formal_Systems & Q ⊆ F) → (G ↔ ~(F ⊢ G)) Gödel's Theorem doesn't state that at all. > Therefore G is erroneous. Even if Gödel's Theorem did state what you claim it states, you still provide no explanation of *why* G would be erroneous. You merely state that it is. Your 'therefore' is completely unwarranted. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-21 14:25 +0100 |
| Message-ID | <874kmng18p.fsf@bsb.me.uk> |
| In reply to | #24048 |
olcott <NoOne@NoWhere.com> writes: > On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: <cut> >>>>> The only way that an expression of language is neither provable nor >>>>> disprovable in any formal system of Q or greater is if the expression >>>>> of language is incorrect. >>>> >>>> This is very badly worded, but it seems to say that you still claim that >>>> x+y=y+x is incorrect. If so, then answer the question you've tried so >>>> hard to dodge: in what way is it incorrect? >>> >>> The formal system of the set of all knowledge currently known and can >>> ever possibly be known includes Q. In other words Gödel's proof >>> applies to an omniscient formal system. >> >> No answer. What is incorrect about Q's x+y=y+x? > > Your dishonest dodge is noted. Apparently if your goal is to "win an > argument" and when you know that you are incorrect then the only > tactic available is dishonest dodges. My goal is to get you to answer the question. What is incorrect about Q's x+y=y+x? Either explain what is incorrect about this perfectly sensible "expression of the language of Q" or confirm that you no longer stand by the definition you gave: | An expression φ of the language of theory T is incorrect if and only | if (T ⊬ φ) and (T ⊬ ¬φ). You could not have been clearer: Q's x+y=y+x is incorrect. > The commutative property of addition is provable in some formal > systems therefore it is not erroneous. You are trying to wriggle out of what you said. x+y=y+x is an expression of the language of Q. According to you, it is incorrect if (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case. Answer the question or retract the definition. As always, you have said some new incorrect things that, were I to address them, could derail the discussion. I'd like clear one simple point once and for all. You should approve, after all, of what you call a laser-like focus on a topic. <cut> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 08:13 -0600 |
| Message-ID | <rmpfm5$q5s$1@dont-email.me> |
| In reply to | #24055 |
On 2020-10-21 07:25, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: > <cut> >>>>>> The only way that an expression of language is neither provable nor >>>>>> disprovable in any formal system of Q or greater is if the expression >>>>>> of language is incorrect. >>>>> >>>>> This is very badly worded, but it seems to say that you still claim that >>>>> x+y=y+x is incorrect. If so, then answer the question you've tried so >>>>> hard to dodge: in what way is it incorrect? >>>> >>>> The formal system of the set of all knowledge currently known and can >>>> ever possibly be known includes Q. In other words Gödel's proof >>>> applies to an omniscient formal system. >>> >>> No answer. What is incorrect about Q's x+y=y+x? >> >> Your dishonest dodge is noted. Apparently if your goal is to "win an >> argument" and when you know that you are incorrect then the only >> tactic available is dishonest dodges. > > My goal is to get you to answer the question. What is incorrect about > Q's x+y=y+x? Either explain what is incorrect about this perfectly > sensible "expression of the language of Q" or confirm that you no longer > stand by the definition you gave: > > | An expression φ of the language of theory T is incorrect if and only > | if (T ⊬ φ) and (T ⊬ ¬φ). > > You could not have been clearer: Q's x+y=y+x is incorrect. > >> The commutative property of addition is provable in some formal >> systems therefore it is not erroneous. > > You are trying to wriggle out of what you said. x+y=y+x is an > expression of the language of Q. According to you, it is incorrect if > (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case. > > Answer the question or retract the definition. > > As always, you have said some new incorrect things that, were I to > address them, could derail the discussion. I'd like clear one simple > point once and for all. You should approve, after all, of what you call > a laser-like focus on a topic. Rereading some of his posts and trying to get through his convoluted grammar, it actually appears he did provide an answer, but, as you suspected it was some entirely new wrong thing. Propositions which are not provable or disprovable in "any system what-so-ever" are incorrect. Propositions which are not provable or disprovable in system F but which are provable or disprovable in *some* system, aren't incorrect, they're just not propositions of F. So apparently, to determine whether some proposition is 'incorrect' as opposed to simply being 'not a proposition', you must not only determine whether it is provable in the system under consideration, but also in every other possible system. So if Q is able to somehow determine that x + y = y + x is provable in PA (don't ask how it does this), then it gets to be a not-a-proposition of Q. But if Q can't identify any system in the whole universe in which it is provable, then it gets to be an 'incorrect' proposition. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 10:16 -0500 |
| Message-ID | <qoOdnRFSfpZYzQ3CnZ2dnUU7-c_NnZ2d@giganews.com> |
| In reply to | #24057 |
On 10/21/2020 9:13 AM, André G. Isaak wrote: > On 2020-10-21 07:25, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >> <cut> >>>>>>> The only way that an expression of language is neither provable nor >>>>>>> disprovable in any formal system of Q or greater is if the >>>>>>> expression >>>>>>> of language is incorrect. >>>>>> >>>>>> This is very badly worded, but it seems to say that you still >>>>>> claim that >>>>>> x+y=y+x is incorrect. If so, then answer the question you've >>>>>> tried so >>>>>> hard to dodge: in what way is it incorrect? >>>>> >>>>> The formal system of the set of all knowledge currently known and can >>>>> ever possibly be known includes Q. In other words Gödel's proof >>>>> applies to an omniscient formal system. >>>> >>>> No answer. What is incorrect about Q's x+y=y+x? >>> >>> Your dishonest dodge is noted. Apparently if your goal is to "win an >>> argument" and when you know that you are incorrect then the only >>> tactic available is dishonest dodges. >> >> My goal is to get you to answer the question. What is incorrect about >> Q's x+y=y+x? Either explain what is incorrect about this perfectly >> sensible "expression of the language of Q" or confirm that you no longer >> stand by the definition you gave: >> >> | An expression φ of the language of theory T is incorrect if and only >> | if (T ⊬ φ) and (T ⊬ ¬φ). >> >> You could not have been clearer: Q's x+y=y+x is incorrect. >> >>> The commutative property of addition is provable in some formal >>> systems therefore it is not erroneous. >> >> You are trying to wriggle out of what you said. x+y=y+x is an >> expression of the language of Q. According to you, it is incorrect if >> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case. >> >> Answer the question or retract the definition. >> >> As always, you have said some new incorrect things that, were I to >> address them, could derail the discussion. I'd like clear one simple >> point once and for all. You should approve, after all, of what you call >> a laser-like focus on a topic. > > Rereading some of his posts and trying to get through his convoluted > grammar, it actually appears he did provide an answer, but, as you > suspected it was some entirely new wrong thing. > > Propositions which are not provable or disprovable in "any system > what-so-ever" are incorrect. > > Propositions which are not provable or disprovable in system F but which > are provable or disprovable in *some* system, aren't incorrect, they're > just not propositions of F. > > So apparently, to determine whether some proposition is 'incorrect' as > opposed to simply being 'not a proposition', you must not only determine > whether it is provable in the system under consideration, but also in > every other possible system. This part is correct. > So if Q is able to somehow determine that x > + y = y + x is provable in PA (don't ask how it does this), then it gets > to be a not-a-proposition of Q. But if Q can't identify any system in > the whole universe in which it is provable, then it gets to be an > 'incorrect' proposition. > > André > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 09:40 -0600 |
| Message-ID | <rmpkq2$16a$1@dont-email.me> |
| In reply to | #24058 |
On 2020-10-21 09:16, olcott wrote: > On 10/21/2020 9:13 AM, André G. Isaak wrote: >> On 2020-10-21 07:25, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>> <cut> >>>>>>>> The only way that an expression of language is neither provable nor >>>>>>>> disprovable in any formal system of Q or greater is if the >>>>>>>> expression >>>>>>>> of language is incorrect. >>>>>>> >>>>>>> This is very badly worded, but it seems to say that you still >>>>>>> claim that >>>>>>> x+y=y+x is incorrect. If so, then answer the question you've >>>>>>> tried so >>>>>>> hard to dodge: in what way is it incorrect? >>>>>> >>>>>> The formal system of the set of all knowledge currently known and can >>>>>> ever possibly be known includes Q. In other words Gödel's proof >>>>>> applies to an omniscient formal system. >>>>> >>>>> No answer. What is incorrect about Q's x+y=y+x? >>>> >>>> Your dishonest dodge is noted. Apparently if your goal is to "win an >>>> argument" and when you know that you are incorrect then the only >>>> tactic available is dishonest dodges. >>> >>> My goal is to get you to answer the question. What is incorrect about >>> Q's x+y=y+x? Either explain what is incorrect about this perfectly >>> sensible "expression of the language of Q" or confirm that you no longer >>> stand by the definition you gave: >>> >>> | An expression φ of the language of theory T is incorrect if and only >>> | if (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> You could not have been clearer: Q's x+y=y+x is incorrect. >>> >>>> The commutative property of addition is provable in some formal >>>> systems therefore it is not erroneous. >>> >>> You are trying to wriggle out of what you said. x+y=y+x is an >>> expression of the language of Q. According to you, it is incorrect if >>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case. >>> >>> Answer the question or retract the definition. >>> >>> As always, you have said some new incorrect things that, were I to >>> address them, could derail the discussion. I'd like clear one simple >>> point once and for all. You should approve, after all, of what you call >>> a laser-like focus on a topic. >> >> Rereading some of his posts and trying to get through his convoluted >> grammar, it actually appears he did provide an answer, but, as you >> suspected it was some entirely new wrong thing. >> >> Propositions which are not provable or disprovable in "any system >> what-so-ever" are incorrect. >> > >> Propositions which are not provable or disprovable in system F but >> which are provable or disprovable in *some* system, aren't incorrect, >> they're just not propositions of F. >> >> So apparently, to determine whether some proposition is 'incorrect' as >> opposed to simply being 'not a proposition', you must not only >> determine whether it is provable in the system under consideration, >> but also in every other possible system. > > This part is correct. So how exactly is that supposed to work? When we determine that x + y = y + x is not provable within Q (i.e. using only the rules of inference and axioms of Q), how are we supposed to determine *within Q* that it might be provable in some other formal system given that Q has no knowledge of the axioms or rules of inference of any system other than Q? Also, you still seem to not grasp why x + y = y + x is provable in PA but not in Q. In every model of PA, x + y = y + x *is* true. In Q, however, this is not the case. There are models of Q in which x + y = y + x is *not* true. The fact that this statement is provably true in PA does not entail that it is true in Q, and the fact that it is provable in PA should have absolutely no bearing on its status in Q. André >> So if Q is able to somehow determine that x + y = y + x is provable in >> PA (don't ask how it does this), then it gets to be a >> not-a-proposition of Q. But if Q can't identify any system in the >> whole universe in which it is provable, then it gets to be an >> 'incorrect' proposition. >> >> André >> > > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 11:57 -0500 |
| Message-ID | <546dnT-tjeQN9Q3CnZ2dnUU7-LfNnZ2d@giganews.com> |
| In reply to | #24060 |
On 10/21/2020 10:40 AM, André G. Isaak wrote: > On 2020-10-21 09:16, olcott wrote: >> On 10/21/2020 9:13 AM, André G. Isaak wrote: >>> On 2020-10-21 07:25, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>> <cut> >>>>>>>>> The only way that an expression of language is neither provable >>>>>>>>> nor >>>>>>>>> disprovable in any formal system of Q or greater is if the >>>>>>>>> expression >>>>>>>>> of language is incorrect. >>>>>>>> >>>>>>>> This is very badly worded, but it seems to say that you still >>>>>>>> claim that >>>>>>>> x+y=y+x is incorrect. If so, then answer the question you've >>>>>>>> tried so >>>>>>>> hard to dodge: in what way is it incorrect? >>>>>>> >>>>>>> The formal system of the set of all knowledge currently known and >>>>>>> can >>>>>>> ever possibly be known includes Q. In other words Gödel's proof >>>>>>> applies to an omniscient formal system. >>>>>> >>>>>> No answer. What is incorrect about Q's x+y=y+x? >>>>> >>>>> Your dishonest dodge is noted. Apparently if your goal is to "win an >>>>> argument" and when you know that you are incorrect then the only >>>>> tactic available is dishonest dodges. >>>> >>>> My goal is to get you to answer the question. What is incorrect about >>>> Q's x+y=y+x? Either explain what is incorrect about this perfectly >>>> sensible "expression of the language of Q" or confirm that you no >>>> longer >>>> stand by the definition you gave: >>>> >>>> | An expression φ of the language of theory T is incorrect if and only >>>> | if (T ⊬ φ) and (T ⊬ ¬φ). >>>> >>>> You could not have been clearer: Q's x+y=y+x is incorrect. >>>> >>>>> The commutative property of addition is provable in some formal >>>>> systems therefore it is not erroneous. >>>> >>>> You are trying to wriggle out of what you said. x+y=y+x is an >>>> expression of the language of Q. According to you, it is incorrect if >>>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case. >>>> >>>> Answer the question or retract the definition. >>>> >>>> As always, you have said some new incorrect things that, were I to >>>> address them, could derail the discussion. I'd like clear one simple >>>> point once and for all. You should approve, after all, of what you >>>> call >>>> a laser-like focus on a topic. >>> >>> Rereading some of his posts and trying to get through his convoluted >>> grammar, it actually appears he did provide an answer, but, as you >>> suspected it was some entirely new wrong thing. >>> >>> Propositions which are not provable or disprovable in "any system >>> what-so-ever" are incorrect. >>> >> >>> Propositions which are not provable or disprovable in system F but >>> which are provable or disprovable in *some* system, aren't incorrect, >>> they're just not propositions of F. >>> >>> So apparently, to determine whether some proposition is 'incorrect' >>> as opposed to simply being 'not a proposition', you must not only >>> determine whether it is provable in the system under consideration, >>> but also in every other possible system. >> >> This part is correct. > > So how exactly is that supposed to work? > > When we determine that x + y = y + x is not provable within Q (i.e. > using only the rules of inference and axioms of Q), how are we supposed > to determine *within Q* that it might be provable in some other formal > system given that Q has no knowledge of the axioms or rules of inference > of any system other than Q? > That is the part that you got totally incorrectly. We as humans know that the commutative property of addition is provable in some formal system (PA?) We as humans know that it is not provable in Q. Unless and until we as humans create an automated proof generator of sufficient power (maybe this has already been done in this case?) determining the provability of an expression of language within a formal system will remain a "we as humans" thing. > Also, you still seem to not grasp why x + y = y + x is provable in PA > but not in Q. In every model of PA, x + y = y + x *is* true. In Q, > however, this is not the case. There are models of Q in which x + y = y > + x is *not* true. > The fact that this statement is provably true in PA > does not entail that it is true in Q, and the fact that it is provable > in PA should have absolutely no bearing on its status in Q. That is really great that we agree on something as important as this. We have progressed from rebuttals and defending against rebuttals to actual mutual understanding. That makes me happy. > > André > >>> So if Q is able to somehow determine that x + y = y + x is provable >>> in PA (don't ask how it does this), then it gets to be a >>> not-a-proposition of Q. But if Q can't identify any system in the >>> whole universe in which it is provable, then it gets to be an >>> 'incorrect' proposition. >>> >>> André >>> >> >> > > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 11:25 -0600 |
| Message-ID | <rmpqtv$es1$1@dont-email.me> |
| In reply to | #24064 |
On 2020-10-21 10:57, olcott wrote: > On 10/21/2020 10:40 AM, André G. Isaak wrote: >> On 2020-10-21 09:16, olcott wrote: >>> On 10/21/2020 9:13 AM, André G. Isaak wrote: >>>> On 2020-10-21 07:25, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>> <cut> >>>>>>>>>> The only way that an expression of language is neither >>>>>>>>>> provable nor >>>>>>>>>> disprovable in any formal system of Q or greater is if the >>>>>>>>>> expression >>>>>>>>>> of language is incorrect. >>>>>>>>> >>>>>>>>> This is very badly worded, but it seems to say that you still >>>>>>>>> claim that >>>>>>>>> x+y=y+x is incorrect. If so, then answer the question you've >>>>>>>>> tried so >>>>>>>>> hard to dodge: in what way is it incorrect? >>>>>>>> >>>>>>>> The formal system of the set of all knowledge currently known >>>>>>>> and can >>>>>>>> ever possibly be known includes Q. In other words Gödel's proof >>>>>>>> applies to an omniscient formal system. >>>>>>> >>>>>>> No answer. What is incorrect about Q's x+y=y+x? >>>>>> >>>>>> Your dishonest dodge is noted. Apparently if your goal is to "win an >>>>>> argument" and when you know that you are incorrect then the only >>>>>> tactic available is dishonest dodges. >>>>> >>>>> My goal is to get you to answer the question. What is incorrect about >>>>> Q's x+y=y+x? Either explain what is incorrect about this perfectly >>>>> sensible "expression of the language of Q" or confirm that you no >>>>> longer >>>>> stand by the definition you gave: >>>>> >>>>> | An expression φ of the language of theory T is incorrect if and only >>>>> | if (T ⊬ φ) and (T ⊬ ¬φ). >>>>> >>>>> You could not have been clearer: Q's x+y=y+x is incorrect. >>>>> >>>>>> The commutative property of addition is provable in some formal >>>>>> systems therefore it is not erroneous. >>>>> >>>>> You are trying to wriggle out of what you said. x+y=y+x is an >>>>> expression of the language of Q. According to you, it is incorrect if >>>>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case. >>>>> >>>>> Answer the question or retract the definition. >>>>> >>>>> As always, you have said some new incorrect things that, were I to >>>>> address them, could derail the discussion. I'd like clear one simple >>>>> point once and for all. You should approve, after all, of what you >>>>> call >>>>> a laser-like focus on a topic. >>>> >>>> Rereading some of his posts and trying to get through his convoluted >>>> grammar, it actually appears he did provide an answer, but, as you >>>> suspected it was some entirely new wrong thing. >>>> >>>> Propositions which are not provable or disprovable in "any system >>>> what-so-ever" are incorrect. >>>> >>> >>>> Propositions which are not provable or disprovable in system F but >>>> which are provable or disprovable in *some* system, aren't >>>> incorrect, they're just not propositions of F. >>>> >>>> So apparently, to determine whether some proposition is 'incorrect' >>>> as opposed to simply being 'not a proposition', you must not only >>>> determine whether it is provable in the system under consideration, >>>> but also in every other possible system. >>> >>> This part is correct. >> >> So how exactly is that supposed to work? >> >> When we determine that x + y = y + x is not provable within Q (i.e. >> using only the rules of inference and axioms of Q), how are we >> supposed to determine *within Q* that it might be provable in some >> other formal system given that Q has no knowledge of the axioms or >> rules of inference of any system other than Q? >> > > That is the part that you got totally incorrectly. We as humans know > that the commutative property of addition is provable in some formal > system (PA?) We as humans know that it is not provable in Q. What we as humans may or may not know should be entirely irrelevant. A formal system is purely mechanical, and claims about whether a particular statement is or isn't a proposition of a given system must be something which that system can determine in a purely mechanical manner. So if you claim that "x + y = y + x" is not a proposition of Q, the rules of Q must be able to tell us that, just as they must be able to tell us whether something in Q is 'incorrect'. And you still haven't provided any explanation for *why* a statement which cannot be proven or disproven in a particular system shouldn't count as a proposition in that system. x + y = y + x is produced by the grammar of Q and it is perfectly clear what it means. There is no reason why it should be excluded. And if someone were to demonstrate that there is some proposition which is not provable in *any* formal system, you have similarly provided no explanation for why such a proposition should be considered 'incorrect'. This last point is moot, though, since Ben already provided a reason to believe no such proposition can exist. We can simply create a formal system containing that proposition as its only axiom. So there are no 'incorrect' statements. > Unless and until we as humans create an automated proof generator of > sufficient power (maybe this has already been done in this case?) > determining the provability of an expression of language within a formal > system will remain a "we as humans" thing. > >> Also, you still seem to not grasp why x + y = y + x is provable in PA >> but not in Q. In every model of PA, x + y = y + x *is* true. In Q, >> however, this is not the case. There are models of Q in which x + y = >> y + x is *not* true. > >> The fact that this statement is provably true in PA does not entail >> that it is true in Q, and the fact that it is provable in PA should >> have absolutely no bearing on its status in Q. > > That is really great that we agree on something as important as this. > We have progressed from rebuttals and defending against rebuttals to > actual mutual understanding. That makes me happy. Except we don't seem to be in agreement. As I stated, the fact that x + y = y + x is provable in PA has no bearing on its status in Q. You seem to believe otherwise since you assert that the fact that it is provable in PA is what makes it a 'non-proposition' of Q rather than an 'incorrect proposition' of Q. That seems to be a rather large disagreement. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 13:00 -0500 |
| Message-ID | <xdydnS4M1Zy76g3CnZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #24066 |
On 10/21/2020 12:25 PM, André G. Isaak wrote:
> On 2020-10-21 10:57, olcott wrote:
>> On 10/21/2020 10:40 AM, André G. Isaak wrote:
>>> On 2020-10-21 09:16, olcott wrote:
>>>> On 10/21/2020 9:13 AM, André G. Isaak wrote:
>>>>> On 2020-10-21 07:25, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>> <cut>
>>>>>>>>>>> The only way that an expression of language is neither
>>>>>>>>>>> provable nor
>>>>>>>>>>> disprovable in any formal system of Q or greater is if the
>>>>>>>>>>> expression
>>>>>>>>>>> of language is incorrect.
>>>>>>>>>>
>>>>>>>>>> This is very badly worded, but it seems to say that you still
>>>>>>>>>> claim that
>>>>>>>>>> x+y=y+x is incorrect. If so, then answer the question you've
>>>>>>>>>> tried so
>>>>>>>>>> hard to dodge: in what way is it incorrect?
>>>>>>>>>
>>>>>>>>> The formal system of the set of all knowledge currently known
>>>>>>>>> and can
>>>>>>>>> ever possibly be known includes Q. In other words Gödel's proof
>>>>>>>>> applies to an omniscient formal system.
>>>>>>>>
>>>>>>>> No answer. What is incorrect about Q's x+y=y+x?
>>>>>>>
>>>>>>> Your dishonest dodge is noted. Apparently if your goal is to "win an
>>>>>>> argument" and when you know that you are incorrect then the only
>>>>>>> tactic available is dishonest dodges.
>>>>>>
>>>>>> My goal is to get you to answer the question. What is incorrect
>>>>>> about
>>>>>> Q's x+y=y+x? Either explain what is incorrect about this perfectly
>>>>>> sensible "expression of the language of Q" or confirm that you no
>>>>>> longer
>>>>>> stand by the definition you gave:
>>>>>>
>>>>>> | An expression φ of the language of theory T is incorrect if and
>>>>>> only
>>>>>> | if (T ⊬ φ) and (T ⊬ ¬φ).
>>>>>>
>>>>>> You could not have been clearer: Q's x+y=y+x is incorrect.
>>>>>>
>>>>>>> The commutative property of addition is provable in some formal
>>>>>>> systems therefore it is not erroneous.
>>>>>>
>>>>>> You are trying to wriggle out of what you said. x+y=y+x is an
>>>>>> expression of the language of Q. According to you, it is
>>>>>> incorrect if
>>>>>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the
>>>>>> case.
>>>>>>
>>>>>> Answer the question or retract the definition.
>>>>>>
>>>>>> As always, you have said some new incorrect things that, were I to
>>>>>> address them, could derail the discussion. I'd like clear one simple
>>>>>> point once and for all. You should approve, after all, of what
>>>>>> you call
>>>>>> a laser-like focus on a topic.
>>>>>
>>>>> Rereading some of his posts and trying to get through his
>>>>> convoluted grammar, it actually appears he did provide an answer,
>>>>> but, as you suspected it was some entirely new wrong thing.
>>>>>
>>>>> Propositions which are not provable or disprovable in "any system
>>>>> what-so-ever" are incorrect.
>>>>>
>>>>
>>>>> Propositions which are not provable or disprovable in system F but
>>>>> which are provable or disprovable in *some* system, aren't
>>>>> incorrect, they're just not propositions of F.
>>>>>
>>>>> So apparently, to determine whether some proposition is 'incorrect'
>>>>> as opposed to simply being 'not a proposition', you must not only
>>>>> determine whether it is provable in the system under consideration,
>>>>> but also in every other possible system.
>>>>
>>>> This part is correct.
>>>
>>> So how exactly is that supposed to work?
>>>
>>> When we determine that x + y = y + x is not provable within Q (i.e.
>>> using only the rules of inference and axioms of Q), how are we
>>> supposed to determine *within Q* that it might be provable in some
>>> other formal system given that Q has no knowledge of the axioms or
>>> rules of inference of any system other than Q?
>>>
>>
>> That is the part that you got totally incorrectly. We as humans know
>> that the commutative property of addition is provable in some formal
>> system (PA?) We as humans know that it is not provable in Q.
>
> What we as humans may or may not know should be entirely irrelevant. A
> formal system is purely mechanical, and claims about whether a
> particular statement is or isn't a proposition of a given system must be
> something which that system can determine in a purely mechanical manner.
>
Yes but math by itself when it has not been converted into computer
science merely sits there on the page of paper, or resides in a file as
a sequence of bytes. Until it is processed by an physical mind or
physical hardware math is static.
> So if you claim that "x + y = y + x" is not a proposition of Q, the
> rules of Q must be able to tell us that, just as they must be able to
> tell us whether something in Q is 'incorrect'.
>
A theory T is incomplete if and only if there is some sentence φ such
that (T ⊬ φ) and (T ⊬ ¬φ).
From what I recall, it is conventionally understood that we need an at
least slightly higher level of meta-mathematics to decide provability.
It is conventionally understood that no formal system has a provability
operator: "⊢".
> And you still haven't provided any explanation for *why* a statement
> which cannot be proven or disproven in a particular system shouldn't
> count as a proposition in that system.
Every expression of language of every formal system must be a truth
bearer because formal logic systems are Boolean.
> x + y = y + x is produced by the
> grammar of Q and it is perfectly clear what it means. There is no reason
> why it should be excluded.
>
It is not a truth bearer in Q.
> And if someone were to demonstrate that there is some proposition which
> is not provable in *any* formal system, you have similarly provided no
> explanation for why such a proposition should be considered 'incorrect'.
>
That you say that I have never done something that I have done several
times seems so disingenuous as to be dishonest:
Here Tarski refers to the Liar Paradox (From Theorem I)
It would then be possible to reconstruct the antinomy
of the liar in the metalanguage, by forming in the language
itself a sentence x such that the sentence of the metalanguage
which is correlated with x asserts that x is not a true sentence. I
http://www.liarparadox.org/247_248.pdf
Here uses the Liar Paradox as his basis for the first step of his proof.
In accordance with the first
part of Theorem I we can obtain the negation of one of the sentences
in condition (α) of convention T of § 3 as a consequence of the
definition of the symbol 'Pr' (provided we replace 'Tr' in this
convention by 'Pr'). In other words we can construct a sentence
x of the science in question which satisfies the following
condition:
it is not true that x ∈ Pr if and only if p
or in equivalent formulation:
(1) x ∉ Pr if and only if p (x ∉ Pr ↔ p)
where the symbol 'p' represents the whole sentence x
therefore a more correct way of formalizing (1) would be
(1) x ∉ Pr if and only if x (x ∉ Pr ↔ x)
when we revert this back to its original form
(not swapping "Tr" with "Pr") we get the Liar Paradox
(1) x ∉ Tr if and only if x (x ∉ Tr ↔ x)
x is not true if and only if x is true
http://www.liarparadox.org/Tarski_Proof_275_276.pdf
> This last point is moot, though, since Ben already provided a reason to
> believe no such proposition can exist. We can simply create a formal
> system containing that proposition as its only axiom. So there are no
> 'incorrect' statements.
>
It is shown above that Tarski used such a statement as the basis of his
whole Undefinability proof.
>> Unless and until we as humans create an automated proof generator of
>> sufficient power (maybe this has already been done in this case?)
>> determining the provability of an expression of language within a
>> formal system will remain a "we as humans" thing.
>>
>>> Also, you still seem to not grasp why x + y = y + x is provable in PA
>>> but not in Q. In every model of PA, x + y = y + x *is* true. In Q,
>>> however, this is not the case. There are models of Q in which x + y =
>>> y + x is *not* true.
>>
>>> The fact that this statement is provably true in PA does not entail
>>> that it is true in Q, and the fact that it is provable in PA should
>>> have absolutely no bearing on its status in Q.
>>
>> That is really great that we agree on something as important as this.
>> We have progressed from rebuttals and defending against rebuttals to
>> actual mutual understanding. That makes me happy.
>
> Except we don't seem to be in agreement. As I stated, the fact that x +
> y = y + x is provable in PA has no bearing on its status in Q.
Yes that is correct. It is only the fact that the commutative property
of addition (CPOA) is neither provable nor disprovable in Q that
determines its status in Q. The fact that that (CPOA) is provable in PA
proves that it is not erroneous.
> You seem
> to believe otherwise since you assert that the fact that it is provable
> in PA is what makes it a 'non-proposition' of Q rather than an
> 'incorrect proposition' of Q. That seems to be a rather large disagreement.
>
> André
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 12:29 -0600 |
| Message-ID | <rmpuln$ahg$1@dont-email.me> |
| In reply to | #24068 |
On 2020-10-21 12:00, olcott wrote: > On 10/21/2020 12:25 PM, André G. Isaak wrote: >> On 2020-10-21 10:57, olcott wrote: >>> On 10/21/2020 10:40 AM, André G. Isaak wrote: >>>> On 2020-10-21 09:16, olcott wrote: >>>>> On 10/21/2020 9:13 AM, André G. Isaak wrote: >>>>>> On 2020-10-21 07:25, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> <cut> >>>>>>>>>>>> The only way that an expression of language is neither >>>>>>>>>>>> provable nor >>>>>>>>>>>> disprovable in any formal system of Q or greater is if the >>>>>>>>>>>> expression >>>>>>>>>>>> of language is incorrect. >>>>>>>>>>> >>>>>>>>>>> This is very badly worded, but it seems to say that you still >>>>>>>>>>> claim that >>>>>>>>>>> x+y=y+x is incorrect. If so, then answer the question you've >>>>>>>>>>> tried so >>>>>>>>>>> hard to dodge: in what way is it incorrect? >>>>>>>>>> >>>>>>>>>> The formal system of the set of all knowledge currently known >>>>>>>>>> and can >>>>>>>>>> ever possibly be known includes Q. In other words Gödel's proof >>>>>>>>>> applies to an omniscient formal system. >>>>>>>>> >>>>>>>>> No answer. What is incorrect about Q's x+y=y+x? >>>>>>>> >>>>>>>> Your dishonest dodge is noted. Apparently if your goal is to >>>>>>>> "win an >>>>>>>> argument" and when you know that you are incorrect then the only >>>>>>>> tactic available is dishonest dodges. >>>>>>> >>>>>>> My goal is to get you to answer the question. What is incorrect >>>>>>> about >>>>>>> Q's x+y=y+x? Either explain what is incorrect about this perfectly >>>>>>> sensible "expression of the language of Q" or confirm that you no >>>>>>> longer >>>>>>> stand by the definition you gave: >>>>>>> >>>>>>> | An expression φ of the language of theory T is incorrect if and >>>>>>> only >>>>>>> | if (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>> >>>>>>> You could not have been clearer: Q's x+y=y+x is incorrect. >>>>>>> >>>>>>>> The commutative property of addition is provable in some formal >>>>>>>> systems therefore it is not erroneous. >>>>>>> >>>>>>> You are trying to wriggle out of what you said. x+y=y+x is an >>>>>>> expression of the language of Q. According to you, it is >>>>>>> incorrect if >>>>>>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the >>>>>>> case. >>>>>>> >>>>>>> Answer the question or retract the definition. >>>>>>> >>>>>>> As always, you have said some new incorrect things that, were I to >>>>>>> address them, could derail the discussion. I'd like clear one >>>>>>> simple >>>>>>> point once and for all. You should approve, after all, of what >>>>>>> you call >>>>>>> a laser-like focus on a topic. >>>>>> >>>>>> Rereading some of his posts and trying to get through his >>>>>> convoluted grammar, it actually appears he did provide an answer, >>>>>> but, as you suspected it was some entirely new wrong thing. >>>>>> >>>>>> Propositions which are not provable or disprovable in "any system >>>>>> what-so-ever" are incorrect. >>>>>> >>>>> >>>>>> Propositions which are not provable or disprovable in system F but >>>>>> which are provable or disprovable in *some* system, aren't >>>>>> incorrect, they're just not propositions of F. >>>>>> >>>>>> So apparently, to determine whether some proposition is >>>>>> 'incorrect' as opposed to simply being 'not a proposition', you >>>>>> must not only determine whether it is provable in the system under >>>>>> consideration, but also in every other possible system. >>>>> >>>>> This part is correct. >>>> >>>> So how exactly is that supposed to work? >>>> >>>> When we determine that x + y = y + x is not provable within Q (i.e. >>>> using only the rules of inference and axioms of Q), how are we >>>> supposed to determine *within Q* that it might be provable in some >>>> other formal system given that Q has no knowledge of the axioms or >>>> rules of inference of any system other than Q? >>>> >>> >>> That is the part that you got totally incorrectly. We as humans know >>> that the commutative property of addition is provable in some formal >>> system (PA?) We as humans know that it is not provable in Q. >> >> What we as humans may or may not know should be entirely irrelevant. A >> formal system is purely mechanical, and claims about whether a >> particular statement is or isn't a proposition of a given system must >> be something which that system can determine in a purely mechanical >> manner. >> > > Yes but math by itself when it has not been converted into computer > science merely sits there on the page of paper, or resides in a file as > a sequence of bytes. Until it is processed by an physical mind or > physical hardware math is static. > >> So if you claim that "x + y = y + x" is not a proposition of Q, the >> rules of Q must be able to tell us that, just as they must be able to >> tell us whether something in Q is 'incorrect'. >> > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > From what I recall, it is conventionally understood that we need an at > least slightly higher level of meta-mathematics to decide provability. > It is conventionally understood that no formal system has a provability > operator: "⊢". It is not possible, in general to prove that something is provable, either within the system, in some more powerful system, or by a human. Many cases can be shown to be provable within a system, potentially more cases in some more powerful system, but there is way to demonstrate provability or the lack thereof is all cases. >> And you still haven't provided any explanation for *why* a statement >> which cannot be proven or disproven in a particular system shouldn't >> count as a proposition in that system. > > Every expression of language of every formal system must be a truth > bearer because formal logic systems are Boolean. How does not being able to prove something make it a non truth-bearer? This is the critical detail you keep leaving out. All propositions are by definition either true or false. Whether we can prove that a given proposition is true or false is an entirely different issue. You keep confusing 'truth' with 'knowledge'. They are different things. >> x + y = y + x is produced by the grammar of Q and it is perfectly >> clear what it means. There is no reason why it should be excluded. >> > > It is not a truth bearer in Q. Of course it is. It is demonstrably true for some models of Q and demonstrably false for other models of Q so obviously it is a truth bearer. But neither of these is provable from the axioms of Q. >> And if someone were to demonstrate that there is some proposition >> which is not provable in *any* formal system, you have similarly >> provided no explanation for why such a proposition should be >> considered 'incorrect'. >> > > That you say that I have never done something that I have done several > times seems so disingenuous as to be dishonest: > > Here Tarski refers to the Liar Paradox (From Theorem I) > It would then be possible to reconstruct the antinomy > of the liar in the metalanguage, by forming in the language > itself a sentence x such that the sentence of the metalanguage > which is correlated with x asserts that x is not a true sentence. I > http://www.liarparadox.org/247_248.pdf > > Here uses the Liar Paradox as his basis for the first step of his proof. > In accordance with the first > part of Theorem I we can obtain the negation of one of the sentences > in condition (α) of convention T of § 3 as a consequence of the > definition of the symbol 'Pr' (provided we replace 'Tr' in this > convention by 'Pr'). In other words we can construct a sentence > x of the science in question which satisfies the following > condition: > it is not true that x ∈ Pr if and only if p > or in equivalent formulation: > (1) x ∉ Pr if and only if p (x ∉ Pr ↔ p) > where the symbol 'p' represents the whole sentence x > > therefore a more correct way of formalizing (1) would be > (1) x ∉ Pr if and only if x (x ∉ Pr ↔ x) > when we revert this back to its original form > (not swapping "Tr" with "Pr") we get the Liar Paradox > (1) x ∉ Tr if and only if x (x ∉ Tr ↔ x) > x is not true if and only if x is true > http://www.liarparadox.org/Tarski_Proof_275_276.pdf > >> This last point is moot, though, since Ben already provided a reason >> to believe no such proposition can exist. We can simply create a >> formal system containing that proposition as its only axiom. So there >> are no 'incorrect' statements. >> > > It is shown above that Tarski used such a statement as the basis of his > whole Undefinability proof. No, he did not. His x and p would be *different* for different formal systems, just as Gödel's G will be *different* for different formal systems. Neither proposed a single proposition which would be unprovable in all formal systems. >>> Unless and until we as humans create an automated proof generator of >>> sufficient power (maybe this has already been done in this case?) >>> determining the provability of an expression of language within a >>> formal system will remain a "we as humans" thing. >>> >>>> Also, you still seem to not grasp why x + y = y + x is provable in >>>> PA but not in Q. In every model of PA, x + y = y + x *is* true. In >>>> Q, however, this is not the case. There are models of Q in which x + >>>> y = y + x is *not* true. >>> >>>> The fact that this statement is provably true in PA does not entail >>>> that it is true in Q, and the fact that it is provable in PA should >>>> have absolutely no bearing on its status in Q. >>> >>> That is really great that we agree on something as important as this. >>> We have progressed from rebuttals and defending against rebuttals to >>> actual mutual understanding. That makes me happy. >> >> Except we don't seem to be in agreement. As I stated, the fact that x >> + y = y + x is provable in PA has no bearing on its status in Q. > > Yes that is correct. It is only the fact that the commutative property > of addition (CPOA) is neither provable nor disprovable in Q that > determines its status in Q. The fact that that (CPOA) is provable in PA > proves that it is not erroneous. How is the fact that it is 'not erroneous' not part of its status in Q? And the fact that you keep switching x + y = y + x to 'the commutative property of addition' indicates that you still don't grasp *why* this is not decidable in Q. 'x + y = y + x' is simply a string of symbols (that, after all, is what formal systems deal with). How it is interpreted depends on the specific model of Q which one is using. x + y = y + x does not necessarily mean the same thing in PA as it does in Q because there are models which are consistent with the axioms of one but not the other. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 14:59 -0500 |
| Message-ID | <oPmdndbS15-ADg3CnZ2dnUU7-XnNnZ2d@giganews.com> |
| In reply to | #24070 |
On 10/21/2020 1:29 PM, André G. Isaak wrote: > On 2020-10-21 12:00, olcott wrote: >> On 10/21/2020 12:25 PM, André G. Isaak wrote: >>> On 2020-10-21 10:57, olcott wrote: >>>> On 10/21/2020 10:40 AM, André G. Isaak wrote: >>>>> On 2020-10-21 09:16, olcott wrote: >>>>>> On 10/21/2020 9:13 AM, André G. Isaak wrote: >>>>>>> On 2020-10-21 07:25, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> <cut> >>>>>>>>>>>>> The only way that an expression of language is neither >>>>>>>>>>>>> provable nor >>>>>>>>>>>>> disprovable in any formal system of Q or greater is if the >>>>>>>>>>>>> expression >>>>>>>>>>>>> of language is incorrect. >>>>>>>>>>>> >>>>>>>>>>>> This is very badly worded, but it seems to say that you >>>>>>>>>>>> still claim that >>>>>>>>>>>> x+y=y+x is incorrect. If so, then answer the question >>>>>>>>>>>> you've tried so >>>>>>>>>>>> hard to dodge: in what way is it incorrect? >>>>>>>>>>> >>>>>>>>>>> The formal system of the set of all knowledge currently known >>>>>>>>>>> and can >>>>>>>>>>> ever possibly be known includes Q. In other words Gödel's proof >>>>>>>>>>> applies to an omniscient formal system. >>>>>>>>>> >>>>>>>>>> No answer. What is incorrect about Q's x+y=y+x? >>>>>>>>> >>>>>>>>> Your dishonest dodge is noted. Apparently if your goal is to >>>>>>>>> "win an >>>>>>>>> argument" and when you know that you are incorrect then the only >>>>>>>>> tactic available is dishonest dodges. >>>>>>>> >>>>>>>> My goal is to get you to answer the question. What is incorrect >>>>>>>> about >>>>>>>> Q's x+y=y+x? Either explain what is incorrect about this perfectly >>>>>>>> sensible "expression of the language of Q" or confirm that you >>>>>>>> no longer >>>>>>>> stand by the definition you gave: >>>>>>>> >>>>>>>> | An expression φ of the language of theory T is incorrect if >>>>>>>> and only >>>>>>>> | if (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>>> >>>>>>>> You could not have been clearer: Q's x+y=y+x is incorrect. >>>>>>>> >>>>>>>>> The commutative property of addition is provable in some formal >>>>>>>>> systems therefore it is not erroneous. >>>>>>>> >>>>>>>> You are trying to wriggle out of what you said. x+y=y+x is an >>>>>>>> expression of the language of Q. According to you, it is >>>>>>>> incorrect if >>>>>>>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the >>>>>>>> case. >>>>>>>> >>>>>>>> Answer the question or retract the definition. >>>>>>>> >>>>>>>> As always, you have said some new incorrect things that, were I to >>>>>>>> address them, could derail the discussion. I'd like clear one >>>>>>>> simple >>>>>>>> point once and for all. You should approve, after all, of what >>>>>>>> you call >>>>>>>> a laser-like focus on a topic. >>>>>>> >>>>>>> Rereading some of his posts and trying to get through his >>>>>>> convoluted grammar, it actually appears he did provide an answer, >>>>>>> but, as you suspected it was some entirely new wrong thing. >>>>>>> >>>>>>> Propositions which are not provable or disprovable in "any system >>>>>>> what-so-ever" are incorrect. >>>>>>> >>>>>> >>>>>>> Propositions which are not provable or disprovable in system F >>>>>>> but which are provable or disprovable in *some* system, aren't >>>>>>> incorrect, they're just not propositions of F. >>>>>>> >>>>>>> So apparently, to determine whether some proposition is >>>>>>> 'incorrect' as opposed to simply being 'not a proposition', you >>>>>>> must not only determine whether it is provable in the system >>>>>>> under consideration, but also in every other possible system. >>>>>> >>>>>> This part is correct. >>>>> >>>>> So how exactly is that supposed to work? >>>>> >>>>> When we determine that x + y = y + x is not provable within Q (i.e. >>>>> using only the rules of inference and axioms of Q), how are we >>>>> supposed to determine *within Q* that it might be provable in some >>>>> other formal system given that Q has no knowledge of the axioms or >>>>> rules of inference of any system other than Q? >>>>> >>>> >>>> That is the part that you got totally incorrectly. We as humans know >>>> that the commutative property of addition is provable in some formal >>>> system (PA?) We as humans know that it is not provable in Q. >>> >>> What we as humans may or may not know should be entirely irrelevant. >>> A formal system is purely mechanical, and claims about whether a >>> particular statement is or isn't a proposition of a given system must >>> be something which that system can determine in a purely mechanical >>> manner. >>> >> >> Yes but math by itself when it has not been converted into computer >> science merely sits there on the page of paper, or resides in a file >> as a sequence of bytes. Until it is processed by an physical mind or >> physical hardware math is static. >> >>> So if you claim that "x + y = y + x" is not a proposition of Q, the >>> rules of Q must be able to tell us that, just as they must be able to >>> tell us whether something in Q is 'incorrect'. >>> >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> From what I recall, it is conventionally understood that we need an >> at least slightly higher level of meta-mathematics to decide >> provability. It is conventionally understood that no formal system has >> a provability operator: "⊢". > > It is not possible, in general to prove that something is provable, > either within the system, in some more powerful system, or by a human. > Many cases can be shown to be provable within a system, I think that you must err here. What are are really meaning is that a human can apply the axioms of a formal system to show that an expression of language is provable ion the basis of its axioms. In order for an expression of language to literally be provable in the system this system would have to apply its own axioms itself. We can imagine that it does this by supplying a provability predicate or we can transform the system into a software system with a provability predicate, yet without a provability predicate to supply the semantics of provability provability remains gibberish within the formal system. > potentially more > cases in some more powerful system, but there is way to demonstrate > provability or the lack thereof is all cases. > >>> And you still haven't provided any explanation for *why* a statement >>> which cannot be proven or disproven in a particular system shouldn't >>> count as a proposition in that system. >> >> Every expression of language of every formal system must be a truth >> bearer because formal logic systems are Boolean. > > How does not being able to prove something make it a non truth-bearer? Not being able to prove an expression of language is the same thing as saying the it is deductivery invalid. Since only sound arguments derive true conclusions and sound arguments must also be valid arguments unprovable means not a truth bearer. You can say thag you disagree and you can say that conventional wisdom does not agree. What you cannot do is provide an actual rebuttal. > This is the critical detail you keep leaving out. All propositions are > by definition either true or false. Whether we can prove that a given > proposition is true or false is an entirely different issue. You keep > confusing 'truth' with 'knowledge'. They are different things. When an expression of language is impossibly true or false (like the Liar Paradox basis of Tarski's proof) then this expression is not a truth bearer. When an expression of language has free variables then it is not a logic sentence and not a truth bearer. A sentence can be viewed as expressing a proposition, something that must be true or false. https://en.wikipedia.org/wiki/Sentence_(mathematical_logic) >>> x + y = y + x is produced by the grammar of Q and it is perfectly >>> clear what it means. There is no reason why it should be excluded. >>> >> >> It is not a truth bearer in Q. > > Of course it is. It is demonstrably true for some models of Q and > demonstrably false for other models of Q so obviously it is a truth > bearer. But neither of these is provable from the axioms of Q. > So your models of Q are like the context that you provided for modulo-12 arithmetic that changes the meaning pf the "+" operator. Model theory is finally making sense. >>> And if someone were to demonstrate that there is some proposition >>> which is not provable in *any* formal system, you have similarly >>> provided no explanation for why such a proposition should be >>> considered 'incorrect'. >>> >> >> That you say that I have never done something that I have done several >> times seems so disingenuous as to be dishonest: >> >> Here Tarski refers to the Liar Paradox (From Theorem I) >> It would then be possible to reconstruct the antinomy >> of the liar in the metalanguage, by forming in the language >> itself a sentence x such that the sentence of the metalanguage >> which is correlated with x asserts that x is not a true sentence. I >> http://www.liarparadox.org/247_248.pdf >> >> Here uses the Liar Paradox as his basis for the first step of his proof. >> In accordance with the first >> part of Theorem I we can obtain the negation of one of the sentences >> in condition (α) of convention T of § 3 as a consequence of the >> definition of the symbol 'Pr' (provided we replace 'Tr' in this >> convention by 'Pr'). In other words we can construct a sentence >> x of the science in question which satisfies the following >> condition: >> it is not true that x ∈ Pr if and only if p >> or in equivalent formulation: >> (1) x ∉ Pr if and only if p (x ∉ Pr ↔ p) >> where the symbol 'p' represents the whole sentence x >> >> therefore a more correct way of formalizing (1) would be >> (1) x ∉ Pr if and only if x (x ∉ Pr ↔ x) >> when we revert this back to its original form >> (not swapping "Tr" with "Pr") we get the Liar Paradox >> (1) x ∉ Tr if and only if x (x ∉ Tr ↔ x) >> x is not true if and only if x is true >> http://www.liarparadox.org/Tarski_Proof_275_276.pdf >> >>> This last point is moot, though, since Ben already provided a reason >>> to believe no such proposition can exist. We can simply create a >>> formal system containing that proposition as its only axiom. So there >>> are no 'incorrect' statements. >>> >> >> It is shown above that Tarski used such a statement as the basis of >> his whole Undefinability proof. > > No, he did not. His x and p would be *different* for different formal > systems, just as Gödel's G will be *different* for different formal > systems. Neither proposed a single proposition which would be unprovable > in all formal systems. The only formal system that he was referring to was the one that he defined. Since he just said that "p" <is> "x" then this aspect cannot change: Pathological self-reference is hard-wired. >>>> Unless and until we as humans create an automated proof generator of >>>> sufficient power (maybe this has already been done in this case?) >>>> determining the provability of an expression of language within a >>>> formal system will remain a "we as humans" thing. >>>> >>>>> Also, you still seem to not grasp why x + y = y + x is provable in >>>>> PA but not in Q. In every model of PA, x + y = y + x *is* true. In >>>>> Q, however, this is not the case. There are models of Q in which x >>>>> + y = y + x is *not* true. >>>> >>>>> The fact that this statement is provably true in PA does not entail >>>>> that it is true in Q, and the fact that it is provable in PA should >>>>> have absolutely no bearing on its status in Q. >>>> >>>> That is really great that we agree on something as important as this. >>>> We have progressed from rebuttals and defending against rebuttals to >>>> actual mutual understanding. That makes me happy. >>> >>> Except we don't seem to be in agreement. As I stated, the fact that x >>> + y = y + x is provable in PA has no bearing on its status in Q. >> >> Yes that is correct. It is only the fact that the commutative property >> of addition (CPOA) is neither provable nor disprovable in Q that >> determines its status in Q. The fact that that (CPOA) is provable in >> PA proves that it is not erroneous. > > How is the fact that it is 'not erroneous' not part of its status in Q? Whether or not it is a proposition of Q has only Q as the context. Whether or not it is correct has the set set of every formal system as its context. > And the fact that you keep switching x + y = y + x to 'the commutative > property of addition' indicates that you still don't grasp *why* this is > not decidable in Q. 'x + y = y + x' is simply a string of symbols (that, > after all, is what formal systems deal with). How it is interpreted > depends on the specific model of Q which one is using. x + y = y + x > does not necessarily mean the same thing in PA as it does in Q because > there are models which are consistent with the axioms of one but not the > other. > > André > Because of your concrete example of modulo-12 arithmetic I finally understand that model theory actually has a genuinely useful purpose. I can't understand anything without a specific concrete example. Modulo-12 arithmetic was that example. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 14:42 -0600 |
| Message-ID | <rmq6gc$3p8$1@dont-email.me> |
| In reply to | #24073 |
On 2020-10-21 13:59, olcott wrote: > On 10/21/2020 1:29 PM, André G. Isaak wrote: >> On 2020-10-21 12:00, olcott wrote: >>> On 10/21/2020 12:25 PM, André G. Isaak wrote: >>>> On 2020-10-21 10:57, olcott wrote: <snip> >> It is not possible, in general to prove that something is provable, >> either within the system, in some more powerful system, or by a human. >> Many cases can be shown to be provable within a system, > > I think that you must err here. What are are really meaning is that a > human can apply the axioms of a formal system to show that an expression > of language is provable ion the basis of its axioms. > > In order for an expression of language to literally be provable in the > system this system would have to apply its own axioms itself. 'Provable' means that one can derive the conclusion from the axioms using the rules of inference provided by the system. That can be done mechanically, but there is no guarantee that for a given proposition φ there will be some pathway from the axioms to either φ or ¬φ except for very simple systems. It doesn't matter whether a human is involved. And you don't "apply" axioms. You apply rules of inference. > We can imagine that it does this by supplying a provability predicate or > we can transform the system into a software system with a provability > predicate, yet without a provability predicate to supply the semantics > of provability provability remains gibberish within the formal system. >> potentially more cases in some more powerful system, but there is way >> to demonstrate provability or the lack thereof is all cases. >> >>>> And you still haven't provided any explanation for *why* a statement >>>> which cannot be proven or disproven in a particular system shouldn't >>>> count as a proposition in that system. >>> >>> Every expression of language of every formal system must be a truth >>> bearer because formal logic systems are Boolean. >> >> How does not being able to prove something make it a non truth-bearer? > > Not being able to prove an expression of language is the same thing as > saying the it is deductivery invalid. Since only sound arguments derive > true conclusions and sound arguments must also be valid arguments > unprovable means not a truth bearer. You keep making this same, very obvious logical error. A valid argument with true premises will always lead to a true conclusion. There is absolutely nothing in the definitions of validity, soundness, deduction, or any of the other terms you throw around that entails that every true statement will have a valid argument which leads to it. That is your own addition and it is completely unwarranted; that is there is absolutely no principle of logic which would lead one to conclude this. > You can say thag you disagree and you can say that conventional wisdom > does not agree. What you cannot do is provide an actual rebuttal. You can't provide a rebuttal for something which has no associated argument. How do you get from 'a valid argument with true premises leads to a true conclusion' to 'every true statement is the conclusion of some valid argument'. You don't justify this step. You *can't* justify this step because it is simply false. In standard models of Q, x + y = y + x *is* in fact true. But you cannot get to this truth from the axioms of Q using the rules of inference of Q because the axioms and rules of inference of Q are also consistent with models in which this is false. So if you could prove this in Q, then Q would be inconsistent, and inconsistent systems are worthless. Ben provided one such model just yesterday or the day before. You should study it. >> This is the critical detail you keep leaving out. All propositions are >> by definition either true or false. Whether we can prove that a given >> proposition is true or false is an entirely different issue. You keep >> confusing 'truth' with 'knowledge'. They are different things. > > When an expression of language is impossibly true or false (like the > Liar Paradox basis of Tarski's proof) then this expression is not a > truth bearer. And no such expression exists in formal logic, so such sentences are not the basis of claims regarding incompleteness. > When an expression of language has free variables then it is not a logic > sentence and not a truth bearer. Nor are any such sentences used as the basis of claims regarding incompleteness. So neither of the above two paragraphs are even remotely relevant. > A sentence can be viewed as expressing a proposition, something that > must be true or false. > https://en.wikipedia.org/wiki/Sentence_(mathematical_logic) And x + y = y + x *is* a sentence of Q. >>>> x + y = y + x is produced by the grammar of Q and it is perfectly >>>> clear what it means. There is no reason why it should be excluded. >>>> >>> >>> It is not a truth bearer in Q. >> >> Of course it is. It is demonstrably true for some models of Q and >> demonstrably false for other models of Q so obviously it is a truth >> bearer. But neither of these is provable from the axioms of Q. >> > > So your models of Q are like the context that you provided for modulo-12 > arithmetic that changes the meaning pf the "+" operator. Model theory is > finally making sense. Why don't you go and review the example Ben gave? Modulo-12 arithmetic couldn't be a model of Q because it violates the axiom that 0 is not the successor of any number. But if one were to remove this axiom one could construct different models including ones for modulo-12 arithmetic and modulo-8 arithmetic, and there would be statements which would be true in one, false in the other. 5 + 3 = 0 (true in mod-8, false in mod-12) 5 + 3 = 8 (false in mod-8, true in mod-12) >>>> And if someone were to demonstrate that there is some proposition >>>> which is not provable in *any* formal system, you have similarly >>>> provided no explanation for why such a proposition should be >>>> considered 'incorrect'. >>>> >>> >>> That you say that I have never done something that I have done >>> several times seems so disingenuous as to be dishonest: >>> >>> Here Tarski refers to the Liar Paradox (From Theorem I) >>> It would then be possible to reconstruct the antinomy >>> of the liar in the metalanguage, by forming in the language >>> itself a sentence x such that the sentence of the metalanguage >>> which is correlated with x asserts that x is not a true sentence. I >>> http://www.liarparadox.org/247_248.pdf >>> >>> Here uses the Liar Paradox as his basis for the first step of his proof. >>> In accordance with the first >>> part of Theorem I we can obtain the negation of one of the sentences >>> in condition (α) of convention T of § 3 as a consequence of the >>> definition of the symbol 'Pr' (provided we replace 'Tr' in this >>> convention by 'Pr'). In other words we can construct a sentence >>> x of the science in question which satisfies the following >>> condition: >>> it is not true that x ∈ Pr if and only if p >>> or in equivalent formulation: >>> (1) x ∉ Pr if and only if p (x ∉ Pr ↔ p) >>> where the symbol 'p' represents the whole sentence x >>> >>> therefore a more correct way of formalizing (1) would be >>> (1) x ∉ Pr if and only if x (x ∉ Pr ↔ x) >>> when we revert this back to its original form >>> (not swapping "Tr" with "Pr") we get the Liar Paradox >>> (1) x ∉ Tr if and only if x (x ∉ Tr ↔ x) >>> x is not true if and only if x is true >>> http://www.liarparadox.org/Tarski_Proof_275_276.pdf >>> >>>> This last point is moot, though, since Ben already provided a reason >>>> to believe no such proposition can exist. We can simply create a >>>> formal system containing that proposition as its only axiom. So >>>> there are no 'incorrect' statements. >>>> >>> >>> It is shown above that Tarski used such a statement as the basis of >>> his whole Undefinability proof. >> >> No, he did not. His x and p would be *different* for different formal >> systems, just as Gödel's G will be *different* for different formal >> systems. Neither proposed a single proposition which would be >> unprovable in all formal systems. > > The only formal system that he was referring to was the one that he > defined. Since he just said that "p" <is> "x" then this aspect cannot > change: Pathological self-reference is hard-wired. Clearly you didn't read Tarski carefully. He provided a *general* method for proving his claim. He illustrated that method using one specific system, but he argued that the exact same method could be used for other systems. But applying this method to other systems would result in different p's and x's. >>>>> Unless and until we as humans create an automated proof generator >>>>> of sufficient power (maybe this has already been done in this >>>>> case?) determining the provability of an expression of language >>>>> within a formal system will remain a "we as humans" thing. >>>>> >>>>>> Also, you still seem to not grasp why x + y = y + x is provable in >>>>>> PA but not in Q. In every model of PA, x + y = y + x *is* true. In >>>>>> Q, however, this is not the case. There are models of Q in which x >>>>>> + y = y + x is *not* true. >>>>> >>>>>> The fact that this statement is provably true in PA does not >>>>>> entail that it is true in Q, and the fact that it is provable in >>>>>> PA should have absolutely no bearing on its status in Q. >>>>> >>>>> That is really great that we agree on something as important as this. >>>>> We have progressed from rebuttals and defending against rebuttals >>>>> to actual mutual understanding. That makes me happy. >>>> >>>> Except we don't seem to be in agreement. As I stated, the fact that >>>> x + y = y + x is provable in PA has no bearing on its status in Q. >>> >>> Yes that is correct. It is only the fact that the commutative >>> property of addition (CPOA) is neither provable nor disprovable in Q >>> that determines its status in Q. The fact that that (CPOA) is >>> provable in PA proves that it is not erroneous. >> >> How is the fact that it is 'not erroneous' not part of its status in Q? > > Whether or not it is a proposition of Q has only Q as the context. > > Whether or not it is correct has the set set of every formal system as > its context. Your definition of 'correct' remains to be defined, as does your reason for believing that something unprovable in any system must somehow be 'incorrect'. I assume this is tied to your fallacious assumption that all true statements must have a valid argument associated with them, but that it simply false and does not follow from any principle of logic. >> And the fact that you keep switching x + y = y + x to 'the commutative >> property of addition' indicates that you still don't grasp *why* this >> is not decidable in Q. 'x + y = y + x' is simply a string of symbols >> (that, after all, is what formal systems deal with). How it is >> interpreted depends on the specific model of Q which one is using. x + >> y = y + x does not necessarily mean the same thing in PA as it does in >> Q because there are models which are consistent with the axioms of one >> but not the other. >> >> André >> > > Because of your concrete example of modulo-12 arithmetic I finally > understand that model theory actually has a genuinely useful purpose. > I can't understand anything without a specific concrete example. > Modulo-12 arithmetic was that example. Now maybe you will also entertain the possibility that all the other things you reject as 'extraneous complexity) also have useful purposes; in particular the distinction between language and meta-language. You might also reread Carnap to see that what he was proposing had absolutely nothing to do with getting rid of models. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
Page 12 of 21 — ← Prev page 1 … 10 11 [12] 13 14 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web