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 16 of 21 — ← Prev page 1 … 14 15 [16] 17 18 … 21 Next page →
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-15 20:32 +0000 |
| Message-ID | <rmablk$1vvs$1@news.muc.de> |
| In reply to | #23872 |
olcott <NoOne@nowhere.com> wrote: > Is it undecided or undecidable propositions that prove incompleteness? Undecidable propositions. > Is Gödel's proof based on "We don't know the answer to this question yet > therefore all formal systems are necessarily permanently incomplete?" No. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-15 15:36 -0500 |
| Message-ID | <Bs2dnXtn88orLxXCnZ2dnUU7-fOdnZ2d@giganews.com> |
| In reply to | #23875 |
On 10/15/2020 3:32 PM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: > >> Is it undecided or undecidable propositions that prove incompleteness? > > Undecidable propositions. > Good answer. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2020-10-13 21:20 +0100 |
| Message-ID | <rm525p$khm$1@gioia.aioe.org> |
| In reply to | #23804 |
On 13/10/2020 16:12, olcott wrote: > My whole point is to get closer to the truth by describing things > more accurately. The literal truth is that these propositions are > only "undecidable" because they are not truth bearers. No, that's not the "literal truth". A proposition P is undecidable because neither P nor not-P follows from a given set of axioms. It's always contextual. Depending on what axioms are chosen, P may be undecidable, or provably true, or provably false, or both [if you happen, unfortunately, to have chosen axioms that are contradictory]. It's difficult to see why "an incorrect expression of language" is more accurate than a purely technical and widely-understood term. It's not surprising that you find this confusing. There was a general expectation 120 years ago that maths consisted of eternal truths, if only we could be clever enough with proofs or refutations of conjectures. Godel threw a very large spanner into those works. From a more modern perspective, it's easier to see what is going on, through the similar results in computing. -- Andy Walker, Nottingham. Andy's music pages: www.cuboid.me.uk/andy/Music Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Daquin
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-13 15:37 -0500 |
| Message-ID | <A5CdnVmHcZibjRvCnZ2dnUU7-ePNnZ2d@giganews.com> |
| In reply to | #23813 |
On 10/13/2020 3:20 PM, Andy Walker wrote: > On 13/10/2020 16:12, olcott wrote: >> My whole point is to get closer to the truth by describing things >> more accurately. The literal truth is that these propositions are >> only "undecidable" because they are not truth bearers. > > No, that's not the "literal truth". A proposition P is > undecidable because neither P nor not-P follows from a given set > of axioms. It's always contextual. Depending on what axioms are > chosen, P may be undecidable, or provably true, or provably false, > or both [if you happen, unfortunately, to have chosen axioms that > are contradictory]. It's difficult to see why "an incorrect > expression of language" is more accurate than a purely technical > and widely-understood term. > The problem is that formal systems are decided to be incomplete on the basis of their inability to prove or disprove "incorrect expressions of language". That is analogous to deciding that a medical doctor is incompetent entirely on the basis that he cannot raise the dead. > It's not surprising that you find this confusing. There > was a general expectation 120 years ago that maths consisted of > eternal truths, if only we could be clever enough with proofs or > refutations of conjectures. Godel threw a very large spanner into > those works. From a more modern perspective, it's easier to see > what is going on, through the similar results in computing. > He only did this entirely on the basis of an incorrect definition which is merely another way of saying that he never really did this. I am also almost done with my halting problem refutation. It took me at least a man year to create x86utm, the operating system foundation for running my partial halt decider. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-13 23:43 +0100 |
| Message-ID | <87sgah4uig.fsf@bsb.me.uk> |
| In reply to | #23814 |
olcott <NoOne@NoWhere.com> writes: > I am also almost done with my halting problem refutation. The one you had claimed to have fully worked out almost two years ago? > It took me at least a man year to create x86utm, the operating system > foundation for running my partial halt decider. What is your current excuse for the /other/ year you wasted, during which you could have posted the "actual Turing machines" you lied about having "fully encoded" back in Dec 2018? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-13 19:42 -0500 |
| Message-ID | <UbOdnRNumNsZ1BvCnZ2dnUU7-bOdnZ2d@giganews.com> |
| In reply to | #23819 |
On 10/13/2020 5:43 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> I am also almost done with my halting problem refutation. > > The one you had claimed to have fully worked out almost two years ago? > >> It took me at least a man year to create x86utm, the operating system >> foundation for running my partial halt decider. > > What is your current excuse for the /other/ year you wasted, during > which you could have posted the "actual Turing machines" you lied about > having "fully encoded" back in Dec 2018? > You are simply goofy. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-14 05:46 -0600 |
| Message-ID | <rm6oe8$rvh$1@dont-email.me> |
| In reply to | #23814 |
On 2020-10-13 14:37, olcott wrote: > On 10/13/2020 3:20 PM, Andy Walker wrote: >> On 13/10/2020 16:12, olcott wrote: >>> My whole point is to get closer to the truth by describing things >>> more accurately. The literal truth is that these propositions are >>> only "undecidable" because they are not truth bearers. >> >> No, that's not the "literal truth". A proposition P is >> undecidable because neither P nor not-P follows from a given set >> of axioms. It's always contextual. Depending on what axioms are >> chosen, P may be undecidable, or provably true, or provably false, >> or both [if you happen, unfortunately, to have chosen axioms that >> are contradictory]. It's difficult to see why "an incorrect >> expression of language" is more accurate than a purely technical >> and widely-understood term. >> > > The problem is that formal systems are decided to be incomplete on the > basis of their inability to prove or disprove "incorrect expressions of > language". That is analogous to deciding that a medical doctor is > incompetent entirely on the basis that he cannot raise the dead. > >> It's not surprising that you find this confusing. There >> was a general expectation 120 years ago that maths consisted of >> eternal truths, if only we could be clever enough with proofs or >> refutations of conjectures. Godel threw a very large spanner into >> those works. From a more modern perspective, it's easier to see >> what is going on, through the similar results in computing. >> > > He only did this entirely on the basis of an incorrect definition which > is merely another way of saying that he never really did this. There is no sense in which a technical definition can be "incorrect". André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-14 10:46 -0500 |
| Message-ID | <TaGdnf06CuXQgBrCnZ2dnUU7-LvNnZ2d@giganews.com> |
| In reply to | #23828 |
On 10/14/2020 6:46 AM, André G. Isaak wrote: > On 2020-10-13 14:37, olcott wrote: >> On 10/13/2020 3:20 PM, Andy Walker wrote: >>> On 13/10/2020 16:12, olcott wrote: >>>> My whole point is to get closer to the truth by describing things >>>> more accurately. The literal truth is that these propositions are >>>> only "undecidable" because they are not truth bearers. >>> >>> No, that's not the "literal truth". A proposition P is >>> undecidable because neither P nor not-P follows from a given set >>> of axioms. It's always contextual. Depending on what axioms are >>> chosen, P may be undecidable, or provably true, or provably false, >>> or both [if you happen, unfortunately, to have chosen axioms that >>> are contradictory]. It's difficult to see why "an incorrect >>> expression of language" is more accurate than a purely technical >>> and widely-understood term. >>> >> >> The problem is that formal systems are decided to be incomplete on the >> basis of their inability to prove or disprove "incorrect expressions >> of language". That is analogous to deciding that a medical doctor is >> incompetent entirely on the basis that he cannot raise the dead. >> >>> It's not surprising that you find this confusing. There >>> was a general expectation 120 years ago that maths consisted of >>> eternal truths, if only we could be clever enough with proofs or >>> refutations of conjectures. Godel threw a very large spanner into >>> those works. From a more modern perspective, it's easier to see >>> what is going on, through the similar results in computing. >>> >> >> He only did this entirely on the basis of an incorrect definition >> which is merely another way of saying that he never really did this. > > There is no sense in which a technical definition can be "incorrect". > > André > > Sure there is. When-so-ever any definition is added to a system of reasoning and this addition causes the system to become incoherent the definition is incorrect. We could add the definition to PA that 2 + 3 = 5 is incorrect and this would make PA inconsistent. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-14 00:42 -0600 |
| Message-ID | <rm66kf$a0u$1@dont-email.me> |
| In reply to | #23804 |
On 2020-10-13 09:12, olcott wrote: > On 10/13/2020 5:14 AM, Andy Walker wrote: >> On 13/10/2020 02:21, olcott wrote: >>> "Incorrect expressions of language" are the exact same set that was >>> previously called "undecidable propositions. >> >> When my daughter was just four, and wanted to be five so that >> she could go to "big school", she came to me one day and said "Daddy, >> why do we have to have four?" "Well, if we didn't, how would you >> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >> "So you would now be 5, and you'd go to school next year when you >> will be 7?" She saw the point and laughed. >> >> If PO wants to call "incorrect expressions of language" what >> the rest of us call "undecidable propositions", then it's confusing, >> but it doesn't change the world. It just makes it an "incorrect >> expression of language" to ask for an algorithm to determine whether >> or not a given "expression of language" is an "incorrect expression >> of language". If PO, or anyone else, can explain *why* this change >> of wording helps anything, then perhaps the world will switch to it. >> Don't hold your breath; my guess is that the rest of the world will >> continue to describe propositions that provably have neither proofs >> nor disproofs as "undecidable" rather than as "incorrect expressions >> of language". It's shorter, and better describes what has happened, >> not least because it doesn't convey any impression that someone has >> made a mistake. >> > > My whole point is to get closer to the truth by describing things more > accurately. The literal truth is that these propositions are only > "undecidable" because they are not truth bearers. Until you provide a workable definition of 'truth bearer' the above isn't meaningful. If you consider any formal system which is sufficiently powerful to express claims about arithmetic over the natural numbers, you can divide all propositions into the following categories: (1) Those which have been proven to be true. (2) Those which have been proven to be false. (3) Those which have been proven to be undecidable. (4) Those for which no one has (yet) been able to provide a proof that they are either true or false. Some of these may be undecidable. Some may be decidable but simply haven't yet been proven. (5) Those which no one has ever looked at or attempted to prove or disprove. You would claim that (1) and (2) are truth-bearers and that (3) are not. But what do you do with (4) and (5) (the latter being by far the largest category of propositions). Given some arbitrary proposition φ, how do you determine whether it should be treated as a truth-bearer or not? If your system rules out some propositions as 'ill-formed' but can't actually tell us whether a given proposition is well-formed or not, then it isn't a particularly useful system. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-14 10:42 -0500 |
| Message-ID | <ZNidndmAaeLsgRrCnZ2dnUU7-QHNnZ2d@giganews.com> |
| In reply to | #23827 |
On 10/14/2020 1:42 AM, André G. Isaak wrote: > On 2020-10-13 09:12, olcott wrote: >> On 10/13/2020 5:14 AM, Andy Walker wrote: >>> On 13/10/2020 02:21, olcott wrote: >>>> "Incorrect expressions of language" are the exact same set that was >>>> previously called "undecidable propositions. >>> >>> When my daughter was just four, and wanted to be five so that >>> she could go to "big school", she came to me one day and said "Daddy, >>> why do we have to have four?" "Well, if we didn't, how would you >>> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >>> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >>> "So you would now be 5, and you'd go to school next year when you >>> will be 7?" She saw the point and laughed. >>> >>> If PO wants to call "incorrect expressions of language" what >>> the rest of us call "undecidable propositions", then it's confusing, >>> but it doesn't change the world. It just makes it an "incorrect >>> expression of language" to ask for an algorithm to determine whether >>> or not a given "expression of language" is an "incorrect expression >>> of language". If PO, or anyone else, can explain *why* this change >>> of wording helps anything, then perhaps the world will switch to it. >>> Don't hold your breath; my guess is that the rest of the world will >>> continue to describe propositions that provably have neither proofs >>> nor disproofs as "undecidable" rather than as "incorrect expressions >>> of language". It's shorter, and better describes what has happened, >>> not least because it doesn't convey any impression that someone has >>> made a mistake. >>> >> >> My whole point is to get closer to the truth by describing things more >> accurately. The literal truth is that these propositions are only >> "undecidable" because they are not truth bearers. > > Until you provide a workable definition of 'truth bearer' the above > isn't meaningful. > What you really mean as that as soon as I provide a workable definition of truth bearer the required number times so that yo quit ignoring that I have already done this many hundreds of times. ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) > If you consider any formal system which is sufficiently powerful to > express claims about arithmetic over the natural numbers, you can divide > all propositions into the following categories: > > (1) Those which have been proven to be true. > (2) Those which have been proven to be false. > (3) Those which have been proven to be undecidable. All of the ones that are undecidable are undecidable for the same sort of reason that no one can decide the correct answer to the following question: What time is it (yes or no)? The barber shaves everyone that does not shave themselves. No he does not that is simply a lie. > (4) Those for which no one has (yet) been able to provide a proof that > they are either true or false. Some of these may be undecidable. Some > may be decidable but simply haven't yet been proven. > (5) Those which no one has ever looked at or attempted to prove or > disprove. > > You would claim that (1) and (2) are truth-bearers and that (3) are not. > > But what do you do with (4) and (5) (the latter being by far the largest > category of propositions). > > Given some arbitrary proposition φ, how do you determine whether it > should be treated as a truth-bearer or not? > > If your system rules out some propositions as 'ill-formed' but can't > actually tell us whether a given proposition is well-formed or not, then > it isn't a particularly useful system. > > André > That is like saying that any scientist that is not all knowing is utterly useless. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-14 10:44 -0600 |
| Message-ID | <rm79sv$2nb$1@dont-email.me> |
| In reply to | #23836 |
On 2020-10-14 09:42, olcott wrote: > On 10/14/2020 1:42 AM, André G. Isaak wrote: >> On 2020-10-13 09:12, olcott wrote: >>> On 10/13/2020 5:14 AM, Andy Walker wrote: >>>> On 13/10/2020 02:21, olcott wrote: >>>>> "Incorrect expressions of language" are the exact same set that was >>>>> previously called "undecidable propositions. >>>> >>>> When my daughter was just four, and wanted to be five so that >>>> she could go to "big school", she came to me one day and said "Daddy, >>>> why do we have to have four?" "Well, if we didn't, how would you >>>> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >>>> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >>>> "So you would now be 5, and you'd go to school next year when you >>>> will be 7?" She saw the point and laughed. >>>> >>>> If PO wants to call "incorrect expressions of language" what >>>> the rest of us call "undecidable propositions", then it's confusing, >>>> but it doesn't change the world. It just makes it an "incorrect >>>> expression of language" to ask for an algorithm to determine whether >>>> or not a given "expression of language" is an "incorrect expression >>>> of language". If PO, or anyone else, can explain *why* this change >>>> of wording helps anything, then perhaps the world will switch to it. >>>> Don't hold your breath; my guess is that the rest of the world will >>>> continue to describe propositions that provably have neither proofs >>>> nor disproofs as "undecidable" rather than as "incorrect expressions >>>> of language". It's shorter, and better describes what has happened, >>>> not least because it doesn't convey any impression that someone has >>>> made a mistake. >>>> >>> >>> My whole point is to get closer to the truth by describing things >>> more accurately. The literal truth is that these propositions are >>> only "undecidable" because they are not truth bearers. >> >> Until you provide a workable definition of 'truth bearer' the above >> isn't meaningful. >> > > What you really mean as that as soon as I provide a workable definition > of truth bearer the required number times so that yo quit ignoring that > I have already done this many hundreds of times. > > ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) By a workable definition, I mean a definition which will allow you to determine which things are true bearers and which are not. The above doesn't do that because, as has been pointed out several times, there is no general method for deciding whether a proposition is actually decidable. There is no way, given some arbitrary proposition φ, to determine whether φ or its negation are provable φ. That's one of the reasons why provability is not included as an operator in standard logics but only in the metalanguage. You are effectively saying that there are 'ill-formed propositions' which can be ignored, but that you cannot tell us which ones they are. >> If you consider any formal system which is sufficiently powerful to >> express claims about arithmetic over the natural numbers, you can >> divide all propositions into the following categories: >> >> (1) Those which have been proven to be true. >> (2) Those which have been proven to be false. >> (3) Those which have been proven to be undecidable. > > All of the ones that are undecidable are undecidable for the same sort > of reason that no one can decide the correct answer to the following > question: What time is it (yes or no)? No, they are not. Lots of perfectly meaningful and interesting propositions are undecidable. > The barber shaves everyone that does not shave themselves. > No he does not that is simply a lie. > >> (4) Those for which no one has (yet) been able to provide a proof that >> they are either true or false. Some of these may be undecidable. Some >> may be decidable but simply haven't yet been proven. >> (5) Those which no one has ever looked at or attempted to prove or >> disprove. >> >> You would claim that (1) and (2) are truth-bearers and that (3) are not. >> >> But what do you do with (4) and (5) (the latter being by far the >> largest category of propositions). >> >> Given some arbitrary proposition φ, how do you determine whether it >> should be treated as a truth-bearer or not? >> >> If your system rules out some propositions as 'ill-formed' but can't >> actually tell us whether a given proposition is well-formed or not, >> then it isn't a particularly useful system. >> >> André >> > > That is like saying that any scientist that is not all knowing is > utterly useless. No. It is like saying that a logic must minimally be able to determine which propositions are well-formed. Yours can not. -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-14 13:06 -0500 |
| Message-ID | <6PidnUrottumoxrCnZ2dnUU7-aXNnZ2d@giganews.com> |
| In reply to | #23839 |
On 10/14/2020 11:44 AM, André G. Isaak wrote: > On 2020-10-14 09:42, olcott wrote: >> On 10/14/2020 1:42 AM, André G. Isaak wrote: >>> On 2020-10-13 09:12, olcott wrote: >>>> On 10/13/2020 5:14 AM, Andy Walker wrote: >>>>> On 13/10/2020 02:21, olcott wrote: >>>>>> "Incorrect expressions of language" are the exact same set that was >>>>>> previously called "undecidable propositions. >>>>> >>>>> When my daughter was just four, and wanted to be five so that >>>>> she could go to "big school", she came to me one day and said "Daddy, >>>>> why do we have to have four?" "Well, if we didn't, how would you >>>>> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >>>>> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >>>>> "So you would now be 5, and you'd go to school next year when you >>>>> will be 7?" She saw the point and laughed. >>>>> >>>>> If PO wants to call "incorrect expressions of language" what >>>>> the rest of us call "undecidable propositions", then it's confusing, >>>>> but it doesn't change the world. It just makes it an "incorrect >>>>> expression of language" to ask for an algorithm to determine whether >>>>> or not a given "expression of language" is an "incorrect expression >>>>> of language". If PO, or anyone else, can explain *why* this change >>>>> of wording helps anything, then perhaps the world will switch to it. >>>>> Don't hold your breath; my guess is that the rest of the world will >>>>> continue to describe propositions that provably have neither proofs >>>>> nor disproofs as "undecidable" rather than as "incorrect expressions >>>>> of language". It's shorter, and better describes what has happened, >>>>> not least because it doesn't convey any impression that someone has >>>>> made a mistake. >>>>> >>>> >>>> My whole point is to get closer to the truth by describing things >>>> more accurately. The literal truth is that these propositions are >>>> only "undecidable" because they are not truth bearers. >>> >>> Until you provide a workable definition of 'truth bearer' the above >>> isn't meaningful. >>> >> >> What you really mean as that as soon as I provide a workable >> definition of truth bearer the required number times so that yo quit >> ignoring that I have already done this many hundreds of times. >> >> ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) > > By a workable definition, I mean a definition which will allow you to > determine which things are true bearers and which are not. > The exact same set of expression of language that are currently named undeciable propositions are simply more accurately renamed as non-truth bearers. HOW MANY TIMES DO I HAVE TO SAY THIS ??? > The above doesn't do that because, as has been pointed out several > times, there is no general method for deciding whether a proposition is > actually decidable. There is no way, given some arbitrary proposition φ, > to determine whether φ or its negation are provable φ. That's one of the > reasons why provability is not included as an operator in standard > logics but only in the metalanguage. What-so-ever method currently classifies propositions as undecidable is used to classify them as non-truth bearers. > You are effectively saying that there are 'ill-formed propositions' > which can be ignored, but that you cannot tell us which ones they are. I have repeated this again and again and again. If I have to keep repeating this I will just conclude that you are a God damned liar and quit giving you the benefit of the doubt. >>> If you consider any formal system which is sufficiently powerful to >>> express claims about arithmetic over the natural numbers, you can >>> divide all propositions into the following categories: >>> >>> (1) Those which have been proven to be true. >>> (2) Those which have been proven to be false. >>> (3) Those which have been proven to be undecidable. >> >> All of the ones that are undecidable are undecidable for the same sort >> of reason that no one can decide the correct answer to the following >> question: What time is it (yes or no)? > > No, they are not. Lots of perfectly meaningful and interesting > propositions are undecidable. You may be referring to undecided propositions and not propositions that because of their pathologicial self-reference structure are not truth bearers. >> The barber shaves everyone that does not shave themselves. >> No he does not that is simply a lie. >> >>> (4) Those for which no one has (yet) been able to provide a proof >>> that they are either true or false. Some of these may be undecidable. >>> Some may be decidable but simply haven't yet been proven. >>> (5) Those which no one has ever looked at or attempted to prove or >>> disprove. >>> >>> You would claim that (1) and (2) are truth-bearers and that (3) are not. >>> >>> But what do you do with (4) and (5) (the latter being by far the >>> largest category of propositions). >>> >>> Given some arbitrary proposition φ, how do you determine whether it >>> should be treated as a truth-bearer or not? >>> >>> If your system rules out some propositions as 'ill-formed' but can't >>> actually tell us whether a given proposition is well-formed or not, >>> then it isn't a particularly useful system. >>> >>> André >>> >> >> That is like saying that any scientist that is not all knowing is >> utterly useless. > > No. It is like saying that a logic must minimally be able to determine > which propositions are well-formed. Yours can not. > It is conventional to define semantic well-formedness out-of-existence. This doesn't actually make it go away. Thus the conventional minimum standard applied to the case I am referring to is to simply ignore the question. One of the sets of non-truth bearer thus non propositions is the set of expressions of language that because of their pathological self-reference structure are not truth bearers. Russell's barber paradox is simply false and not a paradox at all. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-14 19:10 +0000 |
| Message-ID | <rm7ifa$apj$1@news.muc.de> |
| In reply to | #23841 |
olcott <NoOne@nowhere.com> wrote: > On 10/14/2020 11:44 AM, André G. Isaak wrote: >> On 2020-10-14 09:42, olcott wrote: [ .... ] >>> What you really mean as that as soon as I provide a workable >>> definition of truth bearer the required number times so that yo quit >>> ignoring that I have already done this many hundreds of times. >>> ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) >> By a workable definition, I mean a definition which will allow you to >> determine which things are true bearers and which are not. > The exact same set of expression of language that are currently named > undeciable propositions are simply more accurately renamed as non-truth > bearers. There is no way of determining whether an arbitrary expression is undecidable or not. So the definition you're trying to give isn't workable. > HOW MANY TIMES DO I HAVE TO SAY THIS ??? How many times do knowledgeable people have to point out your mistake? > What-so-ever method currently classifies propositions as undecidable is > used to classify them as non-truth bearers. There is no such method. Some individual interesting propositions (such as the Continuum Hypothesis in ZFC) have been shown to be undecidable. But there are many propositions whose truth status is unknown. That is why their truth status isn't used as a criterion for well formedness: it's just impractical. >> You are effectively saying that there are 'ill-formed propositions' >> which can be ignored, but that you cannot tell us which ones they are. > I have repeated this again and again and again. > If I have to keep repeating this I will just conclude that you are a God > damned liar and quit giving you the benefit of the doubt. That's quite uncalled for. There is a gap in knowledge between André and yourself which André is trying to bridge. You are resisting this. [ .... ] >>> All of the ones [propositions] that are undecidable are undecidable >>> for the same sort of reason that no one can decide the correct answer >>> to the following question: What time is it (yes or no)? >> No, they are not. Lots of perfectly meaningful and interesting >> propositions are undecidable. > You may be referring to undecided propositions and not propositions that > because of their pathologicial self-reference structure are not truth > bearers. No, absolutely not. He's referring to things like the Continuum Hypothesis in ZFC, which are not "self referential" in any sense (even yours) but are genuine mathematical statements shown to be unprovable. [ .... ] >>> That is like saying that any scientist that is not all knowing is >>> utterly useless. >> No. It is like saying that a logic must minimally be able to determine >> which propositions are well-formed. Yours can not. > It is conventional to define semantic well-formedness out-of-existence. It never had any existence in the first place. See above and previous posts for the reasons why not. > This doesn't actually make it go away. Thus the conventional minimum > standard applied to the case I am referring to is to simply ignore the > question. It is what you would deem to be an "ill-formed question" because it "has no truth value". [ .... ] > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-14 14:35 -0500 |
| Message-ID | <VPqdnRwnHPl0zxrCnZ2dnUU7-KfNnZ2d@giganews.com> |
| In reply to | #23844 |
On 10/14/2020 2:10 PM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/14/2020 11:44 AM, André G. Isaak wrote: >>> On 2020-10-14 09:42, olcott wrote: > > [ .... ] > >>>> What you really mean as that as soon as I provide a workable >>>> definition of truth bearer the required number times so that yo quit >>>> ignoring that I have already done this many hundreds of times. > >>>> ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) > >>> By a workable definition, I mean a definition which will allow you to >>> determine which things are true bearers and which are not. > >> The exact same set of expression of language that are currently named >> undeciable propositions are simply more accurately renamed as non-truth >> bearers. > > There is no way of determining whether an arbitrary expression is > undecidable or not. So the definition you're trying to give isn't > workable. > The entire set of expressions of language that are currently called undecidable propositions have been reclassified as not prpositions at all. This is the same criteria that is used to determine that a formal system is incomplete, thus no longer used for that purpose. I HAVE SAID THIS ABOUT TEN TIMES NOW. >> HOW MANY TIMES DO I HAVE TO SAY THIS ??? > > How many times do knowledgeable people have to point out your mistake? > >> What-so-ever method currently classifies propositions as undecidable is >> used to classify them as non-truth bearers. > > There is no such method. This standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ) is now applied to expressions of language. > Some individual interesting propositions (such > as the Continuum Hypothesis in ZFC) have been shown to be undecidable. Bullshit. Undecided is not the same thing as undecidable. > But there are many propositions whose truth status is unknown. That is > why their truth status isn't used as a criterion for well formedness: > it's just impractical. It works perfectly well to determine that a formal system incomplete. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-14 20:11 +0000 |
| Message-ID | <rm7m20$129m$1@news.muc.de> |
| In reply to | #23846 |
olcott <NoOne@nowhere.com> wrote: > On 10/14/2020 2:10 PM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: >>> On 10/14/2020 11:44 AM, André G. Isaak wrote: >>>> On 2020-10-14 09:42, olcott wrote: [ .... ] >>>> By a workable definition, I mean a definition which will allow you >>>> to determine which things are true bearers and which are not. >>> The exact same set of expression of language that are currently named >>> undeciable propositions are simply more accurately renamed as >>> non-truth bearers. >> There is no way of determining whether an arbitrary expression is >> undecidable or not. So the definition you're trying to give isn't >> workable. > The entire set of expressions of language that are currently called > undecidable propositions have been reclassified as not prpositions at > all. This is the same criteria that is used to determine that a formal > system is incomplete, .... It is not. To determine that a formal system is incomplete, a particular expression is used. This has nothing to say about "the entire set ... of undecidable propositions". > .... thus no longer used for that purpose. > I HAVE SAID THIS ABOUT TEN TIMES NOW. How many times do people have to tell you that you are mistaken? [ .... ] >> How many times do knowledgeable people have to point out your mistake? >>> What-so-ever method currently classifies propositions as undecidable >>> is used to classify them as non-truth bearers. >> There is no such method. > This standard definition of Incompleteness: A theory T is incomplete if > and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ) is > now applied to expressions of language. >> Some individual interesting propositions (such as the Continuum >> Hypothesis in ZFC) have been shown to be undecidable. > Bullshit. Undecided is not the same thing as undecidable. It's not bullshit. You're quite right about undecided being different from undecidable. And the CH in ZFC has been proven to be undecidable. >> But there are many propositions whose truth status is unknown. That is >> why their truth status isn't used as a criterion for well formedness: >> it's just impractical. > It works perfectly well to determine that a formal system incomplete. That clause no verb either. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-14 15:58 -0500 |
| Message-ID | <c_2dneV2M77A-xrCnZ2dnUU7-dOdnZ2d@giganews.com> |
| In reply to | #23847 |
On 10/14/2020 3:11 PM, Alan Mackenzie wrote: > olcott <NoOne@nowhere.com> wrote: >> On 10/14/2020 2:10 PM, Alan Mackenzie wrote: >>> olcott <NoOne@nowhere.com> wrote: >>>> On 10/14/2020 11:44 AM, André G. Isaak wrote: >>>>> On 2020-10-14 09:42, olcott wrote: > > [ .... ] > >>>>> By a workable definition, I mean a definition which will allow you >>>>> to determine which things are true bearers and which are not. > >>>> The exact same set of expression of language that are currently named >>>> undeciable propositions are simply more accurately renamed as >>>> non-truth bearers. > >>> There is no way of determining whether an arbitrary expression is >>> undecidable or not. So the definition you're trying to give isn't >>> workable. > >> The entire set of expressions of language that are currently called >> undecidable propositions have been reclassified as not prpositions at >> all. This is the same criteria that is used to determine that a formal >> system is incomplete, .... > > It is not. To determine that a formal system is incomplete, a particular > expression is used. This has nothing to say about "the entire set ... of > undecidable propositions". > >> .... thus no longer used for that purpose. > >> I HAVE SAID THIS ABOUT TEN TIMES NOW. > > How many times do people have to tell you that you are mistaken? > It looks like your baseless assertions that I am mistaken are approaching the limit where I quit responding. > [ .... ] > >>> How many times do knowledgeable people have to point out your mistake? > >>>> What-so-ever method currently classifies propositions as undecidable >>>> is used to classify them as non-truth bearers. > >>> There is no such method. > >> This standard definition of Incompleteness: A theory T is incomplete if >> and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ) is >> now applied to expressions of language. > >>> Some individual interesting propositions (such as the Continuum >>> Hypothesis in ZFC) have been shown to be undecidable. > >> Bullshit. Undecided is not the same thing as undecidable. > > It's not bullshit. You're quite right about undecided being different > from undecidable. And the CH in ZFC has been proven to be undecidable. > >>> But there are many propositions whose truth status is unknown. That is >>> why their truth status isn't used as a criterion for well formedness: >>> it's just impractical. > >> It works perfectly well to determine that a formal system incomplete. > > That clause no verb either. > >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-14 18:54 -0500 |
| Message-ID | <HcOdnd8CoIstEhrCnZ2dnUU7-KfNnZ2d@giganews.com> |
| In reply to | #23839 |
On 10/14/2020 11:44 AM, André G. Isaak wrote: > On 2020-10-14 09:42, olcott wrote: >> On 10/14/2020 1:42 AM, André G. Isaak wrote: >>> On 2020-10-13 09:12, olcott wrote: >>>> On 10/13/2020 5:14 AM, Andy Walker wrote: >>>>> On 13/10/2020 02:21, olcott wrote: >>>>>> "Incorrect expressions of language" are the exact same set that was >>>>>> previously called "undecidable propositions. >>>>> >>>>> When my daughter was just four, and wanted to be five so that >>>>> she could go to "big school", she came to me one day and said "Daddy, >>>>> why do we have to have four?" "Well, if we didn't, how would you >>>>> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >>>>> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >>>>> "So you would now be 5, and you'd go to school next year when you >>>>> will be 7?" She saw the point and laughed. >>>>> >>>>> If PO wants to call "incorrect expressions of language" what >>>>> the rest of us call "undecidable propositions", then it's confusing, >>>>> but it doesn't change the world. It just makes it an "incorrect >>>>> expression of language" to ask for an algorithm to determine whether >>>>> or not a given "expression of language" is an "incorrect expression >>>>> of language". If PO, or anyone else, can explain *why* this change >>>>> of wording helps anything, then perhaps the world will switch to it. >>>>> Don't hold your breath; my guess is that the rest of the world will >>>>> continue to describe propositions that provably have neither proofs >>>>> nor disproofs as "undecidable" rather than as "incorrect expressions >>>>> of language". It's shorter, and better describes what has happened, >>>>> not least because it doesn't convey any impression that someone has >>>>> made a mistake. >>>>> >>>> >>>> My whole point is to get closer to the truth by describing things >>>> more accurately. The literal truth is that these propositions are >>>> only "undecidable" because they are not truth bearers. >>> >>> Until you provide a workable definition of 'truth bearer' the above >>> isn't meaningful. >>> >> >> What you really mean as that as soon as I provide a workable >> definition of truth bearer the required number times so that yo quit >> ignoring that I have already done this many hundreds of times. >> >> ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) > > By a workable definition, I mean a definition which will allow you to > determine which things are true bearers and which are not. > > The above doesn't do that because, as has been pointed out several > times, there is no general method for deciding whether a proposition is > actually decidable. There is no way, given some arbitrary proposition φ, > to determine whether φ or its negation are provable φ. That's one of the > reasons why provability is not included as an operator in standard > logics but only in the metalanguage. A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). My notion of epressions of language that are not truth bearers is the exact same notion as the definition of incompletness under a different name, thus if my notion is too vague then so is the notion of incompleteness. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-15 05:52 -0600 |
| Message-ID | <rm9d66$k9p$1@dont-email.me> |
| In reply to | #23850 |
On 2020-10-14 17:54, olcott wrote: > On 10/14/2020 11:44 AM, André G. Isaak wrote: >> On 2020-10-14 09:42, olcott wrote: >>> On 10/14/2020 1:42 AM, André G. Isaak wrote: >>>> On 2020-10-13 09:12, olcott wrote: >>>>> On 10/13/2020 5:14 AM, Andy Walker wrote: >>>>>> On 13/10/2020 02:21, olcott wrote: >>>>>>> "Incorrect expressions of language" are the exact same set that was >>>>>>> previously called "undecidable propositions. >>>>>> >>>>>> When my daughter was just four, and wanted to be five so that >>>>>> she could go to "big school", she came to me one day and said "Daddy, >>>>>> why do we have to have four?" "Well, if we didn't, how would you >>>>>> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >>>>>> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >>>>>> "So you would now be 5, and you'd go to school next year when you >>>>>> will be 7?" She saw the point and laughed. >>>>>> >>>>>> If PO wants to call "incorrect expressions of language" what >>>>>> the rest of us call "undecidable propositions", then it's confusing, >>>>>> but it doesn't change the world. It just makes it an "incorrect >>>>>> expression of language" to ask for an algorithm to determine whether >>>>>> or not a given "expression of language" is an "incorrect expression >>>>>> of language". If PO, or anyone else, can explain *why* this change >>>>>> of wording helps anything, then perhaps the world will switch to it. >>>>>> Don't hold your breath; my guess is that the rest of the world will >>>>>> continue to describe propositions that provably have neither proofs >>>>>> nor disproofs as "undecidable" rather than as "incorrect expressions >>>>>> of language". It's shorter, and better describes what has happened, >>>>>> not least because it doesn't convey any impression that someone has >>>>>> made a mistake. >>>>>> >>>>> >>>>> My whole point is to get closer to the truth by describing things >>>>> more accurately. The literal truth is that these propositions are >>>>> only "undecidable" because they are not truth bearers. >>>> >>>> Until you provide a workable definition of 'truth bearer' the above >>>> isn't meaningful. >>>> >>> >>> What you really mean as that as soon as I provide a workable >>> definition of truth bearer the required number times so that yo quit >>> ignoring that I have already done this many hundreds of times. >>> >>> ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) >> >> By a workable definition, I mean a definition which will allow you to >> determine which things are true bearers and which are not. >> >> The above doesn't do that because, as has been pointed out several >> times, there is no general method for deciding whether a proposition >> is actually decidable. There is no way, given some arbitrary >> proposition φ, to determine whether φ or its negation are provable φ. >> That's one of the reasons why provability is not included as an >> operator in standard logics but only in the metalanguage. > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > My notion of epressions of language that are not truth bearers is the > exact same notion as the definition of incompletness under a different > name, thus if my notion is too vague then so is the notion of > incompleteness. You're not grasping the problem. In order to demonstrate that a system is incomplete one must simply demonstrate that there are undecidable propositions in the system. One needn't identify every undecidable proposition in the system to do this. You, however, want to 'fix' incompleteness (you are the only one who seems to believe that incomplete systems need fixing) by excluding such propositions from the system. In order to exclude propositions from a system, one must actually be able to identify all of the propositions which you intend to exclude. Otherwise, you have a system which you assert contains 'ill-formed propositions' but where you cannot identify which propositions those are. I know that you are troubled for some reason by the existence of incompleteness, but wouldn't it be equally (if not more) troubling to have a system in which you don't even know which propositions are well-formed and which are not? André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-15 09:29 -0500 |
| Message-ID | <H6qdnUZ3mLx5wRXCnZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #23855 |
On 10/15/2020 6:52 AM, André G. Isaak wrote: > On 2020-10-14 17:54, olcott wrote: >> On 10/14/2020 11:44 AM, André G. Isaak wrote: >>> On 2020-10-14 09:42, olcott wrote: >>>> On 10/14/2020 1:42 AM, André G. Isaak wrote: >>>>> On 2020-10-13 09:12, olcott wrote: >>>>>> On 10/13/2020 5:14 AM, Andy Walker wrote: >>>>>>> On 13/10/2020 02:21, olcott wrote: >>>>>>>> "Incorrect expressions of language" are the exact same set that was >>>>>>>> previously called "undecidable propositions. >>>>>>> >>>>>>> When my daughter was just four, and wanted to be five so that >>>>>>> she could go to "big school", she came to me one day and said >>>>>>> "Daddy, >>>>>>> why do we have to have four?" "Well, if we didn't, how would you >>>>>>> count?" "1, 2, 3, 5, ..." [at this point, she realised that simply >>>>>>> going on to 6, 7, 8 would be a bit lame] "7, 6, 9, 8 and so on." >>>>>>> "So you would now be 5, and you'd go to school next year when you >>>>>>> will be 7?" She saw the point and laughed. >>>>>>> >>>>>>> If PO wants to call "incorrect expressions of language" what >>>>>>> the rest of us call "undecidable propositions", then it's confusing, >>>>>>> but it doesn't change the world. It just makes it an "incorrect >>>>>>> expression of language" to ask for an algorithm to determine whether >>>>>>> or not a given "expression of language" is an "incorrect expression >>>>>>> of language". If PO, or anyone else, can explain *why* this change >>>>>>> of wording helps anything, then perhaps the world will switch to it. >>>>>>> Don't hold your breath; my guess is that the rest of the world will >>>>>>> continue to describe propositions that provably have neither proofs >>>>>>> nor disproofs as "undecidable" rather than as "incorrect expressions >>>>>>> of language". It's shorter, and better describes what has happened, >>>>>>> not least because it doesn't convey any impression that someone has >>>>>>> made a mistake. >>>>>>> >>>>>> >>>>>> My whole point is to get closer to the truth by describing things >>>>>> more accurately. The literal truth is that these propositions are >>>>>> only "undecidable" because they are not truth bearers. >>>>> >>>>> Until you provide a workable definition of 'truth bearer' the above >>>>> isn't meaningful. >>>>> >>>> >>>> What you really mean as that as soon as I provide a workable >>>> definition of truth bearer the required number times so that yo quit >>>> ignoring that I have already done this many hundreds of times. >>>> >>>> ∀x (Proposition(x) ↔ (⊢x ∨ ⊢¬x)) >>> >>> By a workable definition, I mean a definition which will allow you to >>> determine which things are true bearers and which are not. >>> >>> The above doesn't do that because, as has been pointed out several >>> times, there is no general method for deciding whether a proposition >>> is actually decidable. There is no way, given some arbitrary >>> proposition φ, to determine whether φ or its negation are provable φ. >>> That's one of the reasons why provability is not included as an >>> operator in standard logics but only in the metalanguage. >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> My notion of epressions of language that are not truth bearers is the >> exact same notion as the definition of incompletness under a different >> name, thus if my notion is too vague then so is the notion of >> incompleteness. > > You're not grasping the problem. > > In order to demonstrate that a system is incomplete one must simply > demonstrate that there are undecidable propositions in the system. One > needn't identify every undecidable proposition in the system to do this. > I knew this and you knew this and you used this as a dodge. > You, however, want to 'fix' incompleteness (you are the only one who > seems to believe that incomplete systems need fixing) by excluding such > propositions from the system. In order to exclude propositions from a > system, one must actually be able to identify all of the propositions > which you intend to exclude. Otherwise, you have a system which you > assert contains 'ill-formed propositions' but where you cannot identify > which propositions those are. > I know this and you know that to eliminate incompleteness from a system as soon as every indication that a system is incomplete is eliminated then there is no indication that the system is incomplete. If we have seventeen pieces of evidence that someone committed a crime and we show that each of these 17 pieces of evidence was falsified then we no longer have any evidence or basis that they committed a crime. > I know that you are troubled for some reason by the existence of > incompleteness, but wouldn't it be equally (if not more) troubling to > have a system in which you don't even know which propositions are > well-formed and which are not? > > André > You are being disingenuous thus dishonest. A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). In all the cases where we can prove that an expression of language is neither provable nor disprovable we have an ill-formed propoistion. These are the exact same cases that were previvously used to prove incompleteness thus there are zero cases left that prove incompleteness. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Alan Mackenzie <acm@muc.de> |
|---|---|
| Date | 2020-10-13 11:41 +0000 |
| Message-ID | <rm43p6$161o$1@news.muc.de> |
| In reply to | #23796 |
olcott <NoOne@nowhere.com> wrote: > On 10/12/2020 11:27 AM, Alan Mackenzie wrote: >> olcott <NoOne@nowhere.com> wrote: >>> On 10/12/2020 4:59 AM, Alan Mackenzie wrote: [ .... ] >>>> What do you know about Gödel's theorem? >>> All that anyone ever need know about his 1931 Incompleteness theorem >>> is that it utterly depends on this sentence: >>> -- A theory T is incomplete if and only if there is some sentence φ >>> such -- that (T ⊬ φ) and (T ⊬ ¬φ). >> If that is your genuine belief, carry on in your ignorance. If you'd >> actually take the trouble to understand the proof of the theorem, >> you'd see and understand that it is correct and why it is correct. > That statement has been agreed to by several people in several forums. So, why don't you do it? >>> If that single sentence is false Gödel's 1931 Incompleteness theorem >>> utterly fails. >> Then since that theorem doesn't fail, utterly or otherwise, the single >> sentence above cannot be false. Since it is a definition of >> "incomplete" rather than a proposition, it can't really be true or >> false. Maybe you want to remove the idea from mathematics, a bit like >> the people in 1984 gradually removing words from Newspeak. Best of >> luck! > If is is not true that: > -- A theory T is incomplete if and only if there is some sentence φ > -- such that (T ⊬ φ) and (T ⊬ ¬φ). It is neither true nor false - it is a definition of what incomplete means. [ .... ] >>> All that I am doing is utterly eliminating the term: "undecidable >>> proposition" and replacing it with incorrect expression". >> Then you will end up with an inconsistent system. > Not all all. Not in the least. We end up with a system that reject > erroneous expression of language. I think that you may be too stuck on > rote learning as indicated by your merely parroting the catch phrases > of conventional wisdom. I have a degree in mathematics. You clearly do not. >>> The same criteria that would otherwise make Theory T incomplete, now >>> instead rejects expression φ as incorrect. >> There is provably no way to determine whether a general expression is >> "incorrect" (in your sense) or not. > The exact same ways of determing that an expression of language is > undecidable determine that this same expression is erroneous. There are no ways of "deciding" that a general expression is undecidable. We just know that such expressions exist. Some can be demonstrated to be undecidable, but not all. I think the Continuum Hypothesis in ZFC has been demonstrated to be undecidable. >>> Theory T is not decided to be incomplete on the basis that it can >>> neither prove nor disprove incorrect expression φ. >> What do you do with an expression whose "correctness" cannot be >> determined? For example, Goldbach's Conjecture currently falls into >> the unknown category. It might in the future be proven one way or the >> other, or it might indeed be true yet unprovable. > True and unprovable is like colorless and blue. Not in the least. > There are only two ways that any analytical expression of language is > ever determined to be true: > (1) By definition such as: "cats are animals" > (2) By inference based on definitions. We're not talking about "determined to be true". We're talking about "true", regardless of whether it can be determined or not. >> I suppose that you would include Goldbach's conjecture in the >> "incorrect" category, even though it is an interesting mathematical >> statement which is valid in every sensible system of mathematical >> logic. >> Thus would your system be of limited use. > No Because of Andre's objections I had to revise it to exclude > Goldbach. Thus your system is of limited use. > "Incorrect expressions of language" are the exact same set that was > previously called "undecidable propositions. So you're constructing a system which can't deal with undecidable propositions aka incorrect expression of language. Such a system would not be powerful enough to be of much use. [ .... ] >>> For the whole body of analytical truth (expressions of language that >>> are determined to be true entirely based on their meaning) the only >>> way that we can know that an expression is true based on its meaning >>> or a connected inference chain of meanings (its proof). >> That "sentence" no verb. > The point is that true and provable cannot possibly diverge because the > only way that we know that an expression of language is true is by its > proof (an inference chain of connected meanings). Things can be true without us "knowing" it. Some true things have proofs. Others do not. They are true, yet we can never know it for sure. Goldbach's Conjecture might well be such a thing. True and provable are NOT the same thing. If they were, we'd only need one word for it. > -- > Copyright 2020 Pete Olcott -- Alan Mackenzie (Nuremberg, Germany).
[toc] | [prev] | [next] | [standalone]
Page 16 of 21 — ← Prev page 1 … 14 15 [16] 17 18 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web