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 2 of 21 — ← Prev page 1 [2] 3 4 … 21 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 21:38 -0500 |
| Message-ID | <GZqdnQV2GZ4Xcu7CnZ2dnUU7-I2dnZ2d@giganews.com> |
| In reply to | #23652 |
On 9/29/2020 8:12 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> Yet symbolic [logic] has no way to precisely specify actual >>>> self-reference so I had to make one up. >>> >>> Yet you claim that Gödel's proof uses self-reference. Will you now >>> retract that claim? If not, why make up a way to do it when you think >>> Gödel managed it nearly a century ago? >> >> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >> >> 14 Every epistemological antinomy can likewise be used for a similar >> undecidability proof. (Gödel 1931) >> >> Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA >> MATHEMATICA AND RELATED SYSTEMS I >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> Instead of going around and around about what the math says... > > By which you mean you can see the problem (you can't be right about both > your claims) so you'd rather not talk about it. OK. Fine by me. > Instead of going around and around about what the math says we go straight to the actual crux of the issue which is the meta-math. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 12:43 +0100 |
| Message-ID | <87mu17a3r6.fsf@bsb.me.uk> |
| In reply to | #23654 |
olcott <NoOne@NoWhere.com> writes: > On 9/29/2020 8:12 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> Yet symbolic [logic] has no way to precisely specify actual >>>>> self-reference so I had to make one up. >>>> >>>> Yet you claim that Gödel's proof uses self-reference. Will you now >>>> retract that claim? If not, why make up a way to do it when you think >>>> Gödel managed it nearly a century ago? >>> >>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >>> >>> 14 Every epistemological antinomy can likewise be used for a similar >>> undecidability proof. (Gödel 1931) >>> >>> Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA >>> MATHEMATICA AND RELATED SYSTEMS I >>> >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> Instead of going around and around about what the math says... >> >> By which you mean you can see the problem (you can't be right about both >> your claims) so you'd rather not talk about it. OK. Fine by me. > > Instead of going around and around about what the math says we go > straight to the actual crux of the issue which is the meta-math. I'm asking about what you said. Did Gödel find a way to do what you say is not possible in "symbolic logic", or were you wrong to say that his proof involves self-reference? You can't be right about both. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 11:38 -0500 |
| Message-ID | <PsydnbpA4OMEKenCnZ2dnUU7-enNnZ2d@giganews.com> |
| In reply to | #23670 |
On 9/30/2020 6:43 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/29/2020 8:12 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> Yet symbolic [logic] has no way to precisely specify actual >>>>>> self-reference so I had to make one up. >>>>> >>>>> Yet you claim that Gödel's proof uses self-reference. Will you now >>>>> retract that claim? If not, why make up a way to do it when you think >>>>> Gödel managed it nearly a century ago? >>>> >>>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >>>> >>>> 14 Every epistemological antinomy can likewise be used for a similar >>>> undecidability proof. (Gödel 1931) >>>> >>>> Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA >>>> MATHEMATICA AND RELATED SYSTEMS I >>>> >>>> A theory T is incomplete if and only if there is some sentence φ such >>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>> >>>> Instead of going around and around about what the math says... >>> >>> By which you mean you can see the problem (you can't be right about both >>> your claims) so you'd rather not talk about it. OK. Fine by me. >> >> Instead of going around and around about what the math says we go >> straight to the actual crux of the issue which is the meta-math. > > I'm asking about what you said. Did Gödel find a way to do what you say > is not possible in "symbolic logic", or were you wrong to say that his > proof involves self-reference? You can't be right about both. > see page 41 https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf Gödel both denies the circular nature of his proof and explains the precise details of this circular nature in the same footnote. 15 In spite of appearances, there is nothing circular about such a proposition, since it begins by asserting the unprovability of a wholly determinate formula (namely the q-th in the alphabetical arrangement with a definite substitution), and only subsequently (and in some way by accident) does it emerge that this formula is precisely that by which the proposition was itself expressed. ... proposition X, ... begins by asserting the unprovability of ... formula Y ... and only subsequently ... does it emerge that this formula Y is precisely that by which the proposition X was itself expressed. (formula Y expresses proposition X). proposition X asserts the unprovability of formula Y which expresses proposition X Gödel found an enormously convoluted way to express pathological self-reference that is much simpler with the metalanguage of MTT. X := (F ⊬ Y) Y := X becomes X := (F ⊬ X) Gödel's way of expressing pathological self-reference was so convoluted that in the same footnote that he denies circular reference he explains all of the details of exactly how the reference is indeed circular. We have to untangle his convoluted natural language grammar to most clearly see this: (see above analysis). proposition X asserts the unprovability of formula Y which expresses proposition X -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 20:07 +0100 |
| Message-ID | <87zh5784np.fsf@bsb.me.uk> |
| In reply to | #23676 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 6:43 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2020 8:12 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> Yet symbolic [logic] has no way to precisely specify actual >>>>>>> self-reference so I had to make one up. >>>>>> >>>>>> Yet you claim that Gödel's proof uses self-reference. Will you now >>>>>> retract that claim? If not, why make up a way to do it when you think >>>>>> Gödel managed it nearly a century ago? >>>>> >>>>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >>>>> >>>>> 14 Every epistemological antinomy can likewise be used for a similar >>>>> undecidability proof. (Gödel 1931) >>>>> >>>>> Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA >>>>> MATHEMATICA AND RELATED SYSTEMS I >>>>> >>>>> A theory T is incomplete if and only if there is some sentence φ such >>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>> >>>>> Instead of going around and around about what the math says... >>>> >>>> By which you mean you can see the problem (you can't be right about both >>>> your claims) so you'd rather not talk about it. OK. Fine by me. >>> >>> Instead of going around and around about what the math says we go >>> straight to the actual crux of the issue which is the meta-math. >> >> I'm asking about what you said. Did Gödel find a way to do what you say >> is not possible in "symbolic logic", or were you wrong to say that his >> proof involves self-reference? You can't be right about both. >> > > see page 41 > https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf > > Gödel both denies the circular nature of his proof and explains the > precise details of this circular nature in the same footnote. You are having a lot of trouble with this. I don't know how to be more clear. I am asking about what /you/ said, not what Gödel said. You said that something what impossible despite having claimed for years that it was exactly what certain proofs do. It makes no difference if the authors of those proofs deny or affirm it. Heck, it makes no different if the proofs are junk written by madmen. I just want to know which of your contradictory claim you now hold to be true. > Gödel found an enormously convoluted way to express pathological > self-reference Well, there's the answer! You were wrong to say that it is not possible to do it in symbolic logic. It is possible. Here "enormously convoluted" just means that you don't understand it. If you did, you would see why it can't be expressed in your semantics-free logic grammar. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 14:42 -0500 |
| Message-ID | <aLydnfYFSbE-QunCnZ2dnUU7-RfNnZ2d@giganews.com> |
| In reply to | #23681 |
On 9/30/2020 2:07 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 6:43 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/29/2020 8:12 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> Yet symbolic [logic] has no way to precisely specify actual >>>>>>>> self-reference so I had to make one up. >>>>>>> >>>>>>> Yet you claim that Gödel's proof uses self-reference. Will you now >>>>>>> retract that claim? If not, why make up a way to do it when you think >>>>>>> Gödel managed it nearly a century ago? >>>>>> >>>>>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >>>>>> >>>>>> 14 Every epistemological antinomy can likewise be used for a similar >>>>>> undecidability proof. (Gödel 1931) >>>>>> >>>>>> Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA >>>>>> MATHEMATICA AND RELATED SYSTEMS I >>>>>> >>>>>> A theory T is incomplete if and only if there is some sentence φ such >>>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>> >>>>>> Instead of going around and around about what the math says... >>>>> >>>>> By which you mean you can see the problem (you can't be right about both >>>>> your claims) so you'd rather not talk about it. OK. Fine by me. >>>> >>>> Instead of going around and around about what the math says we go >>>> straight to the actual crux of the issue which is the meta-math. >>> >>> I'm asking about what you said. Did Gödel find a way to do what you say >>> is not possible in "symbolic logic", or were you wrong to say that his >>> proof involves self-reference? You can't be right about both. >>> >> >> see page 41 >> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >> >> Gödel both denies the circular nature of his proof and explains the >> precise details of this circular nature in the same footnote. > > You are having a lot of trouble with this. I don't know how to be more > clear. I am asking about what /you/ said, not what Gödel said. > You > said that something what impossible despite having claimed for years > that it was exactly what certain proofs do. Garbled grammar. I can't make it out. > It makes no difference if > the authors of those proofs deny or affirm it. Heck, it makes no > different if the proofs are junk written by madmen. I just want to know > which of your contradictory claim you now hold to be true. > >> Gödel found an enormously convoluted way to express pathological >> self-reference > > Well, there's the answer! You were wrong to say that it is not possible > to do it in symbolic logic. It is possible. > He did not do it in symbolic logic. It can't be done in symbolic logic. He cobbled together a convoluted mess of arithmetic that seems to meet the standard definition of incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). > Here "enormously convoluted" just means that you don't understand it. > If you did, you would see why it can't be expressed in your > semantics-free logic grammar. > The above definition of incompleteness is the simplest way to express incompleteness anything added on top of that definition is extraneous and thus inessential details. When we use Minimal Type Theory to express the same incompleteness proof there is no need to artificially contrive a provability predicate from very many arithmetic expressions. We simply use the provability operator directly: ⊢. Once we eliminate the extraneous Gödel numbers from the incompleteness proof we can begin to to see why G is neither provable nor disprovable. Gödel's proof only showed that G is neither provable nor disprovable he never showed why. As soon as we see why the whole conclusion of incompleteness is refuted on the basis that its definition does not exclude ill-formed sentences. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 21:24 +0100 |
| Message-ID | <871rij813t.fsf@bsb.me.uk> |
| In reply to | #23684 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 2:07 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: <cut> >>> Gödel found an enormously convoluted way to express pathological >>> self-reference >> >> Well, there's the answer! You were wrong to say that it is not possible >> to do it in symbolic logic. It is possible. > > He did not do it in symbolic logic. It can't be done in symbolic > logic. I wonder what symbolic logic is then. Anyway, it's not what Gödel used so we know that that pathological self-reference can be expressed in other ways, ways that are not included in your supposed definition of the term. I hope you can see why no one thinks you've defined the term properly. > He cobbled together a convoluted mess of arithmetic that seems to meet > the standard definition of incompleteness: > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > >> Here "enormously convoluted" just means that you don't understand it. >> If you did, you would see why it can't be expressed in your >> semantics-free logic grammar. > When we use Minimal Type Theory to express the same incompleteness > proof there is no need to artificially contrive a provability > predicate from very many arithmetic expressions. The "cobbled together ... convoluted mess of arithmetic" is needed. You can't express Gödel's undecidable sentence in your semantics-free MTT. > We simply use the provability operator directly: ⊢. Once we eliminate > the extraneous Gödel numbers from the incompleteness proof we can > begin to to see why G is neither provable nor disprovable. Since you can't express G without arithmetic, this claim is obviously nonsense. You can express some /other/ sentence, and call it G, and it might be that one can prove that this other G is also undecidable, but not in your semantics-free MTT. > Gödel's proof only showed that G is neither provable nor disprovable > he never showed why. So you do accept that consistent theories that can express arithmetic are incomplete. That's something I suppose. > As soon as we see why the whole conclusion of incompleteness is > refuted on the basis that its definition does not exclude ill-formed > sentences. You mean /your/ G is ill formed. I'll take your word for it. To say something about Gödel's sentence, you'd have to read the paper and follow the maths. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 15:45 -0500 |
| Message-ID | <X8mdnYizpKToc-nCnZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #23691 |
On 9/30/2020 3:24 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 2:07 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: > <cut> >>>> Gödel found an enormously convoluted way to express pathological >>>> self-reference >>> >>> Well, there's the answer! You were wrong to say that it is not possible >>> to do it in symbolic logic. It is possible. >> >> He did not do it in symbolic logic. It can't be done in symbolic >> logic. > > I wonder what symbolic logic is then. Anyway, it's not what Gödel used > so we know that that pathological self-reference can be expressed in > other ways, ways that are not included in your supposed definition of > the term. I hope you can see why no one thinks you've defined the term > properly. > >> He cobbled together a convoluted mess of arithmetic that seems to meet >> the standard definition of incompleteness: >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >>> Here "enormously convoluted" just means that you don't understand it. >>> If you did, you would see why it can't be expressed in your >>> semantics-free logic grammar. > >> When we use Minimal Type Theory to express the same incompleteness >> proof there is no need to artificially contrive a provability >> predicate from very many arithmetic expressions. > > The "cobbled together ... convoluted mess of arithmetic" is needed. You > can't express Gödel's undecidable sentence in your semantics-free MTT. > >> We simply use the provability operator directly: ⊢. Once we eliminate >> the extraneous Gödel numbers from the incompleteness proof we can >> begin to to see why G is neither provable nor disprovable. > > Since you can't express G without arithmetic, this claim is obviously > nonsense. You can express some /other/ sentence, and call it G, and it > might be that one can prove that this other G is also undecidable, but > not in your semantics-free MTT. > >> Gödel's proof only showed that G is neither provable nor disprovable >> he never showed why. > > So you do accept that consistent theories that can express arithmetic > are incomplete. That's something I suppose. > >> As soon as we see why the whole conclusion of incompleteness is >> refuted on the basis that its definition does not exclude ill-formed >> sentences. > > You mean /your/ G is ill formed. I'll take your word for it. To say > something about Gödel's sentence, you'd have to read the paper and > follow the maths. > It has never been the math that has ever mattered it has only been the meta-math. We really can express the meta-math without the math, yet we need a meta-language to do this. That you don't seem to be able to understand that the the Incompleteness proof is about the meta-math of provability and not the arithmetic that he used to arificially contrive the equivalent of a provability prodicate shows that you don't really understand these things beyond a learned by rote depth. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 21:32 -0600 |
| Message-ID | <rl0u86$bli$1@dont-email.me> |
| In reply to | #23650 |
On 2020-09-29 18:40, olcott wrote: > On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Yet symbolic [logic] has no way to precisely specify actual >>> self-reference so I had to make one up. >> >> Yet you claim that Gödel's proof uses self-reference. Will you now >> retract that claim? If not, why make up a way to do it when you think >> Gödel managed it nearly a century ago? >> > > https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf > > > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931) Which is his way of saying the proof was loosely inspired by the antinomy, not that it contains a formalization of that antinomy. James Watson claims that his discovery of the double-helix structure of DNA was inspired by a dream of two intertwined snakes. That doesn't mean that there are snakes in DNA, or in his theory of DNA (Watson doesn't specify whether these snakes tempted him into stealing Rosalind Franklin's research which likely played a more significant role in "his" discovery than the snakes did). Gödel's math stands on its own. Coming up with contrived interpretations of a footnote isn't going to change it. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 22:47 -0500 |
| Message-ID | <fYqdnRyLNqJ-Yu7CnZ2dnUU7-InNnZ2d@giganews.com> |
| In reply to | #23659 |
On 9/29/2020 10:32 PM, André G. Isaak wrote: > On 2020-09-29 18:40, olcott wrote: >> On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> Yet symbolic [logic] has no way to precisely specify actual >>>> self-reference so I had to make one up. >>> >>> Yet you claim that Gödel's proof uses self-reference. Will you now >>> retract that claim? If not, why make up a way to do it when you think >>> Gödel managed it nearly a century ago? >>> >> >> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf >> >> >> 14 Every epistemological antinomy can likewise be used for a similar >> undecidability proof. (Gödel 1931) > > Which is his way of saying the proof was loosely inspired by the > antinomy, not that it contains a formalization of that antinomy. > Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931) Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931) Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931) > James Watson claims that his discovery of the double-helix structure of > DNA was inspired by a dream of two intertwined snakes. That doesn't mean > that there are snakes in DNA, or in his theory of DNA (Watson doesn't > specify whether these snakes tempted him into stealing Rosalind > Franklin's research which likely played a more significant role in "his" > discovery than the snakes did). > > Gödel's math stands on its own. Coming up with contrived interpretations > of a footnote isn't going to change it. > > André It is not and never has been the math that counts. It is and always has been the meta math that counts. The verifiable fact that the Liar Paradox meets this spec: (Tarski based his whole proof on the liar Paradox) A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). And the only reason why the Liar Paradox cannot be proved or disproved is that it is infinitely recursive proves that the foundational basis of the definition of incompleteness is incorrect. You already agreed that the truth teller paradox is vacuous what's up with your position now? -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2020-09-29 21:29 -0700 |
| Message-ID | <87sgaz99b2.fsf@nosuchdomain.example.com> |
| In reply to | #23659 |
André G. Isaak <agisaak@gm.invalid> writes:
[...]
> James Watson claims that his discovery of the double-helix structure
> of DNA was inspired by a dream of two intertwined snakes. That doesn't
> mean that there are snakes in DNA, or in his theory of DNA (Watson
> doesn't specify whether these snakes tempted him into stealing
> Rosalind Franklin's research which likely played a more significant
> role in "his" discovery than the snakes did).
[...]
I haven't heard that. Are you thinking of Kekule's discovery of the
ring structure of benzene via a daydreame of a snake biting its own
tail?
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 22:54 -0600 |
| Message-ID | <rl131k$1mq$1@dont-email.me> |
| In reply to | #23663 |
On 2020-09-29 22:29, Keith Thompson wrote: > André G. Isaak <agisaak@gm.invalid> writes: > [...] >> James Watson claims that his discovery of the double-helix structure >> of DNA was inspired by a dream of two intertwined snakes. That doesn't >> mean that there are snakes in DNA, or in his theory of DNA (Watson >> doesn't specify whether these snakes tempted him into stealing >> Rosalind Franklin's research which likely played a more significant >> role in "his" discovery than the snakes did). > [...] > > I haven't heard that. Are you thinking of Kekule's discovery of the > ring structure of benzene via a daydreame of a snake biting its own > tail? No. I was aware of benzene anecdote, but was definitely thinking of Watson. Whether the story is apocryphal is another matter. A quick web search finds a variety of links but none which strike me as particularly reputable. Here's one example. https://uh.edu/engines/epi1868.htm André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2020-09-29 22:47 -0700 |
| Message-ID | <87o8ln95oz.fsf@nosuchdomain.example.com> |
| In reply to | #23664 |
André G. Isaak <agisaak@gm.invalid> writes:
> On 2020-09-29 22:29, Keith Thompson wrote:
>> André G. Isaak <agisaak@gm.invalid> writes:
>> [...]
>>> James Watson claims that his discovery of the double-helix structure
>>> of DNA was inspired by a dream of two intertwined snakes. That doesn't
>>> mean that there are snakes in DNA, or in his theory of DNA (Watson
>>> doesn't specify whether these snakes tempted him into stealing
>>> Rosalind Franklin's research which likely played a more significant
>>> role in "his" discovery than the snakes did).
>> [...]
>>
>> I haven't heard that. Are you thinking of Kekule's discovery of the
>> ring structure of benzene via a daydreame of a snake biting its own
>> tail?
>
> No. I was aware of benzene anecdote, but was definitely thinking of
> Watson. Whether the story is apocryphal is another matter.
>
> A quick web search finds a variety of links but none which strike me
> as particularly reputable. Here's one example.
>
> https://uh.edu/engines/epi1868.htm
The Kekule story is fairly well known. I wonder if somebody (not you)
conflated the two.
https://en.wikipedia.org/wiki/List_of_dreams#Double_Helix_structure_of_DNA
refers to Watson giving a TED talk mentioning a dream of a spiral staircase.
Completely irrelevant, of course, but what the heck.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-30 06:33 -0600 |
| Message-ID | <rl1tuk$qgi$1@dont-email.me> |
| In reply to | #23665 |
On 2020-09-29 23:47, Keith Thompson wrote: > The Kekule story is fairly well known. I wonder if somebody (not you) > conflated the two. That sounds like a reasonable hypothesis. I don't recall where I first encountered this claim, and none of the sites which I found that mention it seem particularly scholarly so it may well simply be a mistake that has propagated. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 16:40 -0600 |
| Message-ID | <rl0d5q$o0q$1@dont-email.me> |
| In reply to | #23646 |
On 2020-09-29 14:47, olcott wrote: > On 9/29/2020 3:06 PM, André G. Isaak wrote: >> On 2020-09-29 13:34, olcott wrote: >>> On 9/29/2020 1:40 PM, André G. Isaak wrote: >>>> On 2020-09-29 10:31, olcott wrote: >>>> >>>>> I rewrote my grammar to correct the error that you caught, now it >>>>> simply rejects the sample expressions that you provided as ill-formed. >>>>> >>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>> >>>> >>>> >>>> >>>> >>>> Not quite. You added a new category, "definition", but you still >>>> list your := under "sentence" as well. You want to remove it from that. >>>> >>> >>> Clearly you do not understand YACC BNF. >>> definition is list OVER sentence not UNDER it. >> >> IDENTIFIER ASSIGN_ALIAS sentence >> >> appears in *both* lists. >> > > You are right again. I only changed the fully executable YACC that has > semantic actions. I did not change the one in my paper. It is fixed now. Right, so when I pointed this out it might have been better for you to have double-checked the paper rather than immediately claiming that I didn't understand YACC. >>> The outermost part of a logical expression is either a definition or >>> it has no definition at all. >>> >>>> You now need to define what a 'definition' is in the semantics. By >>> >>> Unless it detects pathological self-reference it is only macro >>> substitution has zero semantics what-so-ever. >>> >>>> placing it in a separate category you are clearly affirming that it >>>> isn't something like a sentence, i.e. a boolean expression. So what >>>> exactly is it? >>>> >>> >>> It is a way for people to see that when pathological self-reference >>> is specified that an infinite expression cannot be evaluated. If we >>> use mathematical conventions we might consider pathological >>> self-reference as the same sort of thing as dividing by zero. >> >> Except that you are trying to claim that X := ¬X is a translation of >> 'this sentence is false'. >> > > It is as close as I can get in mathematics. To get closer than this it > seems that we have to move to computer science. > >> It isn't. It is a translation of 'X is defined as ¬X', which is not >> the same thing. > > > http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf > > The fact that even as macro expansion it specifies an infinite term that > cannot be evaluated is as close as I can get to saying this in math. > >> >> 'This sentence is false' is an assertion, not a definition. As such, it > > Yet symbolic has no way to precisely specify actual self-reference so I > had to make one up. Except your made up way doesn't actually capture this. >> would need to be categorized as a sentence rather than a definition in >> your grammar. But your grammar lacks any way of translating "this >> sentence". Definitions or "macro expansion" don't capture this. >> > > They capture it closer than anything else that I can think of. > LP := ~AnyPedicateAtALL(LP) // specifies an infinite term > > All the other ideas that everyone else has is: "lets simply ignore > pathogical self-reference because there is no way to say it using > symbolic logic." There is, of course, another, far more sensible alternative. Since the liar's paradox is something that arises in natural language but not in logic, discuss it in natural language rather than in the language of logic. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 19:51 -0500 |
| Message-ID | <Vf6dnbl7su4TS-7CnZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #23649 |
On 9/29/2020 5:40 PM, André G. Isaak wrote: > On 2020-09-29 14:47, olcott wrote: >> On 9/29/2020 3:06 PM, André G. Isaak wrote: >>> On 2020-09-29 13:34, olcott wrote: >>>> On 9/29/2020 1:40 PM, André G. Isaak wrote: >>>>> On 2020-09-29 10:31, olcott wrote: >>>>> >>>>>> I rewrote my grammar to correct the error that you caught, now it >>>>>> simply rejects the sample expressions that you provided as >>>>>> ill-formed. >>>>>> >>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>>> >>>>> >>>>> >>>>> >>>>> >>>>> >>>>> Not quite. You added a new category, "definition", but you still >>>>> list your := under "sentence" as well. You want to remove it from >>>>> that. >>>>> >>>> >>>> Clearly you do not understand YACC BNF. >>>> definition is list OVER sentence not UNDER it. >>> >>> IDENTIFIER ASSIGN_ALIAS sentence >>> >>> appears in *both* lists. >>> >> >> You are right again. I only changed the fully executable YACC that has >> semantic actions. I did not change the one in my paper. It is fixed now. > > Right, so when I pointed this out it might have been better for you to > have double-checked the paper rather than immediately claiming that I > didn't understand YACC. > In retrospect it would have been much better. >>>> The outermost part of a logical expression is either a definition or >>>> it has no definition at all. >>>> >>>>> You now need to define what a 'definition' is in the semantics. By >>>> >>>> Unless it detects pathological self-reference it is only macro >>>> substitution has zero semantics what-so-ever. >>>> >>>>> placing it in a separate category you are clearly affirming that it >>>>> isn't something like a sentence, i.e. a boolean expression. So what >>>>> exactly is it? >>>>> >>>> >>>> It is a way for people to see that when pathological self-reference >>>> is specified that an infinite expression cannot be evaluated. If we >>>> use mathematical conventions we might consider pathological >>>> self-reference as the same sort of thing as dividing by zero. >>> >>> Except that you are trying to claim that X := ¬X is a translation of >>> 'this sentence is false'. >>> >> >> It is as close as I can get in mathematics. To get closer than this it >> seems that we have to move to computer science. >> >>> It isn't. It is a translation of 'X is defined as ¬X', which is not >>> the same thing. >> >> >> http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf >> >> The fact that even as macro expansion it specifies an infinite term >> that cannot be evaluated is as close as I can get to saying this in math. >> >>> >>> 'This sentence is false' is an assertion, not a definition. As such, it >> >> Yet symbolic has no way to precisely specify actual self-reference so >> I had to make one up. > > Except your made up way doesn't actually capture this. Sure it does. In computer science #define LP !True(LP) would specify copying the string !True(!True(!True(...))) an infinite number of times. In Math LP := ~True(LP) we are only dealing with concepts not finite strings making the expression infitely recursive. > >>> would need to be categorized as a sentence rather than a definition >>> in your grammar. But your grammar lacks any way of translating "this >>> sentence". Definitions or "macro expansion" don't capture this. >>> >> >> They capture it closer than anything else that I can think of. >> LP := ~AnyPedicateAtALL(LP) // specifies an infinite term >> >> All the other ideas that everyone else has is: "lets simply ignore >> pathogical self-reference because there is no way to say it using >> symbolic logic." > > There is, of course, another, far more sensible alternative. Since the > liar's paradox is something that arises in natural language but not in > logic, The ONLY reason why it does no arise in logic is because nobody ever bothered to translate it to logic. The Liar Paradox is merely a proposition that makes an assertion about its own truth value. It need not know anything about the world. It was obvious to you that the truth teller paradox is vacuous. "This sentence is true." True about what? True about being true. True about being true about what? The Liar Paradox also lack a truth object, it is vacuous. Because it is vacuous it meets this definition: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). Vacuous sentences can neither be proved nor disproved because they are vacuous. > discuss it in natural language rather than in the language of logic. > > André > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 02:38 +0100 |
| Message-ID | <877dscavs5.fsf@bsb.me.uk> |
| In reply to | #23651 |
olcott <NoOne@NoWhere.com> writes: This is just an aside... > In computer science > #define LP !True(LP) > would specify copying the string !True(!True(!True(...))) an infinite > number of times. Why do you say "would"? It might or it might not depending on the notation. This looks like a C (or C++) macro, and in C, using LP does /not/ produce infinite recursion. But in other macro processors, such as m4, using a similarly defined name (it's written define(LP,!True(LP)) in m4) would behave as you describe. And in other notations, such as Haskell, writing such "circular" definitions is common and very useful. > In Math The maths/CS distinction you make is an artificial one. If you were a normal student, keen to lean about how this stuff is handled in mathematics, I'd suggest you read up about fixed-point theorems and the Y combinator, but I don't suppose there is any chance you will. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 21:46 -0500 |
| Message-ID | <UfWdnW-DDZXrbO7CnZ2dnUU7-UPNnZ2d@giganews.com> |
| In reply to | #23653 |
On 9/29/2020 8:38 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > > This is just an aside... > >> In computer science >> #define LP !True(LP) >> would specify copying the string !True(!True(!True(...))) an infinite >> number of times. > > Why do you say "would"? It might or it might not depending on the > notation. This looks like a C (or C++) macro, and in C, using LP does > /not/ produce infinite recursion. > The C/C++ macro preprocessor recognizes the pathological self-reference and: "The self-reference rule cuts this process short after one step" https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html > But in other macro processors, such as m4, using a similarly defined > name (it's written define(LP,!True(LP)) in m4) would behave as you > describe. > The idea is that the meta-mathematics of pathological self-reference determines that an expression cannot be evaluated because it is ill-formed. > And in other notations, such as Haskell, writing such "circular" > definitions is common and very useful. > >> In Math > > The maths/CS distinction you make is an artificial one. If you were a The key distinction is that on the CS side we can have programs that process finite strings that represent the mathematical expressions. On the math side this has to be all done in one's head, thus leaving room for gaps in reasoning that are not detected by software. > normal student, keen to lean about how this stuff is handled in > mathematics, I'd suggest you read up about fixed-point theorems and the > Y combinator, but I don't suppose there is any chance you will. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-09-30 06:45 +0000 |
| Message-ID | <rl19hm$1epi$1@news.muc.de> |
| In reply to | #23655 |
olcott <NoOne@nowhere.com> wrote: > On 9/29/2020 8:38 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> This is just an aside... >>> In computer science >>> #define LP !True(LP) >>> would specify copying the string !True(!True(!True(...))) an infinite >>> number of times. >> Why do you say "would"? It might or it might not depending on the >> notation. This looks like a C (or C++) macro, and in C, using LP does >> /not/ produce infinite recursion. > The C/C++ macro preprocessor recognizes the pathological self-reference > and: "The self-reference rule cuts this process short after one step" > https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html I think (but I'm not sure) it's more a case of the symbol LP not yet being defined when the body of the macro LP is being expanded. >> But in other macro processors, such as m4, using a similarly defined >> name (it's written define(LP,!True(LP)) in m4) would behave as you >> describe. Yes. C's macros are really not that powerful, certainly when compared with Lisp's. > The idea is that the meta-mathematics of pathological self-reference > determines that an expression cannot be evaluated because it is ill-formed. >> And in other notations, such as Haskell, writing such "circular" >> definitions is common and very useful. [ .... ] > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 12:40 +0100 |
| Message-ID | <87sgaza3wh.fsf@bsb.me.uk> |
| In reply to | #23655 |
olcott <NoOne@NoWhere.com> writes: > On 9/29/2020 8:38 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >> This is just an aside... >> >>> In computer science >>> #define LP !True(LP) >>> would specify copying the string !True(!True(!True(...))) an infinite >>> number of times. >> >> Why do you say "would"? It might or it might not depending on the >> notation. This looks like a C (or C++) macro, and in C, using LP does >> /not/ produce infinite recursion. > > The C/C++ macro preprocessor recognizes the pathological > self-reference and: "The self-reference rule cuts this process short > after one step" > https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html I am not lacking information about C. I asked about your use of words. You said, in essence, that "X would mean Y if it didn't mean what it actually means". I just think you could put that more clearly. Maybe that it /appears/ to define an infinite expansion, but it isn't. > The idea is that the meta-mathematics of pathological self-reference > determines that an expression cannot be evaluated because it is > ill-formed. That's not an idea until you can define "pathological self-reference", something you have failed to be able to do for more than a decade, and not, I presume, for lack of trying. >> And in other notations, such as Haskell, writing such "circular" >> definitions is common and very useful. >> >>> In Math >> >> The maths/CS distinction you make is an artificial one. If you were a > > The key distinction is that on the CS side we can have programs that > process finite strings that represent the mathematical expressions. > > On the math side this has to be all done in one's head, thus leaving > room for gaps in reasoning that are not detected by software. This is just waffling unless you can back it up either with examples or, better yet, and actual definition of (a) self-reference, and (b) when it is "pathological". >> normal student, keen to lean about how this stuff is handled in >> mathematics, I'd suggest you read up about fixed-point theorems and the >> Y combinator, but I don't suppose there is any chance you will. I thought so. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 10:58 -0500 |
| Message-ID | <R7mdnc1ok-GONunCnZ2dnUU7-bfNnZ2d@giganews.com> |
| In reply to | #23669 |
On 9/30/2020 6:40 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/29/2020 8:38 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>> This is just an aside... >>> >>>> In computer science >>>> #define LP !True(LP) >>>> would specify copying the string !True(!True(!True(...))) an infinite >>>> number of times. >>> >>> Why do you say "would"? It might or it might not depending on the >>> notation. This looks like a C (or C++) macro, and in C, using LP does >>> /not/ produce infinite recursion. >> >> The C/C++ macro preprocessor recognizes the pathological >> self-reference and: "The self-reference rule cuts this process short >> after one step" >> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html > > I am not lacking information about C. I asked about your use of words. > You said, in essence, that "X would mean Y if it didn't mean what it > actually means". I just think you could put that more clearly. Maybe > that it /appears/ to define an infinite expansion, but it isn't. > LP := ~True(LP) G := ~Provable(G) both specify infinite expansion when the rule is to replace every instance of the variable on the LHS that occurs within the body on the RHS with the body of the RHS. LP := ~True(LP) becomes LP := ~True(~True(LP)) becomes ~True(~True(~True(...))) ad infinitum. >> The idea is that the meta-mathematics of pathological self-reference >> determines that an expression cannot be evaluated because it is >> ill-formed. > > That's not an idea until you can define "pathological self-reference", > something you have failed to be able to do for more than a decade, and > not, I presume, for lack of trying. I define it correctly and you ignore what I said or make an empty unsupported assertions that I am incorrect without pointing out any error. Even ELIZA could be a mere naysayer: https://en.wikipedia.org/wiki/ELIZA I have long suspected that the reason that you do not support your assertions that I am incorrect is because you don't really hardly understand this material at all. You have a reasonbly good learned by rote, yet without any deep understanding at all. This will fool most people that also only have a learned by rote understanding. > >>> And in other notations, such as Haskell, writing such "circular" >>> definitions is common and very useful. >>> >>>> In Math >>> >>> The maths/CS distinction you make is an artificial one. If you were a >> >> The key distinction is that on the CS side we can have programs that >> process finite strings that represent the mathematical expressions. >> >> On the math side this has to be all done in one's head, thus leaving >> room for gaps in reasoning that are not detected by software. > > This is just waffling unless you can back it up either with examples or, > better yet, and actual definition of (a) self-reference, and (b) when it > is "pathological". > When-so-ever the LHS of a := define operator appears anywhere on the RHS of this same expression infinite recursion is specified. X := ¬(P ∨ Q) ↔ (¬P ∧ ¬Q) In the above case we can simply say that X is true. In the following cases we can say that the truth value is vacuous: LP := ~True(LP) G := ~Provable(G) >>> normal student, keen to lean about how this stuff is handled in >>> mathematics, I'd suggest you read up about fixed-point theorems and the >>> Y combinator, but I don't suppose there is any chance you will. > > I thought so. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 2 of 21 — ← Prev page 1 [2] 3 4 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web