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 7 of 21 — ← Prev page 1 … 5 6 [7] 8 9 … 21 Next page →
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-10 18:51 +0000 |
| Message-ID | <rlsvqu$1ro$1@news.muc.de> |
| In reply to | #23755 |
olcott <NoOne@nowhere.com> wrote: > On 10/10/2020 12:29 PM, Alan Mackenzie wrote: >> DV <xlt.pjw@gmail.com> wrote: >>> I'll give you a theory. Peter Olcott is not a Monster, and he is >>> currently doing the right thing. >> I doubt he's a monster, but he appears to be less well up on mathematical >> logic than the people he's debating with. These people are trying to >> give him the benefit of their knowledge, but are being rebuffed. >> One point somebody made a short while ago (I can't remember who, but it >> was within the last two or three weeks) was not answered by Peter Olcott. >> And that is, that the logical theory he's trying to build, where >> everything that is true is provable, cannot be powerful enough to prove >> everything about the integers. This follows directly from Gödel's >> incompleteness theorem, because in every system which can describe the >> integers there are true things which cannot be proven. > It turns out to actually be the case that within the analytic side of > the philosophical analytic versus synthetic distinction .... Sorry, the above is to abstract and abstruse to make sense of. > https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction > True(x) is only derived as the conclusion of a sound argument. The proof of Gödel's incompleteness theorem is a sound argument. It's mathematics, not philosophy, and if there were anything unsound about it, that would have been uncovered by mathematicians by now. > Since soundness requires both validity and premises that are true and > validity is nothing more than provability it is impossible for > provability and truth to diverge. It is possible and inevitable, as proven by, inter alia, Gödel. > Learned-by-rote people can't seem to understand this. It would aappear the unlearned don't understand Gödel's incompleteness theorem. It is not philosophical speculation - it is mathematical fact. > They can't show that I am incorrect because I am correct, yet they > continue to disagree as if the incompleteness error was welded into > their brains. I can't show you're incorrect because I have no clear picture of what you are trying to say. I've been following the threads on this newsgroup for some while, yet I'm still not clear what you're saying. > It is as if they believed that Gödel is inherently infallible .... Gödel no doubt made mistakes, as we all do, > .... therefore any and all reasoning against him must necessarily be > incorrect. Reasoning against theorems, particularly things like "2 + 2 = 4" is a bit silly, really. >> So, even if PO's system of logic is coherent, it might well be of little >> utility. I put that point to you again: your system, in which truth and provability are identical cannot prove everything about the integers. So even if it is coherent (which isn't yet clear), it will be of limited utility in mathematics. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-10 14:37 -0500 |
| Message-ID | <64OdnVOmsILmkB_CnZ2dnUU7-R3NnZ2d@giganews.com> |
| In reply to | #23756 |
On 10/10/2020 1:51 PM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/10/2020 12:29 PM, Alan Mackenzie wrote: >>> DV <xlt.pjw@gmail.com> wrote: > >>>> I'll give you a theory. Peter Olcott is not a Monster, and he is >>>> currently doing the right thing. > >>> I doubt he's a monster, but he appears to be less well up on mathematical >>> logic than the people he's debating with. These people are trying to >>> give him the benefit of their knowledge, but are being rebuffed. > >>> One point somebody made a short while ago (I can't remember who, but it >>> was within the last two or three weeks) was not answered by Peter Olcott. >>> And that is, that the logical theory he's trying to build, where >>> everything that is true is provable, cannot be powerful enough to prove >>> everything about the integers. This follows directly from Gödel's >>> incompleteness theorem, because in every system which can describe the >>> integers there are true things which cannot be proven. > >> It turns out to actually be the case that within the analytic side of >> the philosophical analytic versus synthetic distinction .... > > Sorry, the above is to abstract and abstruse to make sense of. > >> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction > >> True(x) is only derived as the conclusion of a sound argument. > > The proof of Gödel's incompleteness theorem is a sound argument. It's > mathematics, not philosophy, and if there were anything unsound about it, > that would have been uncovered by mathematicians by now. > >> Since soundness requires both validity and premises that are true and >> validity is nothing more than provability it is impossible for >> provability and truth to diverge. > > It is possible and inevitable, as proven by, inter alia, Gödel. > You don't have the junior high school level of prerequisites sufficient to understand what I am saying. Here they are: Deductive argument: involves the claim that the truth of its premises guarantees the truth of its conclusion; the terms valid and invalid are used to characterize deductive arguments. A deductive argument succeeds when, if you accept the evidence as true (the premises), you must accept the conclusion. Inductive argument: involves the claim that the truth of its premises provides some grounds for its conclusion or makes the conclusion more probable; the terms valid and invalid cannot be applied. Valid: an argument is valid if and only if it is necessary that if all of the premises are true, then the conclusion is true; if all the premises are true, then the conclusion must be true; it is impossible that all the premises are true and the conclusion is false. Invalid: an argument that is not valid. We can test for invalidity by assuming that all the premises are true and seeing whether it is still possible for the conclusion to be false. If this is possible, the argument is invalid. https://web.stanford.edu/~bobonich/terms.concepts/valid.sound.html True and unprovable is exactly the same thing as sound and invalid. Since sound requires valid sound and valid cannot possibly diverge. >> Learned-by-rote people can't seem to understand this. > > It would aappear the unlearned don't understand Gödel's incompleteness > theorem. It is not philosophical speculation - it is mathematical fact. > >> They can't show that I am incorrect because I am correct, yet they >> continue to disagree as if the incompleteness error was welded into >> their brains. > > I can't show you're incorrect because I have no clear picture of what you > are trying to say. I've been following the threads on this newsgroup for > some while, yet I'm still not clear what you're saying. > >> It is as if they believed that Gödel is inherently infallible .... > > Gödel no doubt made mistakes, as we all do, > >> .... therefore any and all reasoning against him must necessarily be >> incorrect. > > Reasoning against theorems, particularly things like "2 + 2 = 4" is a bit > silly, really. > >>> So, even if PO's system of logic is coherent, it might well be of little >>> utility. > > I put that point to you again: your system, in which truth and > provability are identical cannot prove everything about the integers. So > even if it is coherent (which isn't yet clear), it will be of limited > utility in mathematics. > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-10 20:24 +0000 |
| Message-ID | <rlt5ae$1v73$1@news.muc.de> |
| In reply to | #23758 |
olcott <NoOne@nowhere.com> wrote: > On 10/10/2020 1:51 PM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: >>> On 10/10/2020 12:29 PM, Alan Mackenzie wrote: >>>> DV <xlt.pjw@gmail.com> wrote: >>>>> I'll give you a theory. Peter Olcott is not a Monster, and he is >>>>> currently doing the right thing. >>>> I doubt he's a monster, but he appears to be less well up on mathematical >>>> logic than the people he's debating with. These people are trying to >>>> give him the benefit of their knowledge, but are being rebuffed. >>>> One point somebody made a short while ago (I can't remember who, but it >>>> was within the last two or three weeks) was not answered by Peter Olcott. >>>> And that is, that the logical theory he's trying to build, where >>>> everything that is true is provable, cannot be powerful enough to prove >>>> everything about the integers. This follows directly from Gödel's >>>> incompleteness theorem, because in every system which can describe the >>>> integers there are true things which cannot be proven. >>> It turns out to actually be the case that within the analytic side of >>> the philosophical analytic versus synthetic distinction .... >> Sorry, the above is to abstract and abstruse to make sense of. >>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction >>> True(x) is only derived as the conclusion of a sound argument. >> The proof of Gödel's incompleteness theorem is a sound argument. It's >> mathematics, not philosophy, and if there were anything unsound about it, >> that would have been uncovered by mathematicians by now. >>> Since soundness requires both validity and premises that are true and >>> validity is nothing more than provability it is impossible for >>> provability and truth to diverge. >> It is possible and inevitable, as proven by, inter alia, Gödel. > You don't have the junior high school level of prerequisites sufficient > to understand what I am saying. I have a degree in mathematics. Do you? > Here they are: [ .... ] > True and unprovable is exactly the same thing as sound and invalid. Is that just in some philosophy, or is it mathematically proven in some context? > Since sound requires valid sound and valid cannot possibly diverge. That's incoherent. How about addressing the point I made in my last two posts: since you are trying to construct a system in which Gödel's incompleteness theorem will be inapplicable, that system will, of necessity, be rather weak and of limited applicability. >>> Learned-by-rote people can't seem to understand this. >> It would aappear the unlearned don't understand Gödel's incompleteness >> theorem. It is not philosophical speculation - it is mathematical fact. >>> They can't show that I am incorrect because I am correct, yet they >>> continue to disagree as if the incompleteness error was welded into >>> their brains. >> I can't show you're incorrect because I have no clear picture of what you >> are trying to say. I've been following the threads on this newsgroup for >> some while, yet I'm still not clear what you're saying. >>> It is as if they believed that Gödel is inherently infallible .... >> Gödel no doubt made mistakes, as we all do, >>> .... therefore any and all reasoning against him must necessarily be >>> incorrect. >> Reasoning against theorems, particularly things like "2 + 2 = 4" is a bit >> silly, really. >>>> So, even if PO's system of logic is coherent, it might well be of little >>>> utility. >> I put that point to you again: your system, in which truth and >> provability are identical cannot prove everything about the integers. So >> even if it is coherent (which isn't yet clear), it will be of limited >> utility in mathematics. >>> -- >>> Copyright 2020 Pete Olcott > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-10 19:09 -0500 |
| Message-ID | <qPadnT63euev0B_CnZ2dnUU7-K3NnZ2d@giganews.com> |
| In reply to | #23761 |
On 10/10/2020 3:24 PM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/10/2020 1:51 PM, Alan Mackenzie wrote: >>> olcott <NoOne@nowhere.com> wrote: >>>> On 10/10/2020 12:29 PM, Alan Mackenzie wrote: >>>>> DV <xlt.pjw@gmail.com> wrote: > >>>>>> I'll give you a theory. Peter Olcott is not a Monster, and he is >>>>>> currently doing the right thing. > >>>>> I doubt he's a monster, but he appears to be less well up on mathematical >>>>> logic than the people he's debating with. These people are trying to >>>>> give him the benefit of their knowledge, but are being rebuffed. > >>>>> One point somebody made a short while ago (I can't remember who, but it >>>>> was within the last two or three weeks) was not answered by Peter Olcott. >>>>> And that is, that the logical theory he's trying to build, where >>>>> everything that is true is provable, cannot be powerful enough to prove >>>>> everything about the integers. This follows directly from Gödel's >>>>> incompleteness theorem, because in every system which can describe the >>>>> integers there are true things which cannot be proven. > >>>> It turns out to actually be the case that within the analytic side of >>>> the philosophical analytic versus synthetic distinction .... > >>> Sorry, the above is to abstract and abstruse to make sense of. > >>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction > >>>> True(x) is only derived as the conclusion of a sound argument. > >>> The proof of Gödel's incompleteness theorem is a sound argument. It's >>> mathematics, not philosophy, and if there were anything unsound about it, >>> that would have been uncovered by mathematicians by now. > >>>> Since soundness requires both validity and premises that are true and >>>> validity is nothing more than provability it is impossible for >>>> provability and truth to diverge. > >>> It is possible and inevitable, as proven by, inter alia, Gödel. > > >> You don't have the junior high school level of prerequisites sufficient >> to understand what I am saying. > > I have a degree in mathematics. Do you? > >> Here they are: > > [ .... ] > >> True and unprovable is exactly the same thing as sound and invalid. > > Is that just in some philosophy, or is it mathematically proven in some > context? > >> Since sound requires valid sound and valid cannot possibly diverge. > > That's incoherent. > > How about addressing the point I made in my last two posts: since you are > trying to construct a system in which Gödel's incompleteness theorem will > be inapplicable, that system will, of necessity, be rather weak and of > limited applicability. No. Not at all. Not in the least. Just like the proof that concludes 1 = 0, Gödel's proof is simply incorrect. We don't even have to pay attention to any of the steps, we can know that any proof that concludes that 1 = 0 is wrong. In this same way because ∀x (True(x) ↔ ⊢x) > >>>> Learned-by-rote people can't seem to understand this. > >>> It would aappear the unlearned don't understand Gödel's incompleteness >>> theorem. It is not philosophical speculation - it is mathematical fact. > >>>> They can't show that I am incorrect because I am correct, yet they >>>> continue to disagree as if the incompleteness error was welded into >>>> their brains. > >>> I can't show you're incorrect because I have no clear picture of what you >>> are trying to say. I've been following the threads on this newsgroup for >>> some while, yet I'm still not clear what you're saying. > >>>> It is as if they believed that Gödel is inherently infallible .... > >>> Gödel no doubt made mistakes, as we all do, > >>>> .... therefore any and all reasoning against him must necessarily be >>>> incorrect. > >>> Reasoning against theorems, particularly things like "2 + 2 = 4" is a bit >>> silly, really. > >>>>> So, even if PO's system of logic is coherent, it might well be of little >>>>> utility. > >>> I put that point to you again: your system, in which truth and >>> provability are identical cannot prove everything about the integers. So >>> even if it is coherent (which isn't yet clear), it will be of limited >>> utility in mathematics. > >>>> -- >>>> Copyright 2020 Pete Olcott > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-11 09:01 +0000 |
| Message-ID | <rluhkj$15cf$1@news.muc.de> |
| In reply to | #23765 |
olcott <NoOne@nowhere.com> wrote: > On 10/10/2020 3:24 PM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: [ .... ] >>> True and unprovable is exactly the same thing as sound and invalid. >> Is that just in some philosophy, or is it mathematically proven in some >> context? You haven't answered this critical question. Please do so. >>> Since sound requires valid sound and valid cannot possibly diverge. >> That's incoherent. >> How about addressing the point I made in my last two posts: since you are >> trying to construct a system in which Gödel's incompleteness theorem will >> be inapplicable, that system will, of necessity, be rather weak and of >> limited applicability. > No. Not at all. Not in the least. > Just like the proof that concludes 1 = 0, Gödel's proof is simply > incorrect. That is a very bold thing to say. Gödel's proof stands even after many decades of scrutiny. I think you've admitted that you've never even read and understood this proof. I also think if you're going to assert its invalidity, you should read and understand it, and then point out the mistaken step in it. If you're right, there're a lot of mathematicians who need to understand _why_ you're right. Until you do this, you are simply wrong. > We don't even have to pay attention to any of the steps, we can know > that any proof that concludes that 1 = 0 is wrong. This may be true, but Gödel's incompleteness theorem is not like 1 = 0. It is just as true as 2 + 2 = 4, and proven using much the same apparatus, the arithmetic of the natural numbers. > In this same way because ∀x (True(x) ↔ ⊢x) I'm at a disadvantage here, because my newsreader can't display properly two of the symbols you've used there. But I think you're reasserting your (unproven) assertion that true is the same as provable. This would appear to be something you'd like to be true, yet isn't. [ .... ] > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-11 10:12 -0500 |
| Message-ID | <w8OdnRMH_MFnvR7CnZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #23768 |
On 10/11/2020 4:01 AM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/10/2020 3:24 PM, Alan Mackenzie wrote: >>> olcott <NoOne@nowhere.com> wrote: > > [ .... ] > >>>> True and unprovable is exactly the same thing as sound and invalid. > >>> Is that just in some philosophy, or is it mathematically proven in some >>> context? > > You haven't answered this critical question. Please do so. > Your question is upside down and backwards. Math obtains its definition of truth from logic which obtains its definition from philosophy. From the perspective of math "truth" is merely an axiom that it must obey. >>>> Since sound requires valid sound and valid cannot possibly diverge. > >>> That's incoherent. > >>> How about addressing the point I made in my last two posts: since you are >>> trying to construct a system in which Gödel's incompleteness theorem will >>> be inapplicable, that system will, of necessity, be rather weak and of >>> limited applicability. > >> No. Not at all. Not in the least. > >> Just like the proof that concludes 1 = 0, Gödel's proof is simply >> incorrect. > > That is a very bold thing to say. Gödel's proof stands even after many > decades of scrutiny. The problem is that the definitions of terms are applied incorrectly: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). Here is how the definition is properly applied: An expression of language L is a proposition in a formal system F if and only if this expression or its negation are provable within this formal system: ∀L (Proposition(F,L) ↔ ((F ⊢ L) ∨ (F ⊢ ¬L)) ) > I think you've admitted that you've never even read > and understood this proof. If Gödel understood his own proof he would not have made his incompleteness mistake. It wasn't his fault he was relying on an incorrect definition of incompleteness. That was his whole mistake. > I also think if you're going to assert its > invalidity, you should read and understand it, and then point out the > mistaken step in it. If you're right, there're a lot of mathematicians > who need to understand _why_ you're right. Until you do this, you are > simply wrong. > >> We don't even have to pay attention to any of the steps, we can know >> that any proof that concludes that 1 = 0 is wrong. > > This may be true, but Gödel's incompleteness theorem is not like 1 = 0. When it says that provable can diverge from true and provable is a required aspect of true he is obviously wrong. > It is just as true as 2 + 2 = 4, and proven using much the same > apparatus, the arithmetic of the natural numbers. > >> In this same way because ∀x (True(x) ↔ ⊢x) > > I'm at a disadvantage here, because my newsreader can't display properly > two of the symbols you've used there. Then look at it in Google. https://groups.google.com/d/msg/comp.theory/ssZCWefyTqg/ORUJQwqyDAAJ > But I think you're reasserting > your (unproven) assertion that true is the same as provable. This would > appear to be something you'd like to be true, yet isn't. > Within the body of analytical truth an expression of language is only known to be true on the basis of a chain of inference from known truths or the expression of language has been defined to be true such as 5 > 3 derives its truth from the definition of the ordered set of natural numbers. > [ .... ] > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-11 16:51 +0000 |
| Message-ID | <rlvd7d$952$1@news.muc.de> |
| In reply to | #23773 |
olcott <NoOne@nowhere.com> wrote: > On 10/11/2020 4:01 AM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: >>> On 10/10/2020 3:24 PM, Alan Mackenzie wrote: >>>> olcott <NoOne@nowhere.com> wrote: >> [ .... ] >>>>> True and unprovable is exactly the same thing as sound and invalid. >>>> Is that just in some philosophy, or is it mathematically proven in some >>>> context? >> You haven't answered this critical question. Please do so. > Your question is upside down and backwards. Math obtains its definition > of truth from logic which obtains its definition from philosophy. Not at all. That might have been true in ancient times. Nowadays, philsophy, if it is to stay vital, must incorporate discoveries from science and mathematics. In particular, the notion that true and provable are the same is untenable. It has been proven false. What is the source and justification for your belief that true and provable coincide? > From the perspective of math "truth" is merely an axiom that it must obey. If you say so. [ .... ] >>>> How about addressing the point I made in my last two posts: since you are >>>> trying to construct a system in which Gödel's incompleteness theorem will >>>> be inapplicable, that system will, of necessity, be rather weak and of >>>> limited applicability. >>> No. Not at all. Not in the least. >>> Just like the proof that concludes 1 = 0, Gödel's proof is simply >>> incorrect. >> That is a very bold thing to say. Gödel's proof stands even after many >> decades of scrutiny. > The problem is that the definitions of terms are applied incorrectly: > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). Gödel's theorem is a theorem about natural numbers, and is as true as 2 + 2 = 4. His insight was that propositions could be coded up as numbers and reasoned about as numbers, with the rigour that that brings. > Here is how the definition is properly applied: An expression of > language L is a proposition in a formal system F if and only if this > expression or its negation are provable within this formal system: > ∀L (Proposition(F,L) ↔ ((F ⊢ L) ∨ (F ⊢ ¬L)) ) As others in this discussion have pointed out, that is not a useful definition of a proposition. It is in general not possible to determine if an expression is a provable proposition or not. In such a system, the scope of propositions would be so small, that the mathematics of the natural numbers could not be described by it. >> I think you've admitted that you've never even read and understood >> this proof. > If Gödel understood his own proof, .... He certainly understood it, as did I, even if I read a version of it rather than the original. Why have you not read and understood his proof? > .... he would not have made his incompleteness mistake. It wasn't his > fault he was relying on an incorrect definition of incompleteness. That > was his whole mistake. He made no such mistakes. The theorem is rock solid. If you think otherwise, you should be prepared to point out which step of the proof is invalid. [ .... ] >>> We don't even have to pay attention to any of the steps, we can know >>> that any proof that concludes that 1 = 0 is wrong. >> This may be true, but Gödel's incompleteness theorem is not like 1 = 0. > When it says that provable can diverge from true and provable is a > required aspect of true he is obviously wrong. You sound a bit like that guy in sci.maths, for whom a constant speed of light is "obvious nonsense". Gödel's theorem is a _theorem_. >> It is just as true as 2 + 2 = 4, and proven using much the same >> apparatus, the arithmetic of the natural numbers. >>> In this same way because ∀x (True(x) ↔ ⊢x) >> I'm at a disadvantage here, because my newsreader can't display properly >> two of the symbols you've used there. > Then look at it in Google. I don't have access to google. That is by choice; the cost of using google is too high. > https://groups.google.com/d/msg/comp.theory/ssZCWefyTqg/ORUJQwqyDAAJ >> But I think you're reasserting your (unproven) assertion that true is >> the same as provable. This would appear to be something you'd like to >> be true, yet isn't. > Within the body of analytical truth an expression of language is only > known to be true on the basis of a chain of inference from known truths > or the expression of language has been defined to be true such as 5 > 3 > derives its truth from the definition of the ordered set of natural > numbers. Within such a body of knowledge, there are provably expressions which are true, yet for which there is no chain of inference demonstrating that truth. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-11 17:31 -0500 |
| Message-ID | <nv6dnYjxqbVDGh7CnZ2dnUU7-K3NnZ2d@giganews.com> |
| In reply to | #23774 |
On 10/11/2020 11:51 AM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/11/2020 4:01 AM, Alan Mackenzie wrote: >>> olcott <NoOne@nowhere.com> wrote: >>>> On 10/10/2020 3:24 PM, Alan Mackenzie wrote: >>>>> olcott <NoOne@nowhere.com> wrote: > >>> [ .... ] > >>>>>> True and unprovable is exactly the same thing as sound and invalid. > >>>>> Is that just in some philosophy, or is it mathematically proven in some >>>>> context? > >>> You haven't answered this critical question. Please do so. > > >> Your question is upside down and backwards. Math obtains its definition >> of truth from logic which obtains its definition from philosophy. > > Not at all. That might have been true in ancient times. Nowadays, > philsophy, if it is to stay vital, must incorporate discoveries from > science and mathematics. In particular, the notion that true and > provable are the same is untenable. It has been proven false. > > What is the source and justification for your belief that true and > provable coincide? > >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). > > Gödel's theorem is a theorem about natural numbers, and is as true as 2 + > 2 = 4. His insight was that propositions could be coded up as numbers > and reasoned about as numbers, with the rigour that that brings. > >> Here is how the definition is properly applied: An expression of >> language L is a proposition in a formal system F if and only if this >> expression or its negation are provable within this formal system: >> ∀L (Proposition(F,L) ↔ ((F ⊢ L) ∨ (F ⊢ ¬L)) ) > > As others in this discussion have pointed out, that is not a useful > definition of a proposition. It is in general not possible to determine > if an expression is a provable proposition or not. In such a system, the > scope of propositions would be so small, that the mathematics of the > natural numbers could not be described by it. > All that I have done is take the standard definition of incompleteness and switch the "blame". A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). with the blame switched from theory T to expression φ: Expression φ is a proposition of theory T if and only if (T ⊢ φ) or (T ⊢ ¬φ). // DeMorgan's theorem applied so that I can specify what <is> // a proposition instead of what is not a proposition. This one tiny little change makes Gödel's theorem impossible to prove because his theorem loses its entire basis. Learned-by-rote people that dogmatically accept Gödel won't get this. Gödel's proof has never ever been about the math. It has always been about the meta-math. (Learned-by-rote people won't get this either). -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-12 09:59 +0000 |
| Message-ID | <rm19e5$9vr$1@news.muc.de> |
| In reply to | #23775 |
olcott <NoOne@nowhere.com> wrote: > On 10/11/2020 11:51 AM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: [ .... ] >>> Your question is upside down and backwards. Math obtains its definition >>> of truth from logic which obtains its definition from philosophy. >> Not at all. That might have been true in ancient times. Nowadays, >> philsophy, if it is to stay vital, must incorporate discoveries from >> science and mathematics. In particular, the notion that true and >> provable are the same is untenable. It has been proven false. >> What is the source and justification for your belief that true and >> provable coincide? >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). >> Gödel's theorem is a theorem about natural numbers, and is as true as 2 + >> 2 = 4. His insight was that propositions could be coded up as numbers >> and reasoned about as numbers, with the rigour that that brings. >>> Here is how the definition is properly applied: An expression of >>> language L is a proposition in a formal system F if and only if this >>> expression or its negation are provable within this formal system: >>> ∀L (Proposition(F,L) ↔ ((F ⊢ L) ∨ (F ⊢ ¬L)) ) >> As others in this discussion have pointed out, that is not a useful >> definition of a proposition. It is in general not possible to determine >> if an expression is a provable proposition or not. In such a system, the >> scope of propositions would be so small, that the mathematics of the >> natural numbers could not be described by it. > All that I have done is take the standard definition of incompleteness > and switch the "blame". There is no "blame". It's just you have unrealistic expectations of formal systems. You are at the level of debating whether an omnipotent god can make an object so heavy she can't lift it. The fact is, any formal system powerful enough to be useful is also powerful enough to be able to express undecidable propositions. That's mathematical fact. > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > with the blame switched from theory T to expression φ: > Expression φ is a proposition of theory T if and only if (T ⊢ φ) or (T ⊢ > ¬φ). > // DeMorgan's theorem applied so that I can specify what <is> > // a proposition instead of what is not a proposition. > This one tiny little change makes Gödel's theorem impossible to prove > because his theorem loses its entire basis. What do you know about Gödel's theorem? I think you've admitted you've never studied the actual theorem. So what makes you think you can say it's "impossible to prove"? It's proven. What you're doing is trying to construct a system to which Gödel's theorem won't apply. As stated several times, this will be a system of such limited power that it won't be able to do very much. A bit like a god that can't construct anything. > Learned-by-rote people that dogmatically accept Gödel won't get this. > Gödel's proof has never ever been about the math. It has always been > about the meta-math. (Learned-by-rote people won't get this either). And unlearned people are still trying to trisect the angle, square the circle and duplicate the cube. To that we can add making logic systems where truth corresponds with provability. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2020-10-12 11:13 +0000 |
| Message-ID | <rm1dpd$1bvl$1@gioia.aioe.org> |
| In reply to | #23787 |
Alan Mackenzie <acm@muc.de> wrote: > olcott <NoOne@nowhere.com> wrote: ... > And unlearned people are still trying to trisect the angle, square the > circle and duplicate the cube. To that we can add making logic systems > where truth corresponds with provability. No, no, no, no, no! That's *brainwashed* peepul!!! -- Mathematical Cranks [U. Dudley, 1992] Mathematical Cranks is a book on pseudomathematics and the cranks who create it, written by ... The book also attempts to analyze the motivation and psychology behind crankery, and to provide advice to professional mathematicians on how ... -- wiki
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-12 05:40 -0600 |
| Message-ID | <rm1fav$c5m$1@dont-email.me> |
| In reply to | #23788 |
On 2020-10-12 05:13, R Kym Horsell wrote: > Alan Mackenzie <acm@muc.de> wrote: >> olcott <NoOne@nowhere.com> wrote: > ... >> And unlearned people are still trying to trisect the angle, square the >> circle and duplicate the cube. To that we can add making logic systems >> where truth corresponds with provability. > > No, no, no, no, no! That's *brainwashed* peepul!!! It's trivially simple to trisect an angle using only a straightedge and a compass once you realize that 'compass' is correctly defined as 'protractor' and that everyone has been using the incorrect definition until now. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2020-10-12 13:18 +0000 |
| Message-ID | <rm1l2o$tt4$1@gioia.aioe.org> |
| In reply to | #23789 |
Andr? G. Isaak <agisaak@gm.invalid> wrote: > On 2020-10-12 05:13, R Kym Horsell wrote: >> Alan Mackenzie <acm@muc.de> wrote: >>> olcott <NoOne@nowhere.com> wrote: >> ... >>> And unlearned people are still trying to trisect the angle, square the >>> circle and duplicate the cube. To that we can add making logic systems >>> where truth corresponds with provability. >> No, no, no, no, no! That's *brainwashed* peepul!!! > It's trivially simple to trisect an angle using only a straightedge and > a compass once you realize that 'compass' is correctly defined as > 'protractor' and that everyone has been using the incorrect definition > until now. > Andr? Now you point out dis translashun error, it is obvees! If only Euclid had the Daily Mail or Wiki, he wood not hab wasted his life messing around wid bullshit and stories of tortoises and hairs. -- John Wilkins, an English bishop, first proposed a standard system of measurement in 1668 including his "standard" which is very close to (.997) the modern meter. In 1783 James Watt proposed linking measurements of length and mass using the density of water. But without an appropriate method of enforcement these ideas languished until the French invented the guillotine in 1789. The metric system was adopted in 1795.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-12 09:23 -0500 |
| Message-ID | <roSdnc0reblA-xnCnZ2dnUU7-QnNnZ2d@giganews.com> |
| In reply to | #23787 |
On 10/12/2020 4:59 AM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/11/2020 11:51 AM, Alan Mackenzie wrote: >>> olcott <NoOne@nowhere.com> wrote: > > [ .... ] > >>>> Your question is upside down and backwards. Math obtains its definition >>>> of truth from logic which obtains its definition from philosophy. > >>> Not at all. That might have been true in ancient times. Nowadays, >>> philsophy, if it is to stay vital, must incorporate discoveries from >>> science and mathematics. In particular, the notion that true and >>> provable are the same is untenable. It has been proven false. > >>> What is the source and justification for your belief that true and >>> provable coincide? > > > >>>> A theory T is incomplete if and only if there is some sentence φ such >>>> that (T ⊬ φ) and (T ⊬ ¬φ). > >>> Gödel's theorem is a theorem about natural numbers, and is as true as 2 + >>> 2 = 4. His insight was that propositions could be coded up as numbers >>> and reasoned about as numbers, with the rigour that that brings. > >>>> Here is how the definition is properly applied: An expression of >>>> language L is a proposition in a formal system F if and only if this >>>> expression or its negation are provable within this formal system: >>>> ∀L (Proposition(F,L) ↔ ((F ⊢ L) ∨ (F ⊢ ¬L)) ) > >>> As others in this discussion have pointed out, that is not a useful >>> definition of a proposition. It is in general not possible to determine >>> if an expression is a provable proposition or not. In such a system, the >>> scope of propositions would be so small, that the mathematics of the >>> natural numbers could not be described by it. > > >> All that I have done is take the standard definition of incompleteness >> and switch the "blame". > > There is no "blame". It's just you have unrealistic expectations of > formal systems. You are at the level of debating whether an omnipotent > god can make an object so heavy she can't lift it. > > The fact is, any formal system powerful enough to be useful is also > powerful enough to be able to express undecidable propositions. That's > mathematical fact. > >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). > >> with the blame switched from theory T to expression φ: > >> Expression φ is a proposition of theory T if and only if (T ⊢ φ) or (T ⊢ >> ¬φ). > >> // DeMorgan's theorem applied so that I can specify what <is> >> // a proposition instead of what is not a proposition. > >> This one tiny little change makes Gödel's theorem impossible to prove >> because his theorem loses its entire basis. > > What do you know about Gödel's theorem? All that anyone ever need know about his 1931 Incompleteness theorem is that it utterly depends on this sentence: -- A theory T is incomplete if and only if there is some sentence φ such -- that (T ⊬ φ) and (T ⊬ ¬φ). If that single sentence is false Gödel's 1931 Incompleteness theorem utterly fails. > I think you've admitted you've > never studied the actual theorem. So what makes you think you can say > it's "impossible to prove"? It's proven. What you're doing is trying to > construct a system to which Gödel's theorem won't apply. As stated > several times, this will be a system of such limited power that it won't > be able to do very much. A bit like a god that can't construct anything. > All that I am doing is utterly eliminating the term: "undecidable proposition" and replacing it with incorrect expression". The same criteria that would otherwise make Theory T incomplete, now instead rejects expression φ as incorrect. Theory T is not decided to be incomplete on the basis that it can neither prove nor disprove incorrect expression φ. >> Learned-by-rote people that dogmatically accept Gödel won't get this. >> Gödel's proof has never ever been about the math. It has always been >> about the meta-math. (Learned-by-rote people won't get this either). > > And unlearned people are still trying to trisect the angle, square the > circle and duplicate the cube. To that we can add making logic systems > where truth corresponds with provability. For the whole body of analytical truth (expressions of language that are determined to be true entirely based on their meaning) the only way that we can know that an expression is true based on its meaning or a connected inference chain of meanings (its proof). > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-12 16:27 +0000 |
| Message-ID | <rm206f$s81$1@news.muc.de> |
| In reply to | #23792 |
olcott <NoOne@nowhere.com> wrote: > On 10/12/2020 4:59 AM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: [ .... ] >>> All that I have done is take the standard definition of >>> incompleteness and switch the "blame". >> There is no "blame". It's just you have unrealistic expectations of >> formal systems. You are at the level of debating whether an >> omnipotent god can make an object so heavy she can't lift it. >> The fact is, any formal system powerful enough to be useful is also >> powerful enough to be able to express undecidable propositions. >> That's mathematical fact. >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). >>> with the blame switched from theory T to expression φ: >>> Expression φ is a proposition of theory T if and only if (T ⊢ φ) or >>> (T ⊢ ¬φ). >>> // DeMorgan's theorem applied so that I can specify what <is> // a >>> proposition instead of what is not a proposition. >>> This one tiny little change makes Gödel's theorem impossible to prove >>> because his theorem loses its entire basis. >> What do you know about Gödel's theorem? > All that anyone ever need know about his 1931 Incompleteness theorem is > that it utterly depends on this sentence: > -- A theory T is incomplete if and only if there is some sentence φ > such -- that (T ⊬ φ) and (T ⊬ ¬φ). If that is your genuine belief, carry on in your ignorance. If you'd actually take the trouble to understand the proof of the theorem, you'd see and understand that it is correct and why it is correct. > If that single sentence is false Gödel's 1931 Incompleteness theorem > utterly fails. Then since that theorem doesn't fail, utterly or otherwise, the single sentence above cannot be false. Since it is a definition of "incomplete" rather than a proposition, it can't really be true or false. Maybe you want to remove the idea from mathematics, a bit like the people in 1984 gradually removing words from Newspeak. Best of luck! >> I think you've admitted you've never studied the actual theorem. So >> what makes you think you can say it's "impossible to prove"? It's >> proven. What you're doing is trying to construct a system to which >> Gödel's theorem won't apply. As stated several times, this will be a >> system of such limited power that it won't be able to do very much. A >> bit like a god that can't construct anything. > All that I am doing is utterly eliminating the term: "undecidable > proposition" and replacing it with incorrect expression". Then you will end up with an inconsistent system. > The same criteria that would otherwise make Theory T incomplete, now > instead rejects expression φ as incorrect. There is provably no way to determine whether a general expression is "incorrect" (in your sense) or not. > Theory T is not decided to be incomplete on the basis that it can > neither prove nor disprove incorrect expression φ. What do you do with an expression whose "correctness" cannot be determined? For example, Goldbach's Conjecture currently falls into the unknown category. It might in the future be proven one way or the other, or it might indeed be true yet unprovable. I suppose that you would include Goldbach's conjecture in the "incorrect" category, even though it is an interesting mathematical statement which is valid in every sensible system of mathematical logic. Thus would your system be of limited use. >>> Learned-by-rote people that dogmatically accept Gödel won't get this. >>> Gödel's proof has never ever been about the math. It has always been >>> about the meta-math. (Learned-by-rote people won't get this either). >> And unlearned people are still trying to trisect the angle, square the >> circle and duplicate the cube. To that we can add making logic systems >> where truth corresponds with provability. > For the whole body of analytical truth (expressions of language that are > determined to be true entirely based on their meaning) the only way that > we can know that an expression is true based on its meaning or a > connected inference chain of meanings (its proof). That "sentence" no verb. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-12 20:21 -0500 |
| Message-ID | <WOadnRGZxLZinRjCnZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #23795 |
On 10/12/2020 11:27 AM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/12/2020 4:59 AM, Alan Mackenzie wrote: >>> olcott <NoOne@nowhere.com> wrote: > > [ .... ] > >>>> All that I have done is take the standard definition of >>>> incompleteness and switch the "blame". > >>> There is no "blame". It's just you have unrealistic expectations of >>> formal systems. You are at the level of debating whether an >>> omnipotent god can make an object so heavy she can't lift it. > >>> The fact is, any formal system powerful enough to be useful is also >>> powerful enough to be able to express undecidable propositions. >>> That's mathematical fact. > >>>> A theory T is incomplete if and only if there is some sentence φ such >>>> that (T ⊬ φ) and (T ⊬ ¬φ). > >>>> with the blame switched from theory T to expression φ: > >>>> Expression φ is a proposition of theory T if and only if (T ⊢ φ) or >>>> (T ⊢ ¬φ). > >>>> // DeMorgan's theorem applied so that I can specify what <is> // a >>>> proposition instead of what is not a proposition. > >>>> This one tiny little change makes Gödel's theorem impossible to prove >>>> because his theorem loses its entire basis. > >>> What do you know about Gödel's theorem? > >> All that anyone ever need know about his 1931 Incompleteness theorem is >> that it utterly depends on this sentence: > >> -- A theory T is incomplete if and only if there is some sentence φ >> such -- that (T ⊬ φ) and (T ⊬ ¬φ). > > If that is your genuine belief, carry on in your ignorance. If you'd > actually take the trouble to understand the proof of the theorem, you'd > see and understand that it is correct and why it is correct. > That statement has been agreed to by several people in several forums. >> If that single sentence is false Gödel's 1931 Incompleteness theorem >> utterly fails. > > Then since that theorem doesn't fail, utterly or otherwise, the single > sentence above cannot be false. Since it is a definition of "incomplete" > rather than a proposition, it can't really be true or false. Maybe you > want to remove the idea from mathematics, a bit like the people in 1984 > gradually removing words from Newspeak. Best of luck! If is is not true that: -- A theory T is incomplete if and only if there is some sentence φ -- such that (T ⊬ φ) and (T ⊬ ¬φ). >>> I think you've admitted you've never studied the actual theorem. So >>> what makes you think you can say it's "impossible to prove"? It's >>> proven. What you're doing is trying to construct a system to which >>> Gödel's theorem won't apply. As stated several times, this will be a >>> system of such limited power that it won't be able to do very much. A >>> bit like a god that can't construct anything. > >> All that I am doing is utterly eliminating the term: "undecidable >> proposition" and replacing it with incorrect expression". > > Then you will end up with an inconsistent system. Not all all. Not in the least. We end up with a system that reject erroneous expression of language. I think that you may be too stuck on rote learning as indicated by your merely parroting the catch phrases of conventional wisdom. >> The same criteria that would otherwise make Theory T incomplete, now >> instead rejects expression φ as incorrect. > > There is provably no way to determine whether a general expression is > "incorrect" (in your sense) or not. > The exact same ways of determing that an expression of language is undecidable determine that this same expression is erroneous. >> Theory T is not decided to be incomplete on the basis that it can >> neither prove nor disprove incorrect expression φ. > > What do you do with an expression whose "correctness" cannot be > determined? For example, Goldbach's Conjecture currently falls into the > unknown category. It might in the future be proven one way or the other, > or it might indeed be true yet unprovable. True and unprovable is like colorless and blue. There are only two ways that any analytical expression of language is ever determined to be true: (1) By definition such as: "cats are animals" (2) By inference based on definitions. > I suppose that you would > include Goldbach's conjecture in the "incorrect" category, even though it > is an interesting mathematical statement which is valid in every sensible > system of mathematical logic. > > Thus would your system be of limited use. No Because of Andre's objections I had to revise it to exclude Goldbach. "Incorrect expressions of language" are the exact same set that was previously called "undecidable propositions. > >>>> Learned-by-rote people that dogmatically accept Gödel won't get this. >>>> Gödel's proof has never ever been about the math. It has always been >>>> about the meta-math. (Learned-by-rote people won't get this either). > >>> And unlearned people are still trying to trisect the angle, square the >>> circle and duplicate the cube. To that we can add making logic systems >>> where truth corresponds with provability. > >> For the whole body of analytical truth (expressions of language that are >> determined to be true entirely based on their meaning) the only way that >> we can know that an expression is true based on its meaning or a >> connected inference chain of meanings (its proof). > > That "sentence" no verb. The point is that true and provable cannot possibly diverge because the only way that we know that an expression of language is true is by its proof (an inference chain of connected meanings). > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-12 22:48 -0700 |
| Message-ID | <0d8cc82b-a19e-4038-874e-0a3863b82213o@googlegroups.com> |
| In reply to | #23796 |
On Monday, October 12, 2020 at 6:21:11 PM UTC-7, olcott wrote: > > The point is that true and provable cannot possibly diverge because the > only way that we know that an expression of language is true is by its > proof (an inference chain of connected meanings). But that is not what most people think "true" means. Image the potential of redefining "true"!
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-13 01:05 -0500 |
| Message-ID | <ofudnfSJZ4Na3hjCnZ2dnUU7-d-dnZ2d@giganews.com> |
| In reply to | #23797 |
On 10/13/2020 12:48 AM, David Kleinecke wrote: > On Monday, October 12, 2020 at 6:21:11 PM UTC-7, olcott wrote: >> >> The point is that true and provable cannot possibly diverge because the >> only way that we know that an expression of language is true is by its >> proof (an inference chain of connected meanings). > > But that is not what most people think "true" means. > > Image the potential of redefining "true"! > Most people think that "true" is whatever their strongly held beliefs are. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Smaill <smaill@foxtrot.inf.ed.ac.uk> |
|---|---|
| Date | 2020-10-13 09:29 +0100 |
| Message-ID | <fwer1q2pm0a.fsf@foxtrot.inf.ed.ac.uk> |
| In reply to | #23798 |
olcott <NoOne@NoWhere.com> writes: > On 10/13/2020 12:48 AM, David Kleinecke wrote: >> On Monday, October 12, 2020 at 6:21:11 PM UTC-7, olcott wrote: >>> >>> The point is that true and provable cannot possibly diverge because the >>> only way that we know that an expression of language is true is by its >>> proof (an inference chain of connected meanings). >> But that is not what most people think "true" means. >> >> Image the potential of redefining "true"! >> > > Most people think that "true" is whatever their strongly held beliefs are. A certain irony here ......... -- AS
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-13 10:18 -0500 |
| Message-ID | <tcKdnX7yX53JWBjCnZ2dnUU7-dvNnZ2d@giganews.com> |
| In reply to | #23799 |
On 10/13/2020 3:29 AM, Alan Smaill wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/13/2020 12:48 AM, David Kleinecke wrote: >>> On Monday, October 12, 2020 at 6:21:11 PM UTC-7, olcott wrote: >>>> >>>> The point is that true and provable cannot possibly diverge because the >>>> only way that we know that an expression of language is true is by its >>>> proof (an inference chain of connected meanings). >>> But that is not what most people think "true" means. >>> >>> Image the potential of redefining "true"! >>> >> >> Most people think that "true" is whatever their strongly held beliefs are. > > A certain irony here ......... > Analytical truth is only the conclusion of a deductive chain-of-inference. This chain-of-inference argument that derires a conclusion is its provability. It must also begin with premisies that are true. To say that any expression of any formal or natural language is true and unprovable is to say that its argument is both sound and invalid. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <793-849-0957@kylheku.com> |
|---|---|
| Date | 2020-10-13 16:31 +0000 |
| Message-ID | <20201013093149.103@kylheku.com> |
| In reply to | #23798 |
On 2020-10-13, olcott <NoOne@NoWhere.com> wrote: > On 10/13/2020 12:48 AM, David Kleinecke wrote: >> On Monday, October 12, 2020 at 6:21:11 PM UTC-7, olcott wrote: >>> >>> The point is that true and provable cannot possibly diverge because the >>> only way that we know that an expression of language is true is by its >>> proof (an inference chain of connected meanings). >> >> But that is not what most people think "true" means. >> >> Image the potential of redefining "true"! >> > > Most people think that "true" is whatever their strongly held beliefs are. No, that's just you.
[toc] | [prev] | [next] | [standalone]
Page 7 of 21 — ← Prev page 1 … 5 6 [7] 8 9 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web