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 11 of 21 — ← Prev page 1 … 9 10 [11] 12 13 … 21 Next page →
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2020-10-18 15:34 +0100 |
| Message-ID | <RMCdnQnm96byzxHCnZ2dnUU78NnNnZ2d@brightview.co.uk> |
| In reply to | #23935 |
On 18/10/2020 04:31, Jeff Barnett wrote: > On 10/17/2020 8:23 PM, olcott wrote: >> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>> existance of undecidable propositions does not ever never decide >>>> incomplete formal systems. >>> >>> You have nothing but this word game? Really? You are free to say that >>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>> Incomplete(T) (because that's just your own made-up predicate with a >>> deliberately confusing name), but you don't get to say that it does not >>> mean that T is incomplete (because that's not your word to redefine). >>> >> >> Heh at least we are finally on the same page of what I have been saying. >> Ultimately it is not up to any living being to stipulate the >> fundamental nature of truth itself, Truth totally speaks for itself on >> this. + >> >>> Some formal system have sentences that can't be proved or refuted from >>> the axioms and the rest of the world will continue to investigate these >>> systems, and to talk about their undecidable sentences, no matter what >>> name you give them. >>> >> Yes they will do this right on up to the point where they realize that >> they have been fooled the whole time. As soon as they realize that the >> only reason that some expressions of language are undecidable is that >> they are incorrect they will quit studying this. >> >>> And since there is no effective procedure to determine if Incorrect(φ), >> >> If there is no effective procedure to decide a sentence is incorrect >> then there is no effective procedure to decide that a formal system is >> incomplete because it is the exact same procedure. (Nitwit) >> >> You and Andre are making the very stupid mistake of conflating >> existential with universal quantification. It is such a stupid mistake >> that I really can't believe that it is an actual mistake that is what >> I call is a lie. >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> Maybe you really are too dumb to know that the above is existential >> not universal quantification. >> >>> you are not even offering anything of practical value. >> >> Ultimately the practical value is the correct formalization of the >> notion of truth itself to be used as the most basic foundation of >> strong AI. AI that does not have a formalized notion of truth has a >> frontal lobotomy. (AKA severe brain damage). >> >>> Apart from a few >>> particular cases, you will never know if Incorrect(φ) is true for any >>> given sentence. >> >> All that we need to know is that in every single case where theory T >> is decided to be incomplete on the basis of undecidable expression φ >> of language of T we decide that φ is incorrect leaving zero systems in >> the universe that are incomplete on the basis of undecidable expressions. > > PO, considered as a system, is undecidable: we can't prove whether he is > 1) a troll, I don't think he is a troll. I think he believes everything he says. > 2) blatantly ignorant of almost every relevant result and > how it was developed, Yes, blatantly (and proudly) so. He can't follow the reasonings behind the basic concepts in the fields he chooses to write about, preferring to overturn key results by eliminating the extraneous complexity (aka stuff he doesn't understand) and "correcting" various definitions to make things he doesn't like go away. > 3) ambitious but stupid, or He has some strange goals and motivations - e.g. he is really not interested at all in mathematics or logic per se, and sees overturning of the key results as a rather tedious chore he must undertake in order to establish his reputation in the field. And he needs to do this, because without this, Doug Lenat will not consider putting him in charge of the Cyc project development, which is a key stepping stone for him to become the first human being to create a human mind in a computer. Do elements of that seem a little ambitious, and stupid? (A little naive and deluded, perhaps?) The stupid bit is also apparent in his arguments, and his inability to follow the arguments presented by others in his chosen fields. E.g. he is proud to have spent 20 years or so studying a half dozen pages in a book by Linz, covering the Halting Problem proof. This is something which quite average students understand in a couple of hours, I would guess. If you have to spend more than a day "studying" it, that would seem to be a sign that you haven't actually understood the big picture of the proof (let alone any messy details of data representations that are sort of inevitable in this sort of proof). > 4) some weird > combination of 1 thru 3. I would go with the combination: deluded and dumb. (The alliteration makes it sound like a catchy slogan or one of those trendy hashtags :) ) The vast majority of people don't understand any mathematics, computer science, formal logic etc., and of course there's nothing embarrassing in this. But 99.999% of those people /realise/ they don't know any of this, and wouldn't go to a focussed forum on the subjects to donate their various naive intuitions. And of the remaining people who tried this, probably 90% would look at the responses they got, and realise "hey, I need to find out a bit more about all this before embarrassing myself any further". PO is in the 10% of the 0.001% that for some reason blindly sticks with it. (I don't think anyone could get through the filter without being fundamentally deluded, and that's ignoring all his "God stuff"...) Naturally, PO would counter with "I'm afraid you've got this all wrong; I'm an unrecognised genius, with powers of concentration and reasoning beyond nearly every other human being in existence etc.", but that's just his delusions in action. You can't undelude(?) someone by carefully explaining that they're deluded. When he finally delivers his HP refutation, and people quickly point out the problems with his arguments, and the papers he sends to reputable journals are incomprehensibly rejected, he won't say "hmm, looks like I've been wrong for 20 years after all!". Delusional frameworks readily adapt to new conflicting evidence as it comes along, and he'll just carry on as he always has. Mike. > Can we therefore remove him from the world? The > curious are very interested in that question.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 11:24 -0500 |
| Message-ID | <ptudnQfK9tyl8RHCnZ2dnUU7-evNnZ2d@giganews.com> |
| In reply to | #23942 |
On 10/18/2020 9:34 AM, Mike Terry wrote: > On 18/10/2020 04:31, Jeff Barnett wrote: >> On 10/17/2020 8:23 PM, olcott wrote: >>> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>>> existance of undecidable propositions does not ever never decide >>>>> incomplete formal systems. >>>> >>>> You have nothing but this word game? Really? You are free to say that >>>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>>> Incomplete(T) (because that's just your own made-up predicate with a >>>> deliberately confusing name), but you don't get to say that it does not >>>> mean that T is incomplete (because that's not your word to redefine). >>>> >>> >>> Heh at least we are finally on the same page of what I have been saying. >>> Ultimately it is not up to any living being to stipulate the >>> fundamental nature of truth itself, Truth totally speaks for itself on >>> this. + >>> >>>> Some formal system have sentences that can't be proved or refuted from >>>> the axioms and the rest of the world will continue to investigate these >>>> systems, and to talk about their undecidable sentences, no matter what >>>> name you give them. >>>> >>> Yes they will do this right on up to the point where they realize that >>> they have been fooled the whole time. As soon as they realize that the >>> only reason that some expressions of language are undecidable is that >>> they are incorrect they will quit studying this. >>> >>>> And since there is no effective procedure to determine if Incorrect(φ), >>> >>> If there is no effective procedure to decide a sentence is incorrect >>> then there is no effective procedure to decide that a formal system is >>> incomplete because it is the exact same procedure. (Nitwit) >>> >>> You and Andre are making the very stupid mistake of conflating >>> existential with universal quantification. It is such a stupid mistake >>> that I really can't believe that it is an actual mistake that is what >>> I call is a lie. >>> >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> Maybe you really are too dumb to know that the above is existential >>> not universal quantification. >>> >>>> you are not even offering anything of practical value. >>> >>> Ultimately the practical value is the correct formalization of the >>> notion of truth itself to be used as the most basic foundation of >>> strong AI. AI that does not have a formalized notion of truth has a >>> frontal lobotomy. (AKA severe brain damage). >>> >>>> Apart from a few >>>> particular cases, you will never know if Incorrect(φ) is true for any >>>> given sentence. >>> >>> All that we need to know is that in every single case where theory T >>> is decided to be incomplete on the basis of undecidable expression φ >>> of language of T we decide that φ is incorrect leaving zero systems in >>> the universe that are incomplete on the basis of undecidable >>> expressions. >> >> PO, considered as a system, is undecidable: we can't prove whether he is >> 1) a troll, > > I don't think he is a troll. I think he believes everything he says. > >> 2) blatantly ignorant of almost every relevant result and >> how it was developed, > > Yes, blatantly (and proudly) so. He can't follow the reasonings behind > the basic concepts in the fields he chooses to write about, preferring > to overturn key results by eliminating the extraneous complexity (aka > stuff he doesn't understand) and "correcting" various definitions to > make things he doesn't like go away. > >> 3) ambitious but stupid, or > > He has some strange goals and motivations - e.g. he is really not > interested at all in mathematics or logic per se, and sees overturning > of the key results as a rather tedious chore he must undertake in order > to establish his reputation in the field. And he needs to do this, > because without this, Doug Lenat will not consider putting him in charge > of the Cyc project development, which is a key stepping stone for him to > become the first human being to create a human mind in a computer. > > Do elements of that seem a little ambitious, and stupid? (A little > naive and deluded, perhaps?) > > The stupid bit is also apparent in his arguments, and his inability to > follow the arguments presented by others in his chosen fields. E.g. he > is proud to have spent 20 years or so studying a half dozen pages in a > book by Linz, covering the Halting Problem proof. This is something > which quite average students understand in a couple of hours, I would > guess. If you have to spend more than a day "studying" it, that would > seem to be a sign that you haven't actually understood the big picture > of the proof (let alone any messy details of data representations that > are sort of inevitable in this sort of proof). > >> 4) some weird >> combination of 1 thru 3. > > I would go with the combination: deluded and dumb. (The alliteration > makes it sound like a catchy slogan or one of those trendy hashtags :) ) > > The vast majority of people don't understand any mathematics, computer > science, formal logic etc., and of course there's nothing embarrassing > in this. But 99.999% of those people /realise/ they don't know any of > this, and wouldn't go to a focussed forum on the subjects to donate > their various naive intuitions. And of the remaining people who tried > this, probably 90% would look at the responses they got, and realise > "hey, I need to find out a bit more about all this before embarrassing > myself any further". PO is in the 10% of the 0.001% that for some > reason blindly sticks with it. (I don't think anyone could get through > the filter without being fundamentally deluded, and that's ignoring all > his "God stuff"...) > > Naturally, PO would counter with "I'm afraid you've got this all wrong; > I'm an unrecognised genius, with powers of concentration and reasoning > beyond nearly every other human being in existence etc.", but that's > just his delusions in action. > > You can't undelude(?) someone by carefully explaining that they're > deluded. When he finally delivers his HP refutation, and people quickly > point out the problems with his arguments, and the papers he sends to > reputable journals are incomprehensibly rejected, he won't say "hmm, > looks like I've been wrong for 20 years after all!". Delusional > frameworks readily adapt to new conflicting evidence as it comes along, > and he'll just carry on as he always has. > > > Mike. > The mathematical foundations of the notion of truth violate their philosophical underpinnings. https://plato.stanford.edu/entries/justep-foundational/ >> Can we therefore remove him from the world? The >> curious are very interested in that question. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-18 10:42 -0600 |
| Message-ID | <rmhr91$h29$2@dont-email.me> |
| In reply to | #23953 |
On 2020-10-18 10:24, olcott wrote: > On 10/18/2020 9:34 AM, Mike Terry wrote: >> On 18/10/2020 04:31, Jeff Barnett wrote: >>> On 10/17/2020 8:23 PM, olcott wrote: >>>> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>>>> existance of undecidable propositions does not ever never decide >>>>>> incomplete formal systems. >>>>> >>>>> You have nothing but this word game? Really? You are free to say >>>>> that >>>>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>>>> Incomplete(T) (because that's just your own made-up predicate with a >>>>> deliberately confusing name), but you don't get to say that it does >>>>> not >>>>> mean that T is incomplete (because that's not your word to redefine). >>>>> >>>> >>>> Heh at least we are finally on the same page of what I have been >>>> saying. >>>> Ultimately it is not up to any living being to stipulate the >>>> fundamental nature of truth itself, Truth totally speaks for itself on >>>> this. + >>>> >>>>> Some formal system have sentences that can't be proved or refuted from >>>>> the axioms and the rest of the world will continue to investigate >>>>> these >>>>> systems, and to talk about their undecidable sentences, no matter what >>>>> name you give them. >>>>> >>>> Yes they will do this right on up to the point where they realize that >>>> they have been fooled the whole time. As soon as they realize that the >>>> only reason that some expressions of language are undecidable is that >>>> they are incorrect they will quit studying this. >>>> >>>>> And since there is no effective procedure to determine if >>>>> Incorrect(φ), >>>> >>>> If there is no effective procedure to decide a sentence is incorrect >>>> then there is no effective procedure to decide that a formal system is >>>> incomplete because it is the exact same procedure. (Nitwit) >>>> >>>> You and Andre are making the very stupid mistake of conflating >>>> existential with universal quantification. It is such a stupid mistake >>>> that I really can't believe that it is an actual mistake that is what >>>> I call is a lie. >>>> >>>> A theory T is incomplete if and only if there is some sentence φ such >>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>> >>>> Maybe you really are too dumb to know that the above is existential >>>> not universal quantification. >>>> >>>>> you are not even offering anything of practical value. >>>> >>>> Ultimately the practical value is the correct formalization of the >>>> notion of truth itself to be used as the most basic foundation of >>>> strong AI. AI that does not have a formalized notion of truth has a >>>> frontal lobotomy. (AKA severe brain damage). >>>> >>>>> Apart from a few >>>>> particular cases, you will never know if Incorrect(φ) is true for any >>>>> given sentence. >>>> >>>> All that we need to know is that in every single case where theory T >>>> is decided to be incomplete on the basis of undecidable expression φ >>>> of language of T we decide that φ is incorrect leaving zero systems in >>>> the universe that are incomplete on the basis of undecidable >>>> expressions. >>> >>> PO, considered as a system, is undecidable: we can't prove whether he is >>> 1) a troll, >> >> I don't think he is a troll. I think he believes everything he says. >> >>> 2) blatantly ignorant of almost every relevant result and >>> how it was developed, >> >> Yes, blatantly (and proudly) so. He can't follow the reasonings >> behind the basic concepts in the fields he chooses to write about, >> preferring to overturn key results by eliminating the extraneous >> complexity (aka stuff he doesn't understand) and "correcting" various >> definitions to make things he doesn't like go away. >> >>> 3) ambitious but stupid, or >> >> He has some strange goals and motivations - e.g. he is really not >> interested at all in mathematics or logic per se, and sees overturning >> of the key results as a rather tedious chore he must undertake in >> order to establish his reputation in the field. And he needs to do >> this, because without this, Doug Lenat will not consider putting him >> in charge of the Cyc project development, which is a key stepping >> stone for him to become the first human being to create a human mind >> in a computer. >> >> Do elements of that seem a little ambitious, and stupid? (A little >> naive and deluded, perhaps?) >> >> The stupid bit is also apparent in his arguments, and his inability to >> follow the arguments presented by others in his chosen fields. E.g. >> he is proud to have spent 20 years or so studying a half dozen pages >> in a book by Linz, covering the Halting Problem proof. This is >> something which quite average students understand in a couple of >> hours, I would guess. If you have to spend more than a day "studying" >> it, that would seem to be a sign that you haven't actually understood >> the big picture of the proof (let alone any messy details of data >> representations that are sort of inevitable in this sort of proof). >> >>> 4) some weird >>> combination of 1 thru 3. >> >> I would go with the combination: deluded and dumb. (The alliteration >> makes it sound like a catchy slogan or one of those trendy hashtags :) ) >> >> The vast majority of people don't understand any mathematics, computer >> science, formal logic etc., and of course there's nothing embarrassing >> in this. But 99.999% of those people /realise/ they don't know any of >> this, and wouldn't go to a focussed forum on the subjects to donate >> their various naive intuitions. And of the remaining people who tried >> this, probably 90% would look at the responses they got, and realise >> "hey, I need to find out a bit more about all this before embarrassing >> myself any further". PO is in the 10% of the 0.001% that for some >> reason blindly sticks with it. (I don't think anyone could get >> through the filter without being fundamentally deluded, and that's >> ignoring all his "God stuff"...) >> >> Naturally, PO would counter with "I'm afraid you've got this all >> wrong; I'm an unrecognised genius, with powers of concentration and >> reasoning beyond nearly every other human being in existence etc.", >> but that's just his delusions in action. >> >> You can't undelude(?) someone by carefully explaining that they're >> deluded. When he finally delivers his HP refutation, and people >> quickly point out the problems with his arguments, and the papers he >> sends to reputable journals are incomprehensibly rejected, he won't >> say "hmm, looks like I've been wrong for 20 years after all!". >> Delusional frameworks readily adapt to new conflicting evidence as it >> comes along, and he'll just carry on as he always has. >> >> >> Mike. >> > > The mathematical foundations of the notion of truth violate their > philosophical underpinnings. > > https://plato.stanford.edu/entries/justep-foundational/ Foundationalism in the sense used in the above article has absolutely nothing to do with mathematics or mathematical truth. It is a theory of *epistemlogy*. 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-18 15:01 -0500 |
| Message-ID | <vOidneXK0sa2AhHCnZ2dnUU7-XOdnZ2d@giganews.com> |
| In reply to | #23956 |
On 10/18/2020 11:42 AM, André G. Isaak wrote: > On 2020-10-18 10:24, olcott wrote: >> On 10/18/2020 9:34 AM, Mike Terry wrote: >>> On 18/10/2020 04:31, Jeff Barnett wrote: >>>> On 10/17/2020 8:23 PM, olcott wrote: >>>>> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>>>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>>>>> existance of undecidable propositions does not ever never decide >>>>>>> incomplete formal systems. >>>>>> >>>>>> You have nothing but this word game? Really? You are free to say >>>>>> that >>>>>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>>>>> Incomplete(T) (because that's just your own made-up predicate with a >>>>>> deliberately confusing name), but you don't get to say that it >>>>>> does not >>>>>> mean that T is incomplete (because that's not your word to redefine). >>>>>> >>>>> >>>>> Heh at least we are finally on the same page of what I have been >>>>> saying. >>>>> Ultimately it is not up to any living being to stipulate the >>>>> fundamental nature of truth itself, Truth totally speaks for itself on >>>>> this. + >>>>> >>>>>> Some formal system have sentences that can't be proved or refuted >>>>>> from >>>>>> the axioms and the rest of the world will continue to investigate >>>>>> these >>>>>> systems, and to talk about their undecidable sentences, no matter >>>>>> what >>>>>> name you give them. >>>>>> >>>>> Yes they will do this right on up to the point where they realize that >>>>> they have been fooled the whole time. As soon as they realize that the >>>>> only reason that some expressions of language are undecidable is that >>>>> they are incorrect they will quit studying this. >>>>> >>>>>> And since there is no effective procedure to determine if >>>>>> Incorrect(φ), >>>>> >>>>> If there is no effective procedure to decide a sentence is incorrect >>>>> then there is no effective procedure to decide that a formal system is >>>>> incomplete because it is the exact same procedure. (Nitwit) >>>>> >>>>> You and Andre are making the very stupid mistake of conflating >>>>> existential with universal quantification. It is such a stupid mistake >>>>> that I really can't believe that it is an actual mistake that is what >>>>> I call is a lie. >>>>> >>>>> A theory T is incomplete if and only if there is some sentence φ such >>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>> >>>>> Maybe you really are too dumb to know that the above is existential >>>>> not universal quantification. >>>>> >>>>>> you are not even offering anything of practical value. >>>>> >>>>> Ultimately the practical value is the correct formalization of the >>>>> notion of truth itself to be used as the most basic foundation of >>>>> strong AI. AI that does not have a formalized notion of truth has a >>>>> frontal lobotomy. (AKA severe brain damage). >>>>> >>>>>> Apart from a few >>>>>> particular cases, you will never know if Incorrect(φ) is true for any >>>>>> given sentence. >>>>> >>>>> All that we need to know is that in every single case where theory T >>>>> is decided to be incomplete on the basis of undecidable expression φ >>>>> of language of T we decide that φ is incorrect leaving zero systems in >>>>> the universe that are incomplete on the basis of undecidable >>>>> expressions. >>>> >>>> PO, considered as a system, is undecidable: we can't prove whether >>>> he is >>>> 1) a troll, >>> >>> I don't think he is a troll. I think he believes everything he says. >>> >>>> 2) blatantly ignorant of almost every relevant result and >>>> how it was developed, >>> >>> Yes, blatantly (and proudly) so. He can't follow the reasonings >>> behind the basic concepts in the fields he chooses to write about, >>> preferring to overturn key results by eliminating the extraneous >>> complexity (aka stuff he doesn't understand) and "correcting" various >>> definitions to make things he doesn't like go away. >>> >>>> 3) ambitious but stupid, or >>> >>> He has some strange goals and motivations - e.g. he is really not >>> interested at all in mathematics or logic per se, and sees >>> overturning of the key results as a rather tedious chore he must >>> undertake in order to establish his reputation in the field. And he >>> needs to do this, because without this, Doug Lenat will not consider >>> putting him in charge of the Cyc project development, which is a key >>> stepping stone for him to become the first human being to create a >>> human mind in a computer. >>> >>> Do elements of that seem a little ambitious, and stupid? (A little >>> naive and deluded, perhaps?) >>> >>> The stupid bit is also apparent in his arguments, and his inability >>> to follow the arguments presented by others in his chosen fields. >>> E.g. he is proud to have spent 20 years or so studying a half dozen >>> pages in a book by Linz, covering the Halting Problem proof. This is >>> something which quite average students understand in a couple of >>> hours, I would guess. If you have to spend more than a day >>> "studying" it, that would seem to be a sign that you haven't actually >>> understood the big picture of the proof (let alone any messy details >>> of data representations that are sort of inevitable in this sort of >>> proof). >>> >>>> 4) some weird >>>> combination of 1 thru 3. >>> >>> I would go with the combination: deluded and dumb. (The >>> alliteration makes it sound like a catchy slogan or one of those >>> trendy hashtags :) ) >>> >>> The vast majority of people don't understand any mathematics, >>> computer science, formal logic etc., and of course there's nothing >>> embarrassing in this. But 99.999% of those people /realise/ they >>> don't know any of this, and wouldn't go to a focussed forum on the >>> subjects to donate their various naive intuitions. And of the >>> remaining people who tried this, probably 90% would look at the >>> responses they got, and realise "hey, I need to find out a bit more >>> about all this before embarrassing myself any further". PO is in the >>> 10% of the 0.001% that for some reason blindly sticks with it. (I >>> don't think anyone could get through the filter without being >>> fundamentally deluded, and that's ignoring all his "God stuff"...) >>> >>> Naturally, PO would counter with "I'm afraid you've got this all >>> wrong; I'm an unrecognised genius, with powers of concentration and >>> reasoning beyond nearly every other human being in existence etc.", >>> but that's just his delusions in action. >>> >>> You can't undelude(?) someone by carefully explaining that they're >>> deluded. When he finally delivers his HP refutation, and people >>> quickly point out the problems with his arguments, and the papers he >>> sends to reputable journals are incomprehensibly rejected, he won't >>> say "hmm, looks like I've been wrong for 20 years after all!". >>> Delusional frameworks readily adapt to new conflicting evidence as it >>> comes along, and he'll just carry on as he always has. >>> >>> >>> Mike. >>> >> >> The mathematical foundations of the notion of truth violate their >> philosophical underpinnings. >> >> https://plato.stanford.edu/entries/justep-foundational/ > > Foundationalism in the sense used in the above article has absolutely > nothing to do with mathematics or mathematical truth. It is a theory of > *epistemlogy*. > > André > It is the foundation of all truth. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-18 14:18 -0600 |
| Message-ID | <rmi7up$8ba$1@dont-email.me> |
| In reply to | #23967 |
On 2020-10-18 14:01, olcott wrote: > On 10/18/2020 11:42 AM, André G. Isaak wrote: >> On 2020-10-18 10:24, olcott wrote: >>> On 10/18/2020 9:34 AM, Mike Terry wrote: >>>> On 18/10/2020 04:31, Jeff Barnett wrote: >>>>> On 10/17/2020 8:23 PM, olcott wrote: >>>>>> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>>>>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>>>>>> existance of undecidable propositions does not ever never decide >>>>>>>> incomplete formal systems. >>>>>>> >>>>>>> You have nothing but this word game? Really? You are free to >>>>>>> say that >>>>>>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>>>>>> Incomplete(T) (because that's just your own made-up predicate with a >>>>>>> deliberately confusing name), but you don't get to say that it >>>>>>> does not >>>>>>> mean that T is incomplete (because that's not your word to >>>>>>> redefine). >>>>>>> >>>>>> >>>>>> Heh at least we are finally on the same page of what I have been >>>>>> saying. >>>>>> Ultimately it is not up to any living being to stipulate the >>>>>> fundamental nature of truth itself, Truth totally speaks for >>>>>> itself on >>>>>> this. + >>>>>> >>>>>>> Some formal system have sentences that can't be proved or refuted >>>>>>> from >>>>>>> the axioms and the rest of the world will continue to investigate >>>>>>> these >>>>>>> systems, and to talk about their undecidable sentences, no matter >>>>>>> what >>>>>>> name you give them. >>>>>>> >>>>>> Yes they will do this right on up to the point where they realize >>>>>> that >>>>>> they have been fooled the whole time. As soon as they realize that >>>>>> the >>>>>> only reason that some expressions of language are undecidable is that >>>>>> they are incorrect they will quit studying this. >>>>>> >>>>>>> And since there is no effective procedure to determine if >>>>>>> Incorrect(φ), >>>>>> >>>>>> If there is no effective procedure to decide a sentence is incorrect >>>>>> then there is no effective procedure to decide that a formal >>>>>> system is >>>>>> incomplete because it is the exact same procedure. (Nitwit) >>>>>> >>>>>> You and Andre are making the very stupid mistake of conflating >>>>>> existential with universal quantification. It is such a stupid >>>>>> mistake >>>>>> that I really can't believe that it is an actual mistake that is what >>>>>> I call is a lie. >>>>>> >>>>>> A theory T is incomplete if and only if there is some sentence φ such >>>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>> >>>>>> Maybe you really are too dumb to know that the above is existential >>>>>> not universal quantification. >>>>>> >>>>>>> you are not even offering anything of practical value. >>>>>> >>>>>> Ultimately the practical value is the correct formalization of the >>>>>> notion of truth itself to be used as the most basic foundation of >>>>>> strong AI. AI that does not have a formalized notion of truth has a >>>>>> frontal lobotomy. (AKA severe brain damage). >>>>>> >>>>>>> Apart from a few >>>>>>> particular cases, you will never know if Incorrect(φ) is true for >>>>>>> any >>>>>>> given sentence. >>>>>> >>>>>> All that we need to know is that in every single case where theory T >>>>>> is decided to be incomplete on the basis of undecidable expression φ >>>>>> of language of T we decide that φ is incorrect leaving zero >>>>>> systems in >>>>>> the universe that are incomplete on the basis of undecidable >>>>>> expressions. >>>>> >>>>> PO, considered as a system, is undecidable: we can't prove whether >>>>> he is >>>>> 1) a troll, >>>> >>>> I don't think he is a troll. I think he believes everything he says. >>>> >>>>> 2) blatantly ignorant of almost every relevant result and >>>>> how it was developed, >>>> >>>> Yes, blatantly (and proudly) so. He can't follow the reasonings >>>> behind the basic concepts in the fields he chooses to write about, >>>> preferring to overturn key results by eliminating the extraneous >>>> complexity (aka stuff he doesn't understand) and "correcting" >>>> various definitions to make things he doesn't like go away. >>>> >>>>> 3) ambitious but stupid, or >>>> >>>> He has some strange goals and motivations - e.g. he is really not >>>> interested at all in mathematics or logic per se, and sees >>>> overturning of the key results as a rather tedious chore he must >>>> undertake in order to establish his reputation in the field. And he >>>> needs to do this, because without this, Doug Lenat will not consider >>>> putting him in charge of the Cyc project development, which is a key >>>> stepping stone for him to become the first human being to create a >>>> human mind in a computer. >>>> >>>> Do elements of that seem a little ambitious, and stupid? (A little >>>> naive and deluded, perhaps?) >>>> >>>> The stupid bit is also apparent in his arguments, and his inability >>>> to follow the arguments presented by others in his chosen fields. >>>> E.g. he is proud to have spent 20 years or so studying a half dozen >>>> pages in a book by Linz, covering the Halting Problem proof. This >>>> is something which quite average students understand in a couple of >>>> hours, I would guess. If you have to spend more than a day >>>> "studying" it, that would seem to be a sign that you haven't >>>> actually understood the big picture of the proof (let alone any >>>> messy details of data representations that are sort of inevitable in >>>> this sort of proof). >>>> >>>>> 4) some weird >>>>> combination of 1 thru 3. >>>> >>>> I would go with the combination: deluded and dumb. (The >>>> alliteration makes it sound like a catchy slogan or one of those >>>> trendy hashtags :) ) >>>> >>>> The vast majority of people don't understand any mathematics, >>>> computer science, formal logic etc., and of course there's nothing >>>> embarrassing in this. But 99.999% of those people /realise/ they >>>> don't know any of this, and wouldn't go to a focussed forum on the >>>> subjects to donate their various naive intuitions. And of the >>>> remaining people who tried this, probably 90% would look at the >>>> responses they got, and realise "hey, I need to find out a bit more >>>> about all this before embarrassing myself any further". PO is in >>>> the 10% of the 0.001% that for some reason blindly sticks with it. >>>> (I don't think anyone could get through the filter without being >>>> fundamentally deluded, and that's ignoring all his "God stuff"...) >>>> >>>> Naturally, PO would counter with "I'm afraid you've got this all >>>> wrong; I'm an unrecognised genius, with powers of concentration and >>>> reasoning beyond nearly every other human being in existence etc.", >>>> but that's just his delusions in action. >>>> >>>> You can't undelude(?) someone by carefully explaining that they're >>>> deluded. When he finally delivers his HP refutation, and people >>>> quickly point out the problems with his arguments, and the papers he >>>> sends to reputable journals are incomprehensibly rejected, he won't >>>> say "hmm, looks like I've been wrong for 20 years after all!". >>>> Delusional frameworks readily adapt to new conflicting evidence as >>>> it comes along, and he'll just carry on as he always has. >>>> >>>> >>>> Mike. >>>> >>> >>> The mathematical foundations of the notion of truth violate their >>> philosophical underpinnings. >>> >>> https://plato.stanford.edu/entries/justep-foundational/ >> >> Foundationalism in the sense used in the above article has absolutely >> nothing to do with mathematics or mathematical truth. It is a theory >> of *epistemlogy*. >> >> André >> > > It is the foundation of all truth. No, it isn't, because there is no single definition of 'truth'. Foundationalism is a specific position within epistemology (and not one that is universally agreed upon) that is specifically tied to correspondence theories of truth. Correspondence theories of truth relate specifically to empirical truths, not to mathematical truths. I have no idea what a 'correspondence theory of truth' would even mean in the domain of mathematics. You can't simply take claims from one domain and mindless transfer them to a completely different domain. 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-18 17:21 -0500 |
| Message-ID | <cpidnUpcq8SaXRHCnZ2dnUU7-avNnZ2d@giganews.com> |
| In reply to | #23968 |
On 10/18/2020 3:18 PM, André G. Isaak wrote: > On 2020-10-18 14:01, olcott wrote: >> On 10/18/2020 11:42 AM, André G. Isaak wrote: >>> On 2020-10-18 10:24, olcott wrote: >>>> On 10/18/2020 9:34 AM, Mike Terry wrote: >>>>> On 18/10/2020 04:31, Jeff Barnett wrote: >>>>>> On 10/17/2020 8:23 PM, olcott wrote: >>>>>>> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>>>>>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>>>>>>> existance of undecidable propositions does not ever never decide >>>>>>>>> incomplete formal systems. >>>>>>>> >>>>>>>> You have nothing but this word game? Really? You are free to >>>>>>>> say that >>>>>>>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>>>>>>> Incomplete(T) (because that's just your own made-up predicate >>>>>>>> with a >>>>>>>> deliberately confusing name), but you don't get to say that it >>>>>>>> does not >>>>>>>> mean that T is incomplete (because that's not your word to >>>>>>>> redefine). >>>>>>>> >>>>>>> >>>>>>> Heh at least we are finally on the same page of what I have been >>>>>>> saying. >>>>>>> Ultimately it is not up to any living being to stipulate the >>>>>>> fundamental nature of truth itself, Truth totally speaks for >>>>>>> itself on >>>>>>> this. + >>>>>>> >>>>>>>> Some formal system have sentences that can't be proved or >>>>>>>> refuted from >>>>>>>> the axioms and the rest of the world will continue to >>>>>>>> investigate these >>>>>>>> systems, and to talk about their undecidable sentences, no >>>>>>>> matter what >>>>>>>> name you give them. >>>>>>>> >>>>>>> Yes they will do this right on up to the point where they realize >>>>>>> that >>>>>>> they have been fooled the whole time. As soon as they realize >>>>>>> that the >>>>>>> only reason that some expressions of language are undecidable is >>>>>>> that >>>>>>> they are incorrect they will quit studying this. >>>>>>> >>>>>>>> And since there is no effective procedure to determine if >>>>>>>> Incorrect(φ), >>>>>>> >>>>>>> If there is no effective procedure to decide a sentence is incorrect >>>>>>> then there is no effective procedure to decide that a formal >>>>>>> system is >>>>>>> incomplete because it is the exact same procedure. (Nitwit) >>>>>>> >>>>>>> You and Andre are making the very stupid mistake of conflating >>>>>>> existential with universal quantification. It is such a stupid >>>>>>> mistake >>>>>>> that I really can't believe that it is an actual mistake that is >>>>>>> what >>>>>>> I call is a lie. >>>>>>> >>>>>>> A theory T is incomplete if and only if there is some sentence φ >>>>>>> such >>>>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>> >>>>>>> Maybe you really are too dumb to know that the above is existential >>>>>>> not universal quantification. >>>>>>> >>>>>>>> you are not even offering anything of practical value. >>>>>>> >>>>>>> Ultimately the practical value is the correct formalization of the >>>>>>> notion of truth itself to be used as the most basic foundation of >>>>>>> strong AI. AI that does not have a formalized notion of truth has a >>>>>>> frontal lobotomy. (AKA severe brain damage). >>>>>>> >>>>>>>> Apart from a few >>>>>>>> particular cases, you will never know if Incorrect(φ) is true >>>>>>>> for any >>>>>>>> given sentence. >>>>>>> >>>>>>> All that we need to know is that in every single case where theory T >>>>>>> is decided to be incomplete on the basis of undecidable expression φ >>>>>>> of language of T we decide that φ is incorrect leaving zero >>>>>>> systems in >>>>>>> the universe that are incomplete on the basis of undecidable >>>>>>> expressions. >>>>>> >>>>>> PO, considered as a system, is undecidable: we can't prove whether >>>>>> he is >>>>>> 1) a troll, >>>>> >>>>> I don't think he is a troll. I think he believes everything he says. >>>>> >>>>>> 2) blatantly ignorant of almost every relevant result and >>>>>> how it was developed, >>>>> >>>>> Yes, blatantly (and proudly) so. He can't follow the reasonings >>>>> behind the basic concepts in the fields he chooses to write about, >>>>> preferring to overturn key results by eliminating the extraneous >>>>> complexity (aka stuff he doesn't understand) and "correcting" >>>>> various definitions to make things he doesn't like go away. >>>>> >>>>>> 3) ambitious but stupid, or >>>>> >>>>> He has some strange goals and motivations - e.g. he is really not >>>>> interested at all in mathematics or logic per se, and sees >>>>> overturning of the key results as a rather tedious chore he must >>>>> undertake in order to establish his reputation in the field. And >>>>> he needs to do this, because without this, Doug Lenat will not >>>>> consider putting him in charge of the Cyc project development, >>>>> which is a key stepping stone for him to become the first human >>>>> being to create a human mind in a computer. >>>>> >>>>> Do elements of that seem a little ambitious, and stupid? (A little >>>>> naive and deluded, perhaps?) >>>>> >>>>> The stupid bit is also apparent in his arguments, and his inability >>>>> to follow the arguments presented by others in his chosen fields. >>>>> E.g. he is proud to have spent 20 years or so studying a half dozen >>>>> pages in a book by Linz, covering the Halting Problem proof. This >>>>> is something which quite average students understand in a couple of >>>>> hours, I would guess. If you have to spend more than a day >>>>> "studying" it, that would seem to be a sign that you haven't >>>>> actually understood the big picture of the proof (let alone any >>>>> messy details of data representations that are sort of inevitable >>>>> in this sort of proof). >>>>> >>>>>> 4) some weird >>>>>> combination of 1 thru 3. >>>>> >>>>> I would go with the combination: deluded and dumb. (The >>>>> alliteration makes it sound like a catchy slogan or one of those >>>>> trendy hashtags :) ) >>>>> >>>>> The vast majority of people don't understand any mathematics, >>>>> computer science, formal logic etc., and of course there's nothing >>>>> embarrassing in this. But 99.999% of those people /realise/ they >>>>> don't know any of this, and wouldn't go to a focussed forum on the >>>>> subjects to donate their various naive intuitions. And of the >>>>> remaining people who tried this, probably 90% would look at the >>>>> responses they got, and realise "hey, I need to find out a bit more >>>>> about all this before embarrassing myself any further". PO is in >>>>> the 10% of the 0.001% that for some reason blindly sticks with it. >>>>> (I don't think anyone could get through the filter without being >>>>> fundamentally deluded, and that's ignoring all his "God stuff"...) >>>>> >>>>> Naturally, PO would counter with "I'm afraid you've got this all >>>>> wrong; I'm an unrecognised genius, with powers of concentration and >>>>> reasoning beyond nearly every other human being in existence etc.", >>>>> but that's just his delusions in action. >>>>> >>>>> You can't undelude(?) someone by carefully explaining that they're >>>>> deluded. When he finally delivers his HP refutation, and people >>>>> quickly point out the problems with his arguments, and the papers >>>>> he sends to reputable journals are incomprehensibly rejected, he >>>>> won't say "hmm, looks like I've been wrong for 20 years after >>>>> all!". Delusional frameworks readily adapt to new conflicting >>>>> evidence as it comes along, and he'll just carry on as he always has. >>>>> >>>>> >>>>> Mike. >>>>> >>>> >>>> The mathematical foundations of the notion of truth violate their >>>> philosophical underpinnings. >>>> >>>> https://plato.stanford.edu/entries/justep-foundational/ >>> >>> Foundationalism in the sense used in the above article has absolutely >>> nothing to do with mathematics or mathematical truth. It is a theory >>> of *epistemlogy*. >>> >>> André >>> >> >> It is the foundation of all truth. > > No, it isn't, because there is no single definition of 'truth'. > Foundationalism is a specific position within epistemology (and not one > that is universally agreed upon) that is specifically tied to > correspondence theories of truth. > > Correspondence theories of truth relate specifically to empirical > truths, not to mathematical truths. I have no idea what a > 'correspondence theory of truth' would even mean in the domain of > mathematics. > > You can't simply take claims from one domain and mindless transfer them > to a completely different domain. > > André > I have never ever been talking about empirical truth. I have always been talking about analytical truth. logically justified complete certainty only applies to analytical truth. There are a set of propositions that are not possibly not true. All of the propositions that are not possibly not true are not possibly not true for the exact same reason. That squares are not round is not possibly not true. Every prposition that can be known to be true entirely on the basis of its meaning is not possibly not true. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 21:11 -0500 |
| Message-ID | <t_6dnflgSMRaaBHCnZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #23968 |
On 10/18/2020 3:18 PM, André G. Isaak wrote: > On 2020-10-18 14:01, olcott wrote: >> On 10/18/2020 11:42 AM, André G. Isaak wrote: >>> On 2020-10-18 10:24, olcott wrote: >>>> On 10/18/2020 9:34 AM, Mike Terry wrote: >>>>> On 18/10/2020 04:31, Jeff Barnett wrote: >>>>>> On 10/17/2020 8:23 PM, olcott wrote: >>>>>>> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>>>>>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>>>>>>> existance of undecidable propositions does not ever never decide >>>>>>>>> incomplete formal systems. >>>>>>>> >>>>>>>> You have nothing but this word game? Really? You are free to >>>>>>>> say that >>>>>>>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>>>>>>> Incomplete(T) (because that's just your own made-up predicate >>>>>>>> with a >>>>>>>> deliberately confusing name), but you don't get to say that it >>>>>>>> does not >>>>>>>> mean that T is incomplete (because that's not your word to >>>>>>>> redefine). >>>>>>>> >>>>>>> >>>>>>> Heh at least we are finally on the same page of what I have been >>>>>>> saying. >>>>>>> Ultimately it is not up to any living being to stipulate the >>>>>>> fundamental nature of truth itself, Truth totally speaks for >>>>>>> itself on >>>>>>> this. + >>>>>>> >>>>>>>> Some formal system have sentences that can't be proved or >>>>>>>> refuted from >>>>>>>> the axioms and the rest of the world will continue to >>>>>>>> investigate these >>>>>>>> systems, and to talk about their undecidable sentences, no >>>>>>>> matter what >>>>>>>> name you give them. >>>>>>>> >>>>>>> Yes they will do this right on up to the point where they realize >>>>>>> that >>>>>>> they have been fooled the whole time. As soon as they realize >>>>>>> that the >>>>>>> only reason that some expressions of language are undecidable is >>>>>>> that >>>>>>> they are incorrect they will quit studying this. >>>>>>> >>>>>>>> And since there is no effective procedure to determine if >>>>>>>> Incorrect(φ), >>>>>>> >>>>>>> If there is no effective procedure to decide a sentence is incorrect >>>>>>> then there is no effective procedure to decide that a formal >>>>>>> system is >>>>>>> incomplete because it is the exact same procedure. (Nitwit) >>>>>>> >>>>>>> You and Andre are making the very stupid mistake of conflating >>>>>>> existential with universal quantification. It is such a stupid >>>>>>> mistake >>>>>>> that I really can't believe that it is an actual mistake that is >>>>>>> what >>>>>>> I call is a lie. >>>>>>> >>>>>>> A theory T is incomplete if and only if there is some sentence φ >>>>>>> such >>>>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>> >>>>>>> Maybe you really are too dumb to know that the above is existential >>>>>>> not universal quantification. >>>>>>> >>>>>>>> you are not even offering anything of practical value. >>>>>>> >>>>>>> Ultimately the practical value is the correct formalization of the >>>>>>> notion of truth itself to be used as the most basic foundation of >>>>>>> strong AI. AI that does not have a formalized notion of truth has a >>>>>>> frontal lobotomy. (AKA severe brain damage). >>>>>>> >>>>>>>> Apart from a few >>>>>>>> particular cases, you will never know if Incorrect(φ) is true >>>>>>>> for any >>>>>>>> given sentence. >>>>>>> >>>>>>> All that we need to know is that in every single case where theory T >>>>>>> is decided to be incomplete on the basis of undecidable expression φ >>>>>>> of language of T we decide that φ is incorrect leaving zero >>>>>>> systems in >>>>>>> the universe that are incomplete on the basis of undecidable >>>>>>> expressions. >>>>>> >>>>>> PO, considered as a system, is undecidable: we can't prove whether >>>>>> he is >>>>>> 1) a troll, >>>>> >>>>> I don't think he is a troll. I think he believes everything he says. >>>>> >>>>>> 2) blatantly ignorant of almost every relevant result and >>>>>> how it was developed, >>>>> >>>>> Yes, blatantly (and proudly) so. He can't follow the reasonings >>>>> behind the basic concepts in the fields he chooses to write about, >>>>> preferring to overturn key results by eliminating the extraneous >>>>> complexity (aka stuff he doesn't understand) and "correcting" >>>>> various definitions to make things he doesn't like go away. >>>>> >>>>>> 3) ambitious but stupid, or >>>>> >>>>> He has some strange goals and motivations - e.g. he is really not >>>>> interested at all in mathematics or logic per se, and sees >>>>> overturning of the key results as a rather tedious chore he must >>>>> undertake in order to establish his reputation in the field. And >>>>> he needs to do this, because without this, Doug Lenat will not >>>>> consider putting him in charge of the Cyc project development, >>>>> which is a key stepping stone for him to become the first human >>>>> being to create a human mind in a computer. >>>>> >>>>> Do elements of that seem a little ambitious, and stupid? (A little >>>>> naive and deluded, perhaps?) >>>>> >>>>> The stupid bit is also apparent in his arguments, and his inability >>>>> to follow the arguments presented by others in his chosen fields. >>>>> E.g. he is proud to have spent 20 years or so studying a half dozen >>>>> pages in a book by Linz, covering the Halting Problem proof. This >>>>> is something which quite average students understand in a couple of >>>>> hours, I would guess. If you have to spend more than a day >>>>> "studying" it, that would seem to be a sign that you haven't >>>>> actually understood the big picture of the proof (let alone any >>>>> messy details of data representations that are sort of inevitable >>>>> in this sort of proof). >>>>> >>>>>> 4) some weird >>>>>> combination of 1 thru 3. >>>>> >>>>> I would go with the combination: deluded and dumb. (The >>>>> alliteration makes it sound like a catchy slogan or one of those >>>>> trendy hashtags :) ) >>>>> >>>>> The vast majority of people don't understand any mathematics, >>>>> computer science, formal logic etc., and of course there's nothing >>>>> embarrassing in this. But 99.999% of those people /realise/ they >>>>> don't know any of this, and wouldn't go to a focussed forum on the >>>>> subjects to donate their various naive intuitions. And of the >>>>> remaining people who tried this, probably 90% would look at the >>>>> responses they got, and realise "hey, I need to find out a bit more >>>>> about all this before embarrassing myself any further". PO is in >>>>> the 10% of the 0.001% that for some reason blindly sticks with it. >>>>> (I don't think anyone could get through the filter without being >>>>> fundamentally deluded, and that's ignoring all his "God stuff"...) >>>>> >>>>> Naturally, PO would counter with "I'm afraid you've got this all >>>>> wrong; I'm an unrecognised genius, with powers of concentration and >>>>> reasoning beyond nearly every other human being in existence etc.", >>>>> but that's just his delusions in action. >>>>> >>>>> You can't undelude(?) someone by carefully explaining that they're >>>>> deluded. When he finally delivers his HP refutation, and people >>>>> quickly point out the problems with his arguments, and the papers >>>>> he sends to reputable journals are incomprehensibly rejected, he >>>>> won't say "hmm, looks like I've been wrong for 20 years after >>>>> all!". Delusional frameworks readily adapt to new conflicting >>>>> evidence as it comes along, and he'll just carry on as he always has. >>>>> >>>>> >>>>> Mike. >>>>> >>>> >>>> The mathematical foundations of the notion of truth violate their >>>> philosophical underpinnings. >>>> >>>> https://plato.stanford.edu/entries/justep-foundational/ >>> >>> Foundationalism in the sense used in the above article has absolutely >>> nothing to do with mathematics or mathematical truth. It is a theory >>> of *epistemlogy*. >>> >>> André >>> >> >> It is the foundation of all truth. > > No, it isn't, because there is no single definition of 'truth'. Sure there is. For the entire body of analytical knowledge** where an expression of language is only true by virtue of its meaning the only way to establish that an expression of language is true is by a connected set of semantic meanings. That is why the sound deductive inference model is the only correct basis for establishing truth. It begins with propositions that are defined to be true. Applies truth preserving operations. Then derives conclusions that are ncessarily true. **Of which all of mathematics is a tiny subset When mathematics makes sure to ignore semantic meanings it is just like a medical doctor that ignores the disease model of medical science. > Foundationalism is a specific position within epistemology (and not one > that is universally agreed upon) that is specifically tied to > correspondence theories of truth. > > Correspondence theories of truth relate specifically to empirical > truths, not to mathematical truths. I have no idea what a > 'correspondence theory of truth' would even mean in the domain of > mathematics. > > You can't simply take claims from one domain and mindless transfer them > to a completely different domain. > > André > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-18 01:21 -0600 |
| Message-ID | <rmgqea$3au$1@dont-email.me> |
| In reply to | #23934 |
On 2020-10-17 20:23, olcott wrote: > On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>> means Incorrect(φ) and not Incomplete(T) then we know that the >>> existance of undecidable propositions does not ever never decide >>> incomplete formal systems. >> >> You have nothing but this word game? Really? You are free to say that >> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >> Incomplete(T) (because that's just your own made-up predicate with a >> deliberately confusing name), but you don't get to say that it does not >> mean that T is incomplete (because that's not your word to redefine). >> > > Heh at least we are finally on the same page of what I have been saying. > Ultimately it is not up to any living being to stipulate the fundamental > nature of truth itself, Truth totally speaks for itself on this. + > >> Some formal system have sentences that can't be proved or refuted from >> the axioms and the rest of the world will continue to investigate these >> systems, and to talk about their undecidable sentences, no matter what >> name you give them. >> > Yes they will do this right on up to the point where they realize that > they have been fooled the whole time. As soon as they realize that the > only reason that some expressions of language are undecidable is that > they are incorrect they will quit studying this. > >> And since there is no effective procedure to determine if Incorrect(φ), > > If there is no effective procedure to decide a sentence is incorrect > then there is no effective procedure to decide that a formal system is > incomplete because it is the exact same procedure. (Nitwit) Of course it isn't. There are some propositions which can be shown to be undecidable. There is no general procedure for determining if a proposition is undecidable. To show that a system is incomplete, one need only identify a single proposition that can be shown to be undecidable. To exclude *every* undecidable proposition from a system, you actually need a way of identifying every undecidable proposition which is undecidable, and no such method exists. Since you cannot do this, you are effectively saying that you have a system which generates all sorts of 'incorrect' propositions, but that, except for a few special cases, you have no way of identifying which propositions are 'correct' and which are 'incorrect'. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2020-10-18 00:48 -0700 |
| Message-ID | <87y2k47z5t.fsf@nosuchdomain.example.com> |
| In reply to | #23938 |
André G. Isaak <agisaak@gm.invalid> writes:
[...]
> To show that a system is incomplete, one need only identify a single
> proposition that can be shown to be undecidable.
[...]
Or, if I'm not mistaken, one could merely prove that *some* proposition
can be shown to be undecidable, without necessarily having to specify
what that proposition is. (Whether that's easier than actually
identifying an undecidable proposition is another matter.)
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
Working, but not speaking, for Philips Healthcare
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 09:58 -0500 |
| Message-ID | <v4idnQtsMpGQxRHCnZ2dnUU7-L3NnZ2d@giganews.com> |
| In reply to | #23940 |
On 10/18/2020 2:48 AM, Keith Thompson wrote: > André G. Isaak <agisaak@gm.invalid> writes: > [...] >> To show that a system is incomplete, one need only identify a single >> proposition that can be shown to be undecidable. > [...] > > Or, if I'm not mistaken, one could merely prove that *some* proposition > can be shown to be undecidable, without necessarily having to specify > what that proposition is. (Whether that's easier than actually > identifying an undecidable proposition is another matter.) > (1) A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). (2) An expression φ of the language of theory T is incorrect if and only if (T ⊬ φ) and (T ⊬ ¬φ). When we change (1) to (2) undecidable expressions of language φ never ever prove that theory T is incomplete. This removes incompleteness as a roadblock to fulfilling Hilbert's program. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2020-10-18 16:07 +0100 |
| Message-ID | <rmhlmk$32n$1@gioia.aioe.org> |
| In reply to | #23943 |
On 18/10/2020 15:58, olcott wrote: > When we change (1) to (2) undecidable expressions of language φ never > ever prove that theory T is incomplete. > This removes incompleteness as a roadblock to fulfilling Hilbert's program. It makes not a blind bit of difference to which interesting or otherwise conjectures you can prove or disprove or to attempts to find algorithms to prove things. All you have done is re-word things, and not in a useful way. Sorry. -- Andy Walker, Nottingham. Andy's music pages: www.cuboid.me.uk/andy/Music Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Coleridge-Taylor
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 11:18 -0500 |
| Message-ID | <nIOdnXdOlcxP9xHCnZ2dnUU7-N2dnZ2d@giganews.com> |
| In reply to | #23944 |
On 10/18/2020 10:07 AM, Andy Walker wrote: > On 18/10/2020 15:58, olcott wrote: >> When we change (1) to (2) undecidable expressions of language φ never >> ever prove that theory T is incomplete. >> This removes incompleteness as a roadblock to fulfilling Hilbert's >> program. > > It makes not a blind bit of difference to which interesting or > otherwise conjectures you can prove or disprove or to attempts to find > algorithms to prove things. All you have done is re-word things, and > not in a useful way. Sorry. > A system cannot be decided to be incomplete on the basis of its inability to prove or disprove incorrect expressions of language for the exact same reason that a medical doctor cannot be decided to be incompetent on the basis that they cannot restore heath to the cremated. By changing its name we also change its category and thus change it set of properries. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-18 09:05 -0700 |
| Message-ID | <9214fe98-23d3-4ad2-a2de-8812e088890co@googlegroups.com> |
| In reply to | #23943 |
On Sunday, October 18, 2020 at 7:58:30 AM UTC-7, olcott wrote: > (1) A theory T is incomplete if and only if there is some sentence φ > such that (T ⊬ φ) and (T ⊬ ¬φ). > > (2) An expression φ of the language of theory T is incorrect if and only > if (T ⊬ φ) and (T ⊬ ¬φ). > > When we change (1) to (2) undecidable expressions of language φ never > ever prove that theory T is incomplete. > > This removes incompleteness as a roadblock to fulfilling Hilbert's program. The error in this piece of reasoning is that renaming "incomplete" to "incorrect" does not change the existence and truth value of the expressions and such expressions remain obstacles to Hilbert's program under any name. That is: The error is: Changing the name of something does not change its nature in any way.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 11:16 -0500 |
| Message-ID | <nIOdnXROlczk9xHCnZ2dnUU7-N2dnZ2d@giganews.com> |
| In reply to | #23946 |
On 10/18/2020 11:05 AM, David Kleinecke wrote: > On Sunday, October 18, 2020 at 7:58:30 AM UTC-7, olcott wrote: >> (1) A theory T is incomplete if and only if there is some sentence φ >> such that (T ⊬ φ) and (T ⊬ ¬φ). >> >> (2) An expression φ of the language of theory T is incorrect if and only >> if (T ⊬ φ) and (T ⊬ ¬φ). >> >> When we change (1) to (2) undecidable expressions of language φ never >> ever prove that theory T is incomplete. >> >> This removes incompleteness as a roadblock to fulfilling Hilbert's program. > > The error in this piece of reasoning is that renaming > "incomplete" to "incorrect" does not change the existence and > truth value of the expressions and such expressions remain > obstacles to Hilbert's program under any name. > A system cannot be decided to be incomplete on the basis of its inability to prove or disprove incorrect expressions of language for the exact same reason that a medical doctor cannot be decided to be incompetent on the basis that they cannot restore heath to the cremated. > That is: The error is: Changing the name of something does not > change its nature in any way. > By changing its name we also change its category. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-18 10:44 -0700 |
| Message-ID | <4b6031c9-8d7f-49da-9013-dcaf4e4d23e6o@googlegroups.com> |
| In reply to | #23950 |
On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: > On 10/18/2020 11:05 AM, David Kleinecke wrote: > > > Changing the name of something does not > > change its nature in any way. > > > > By changing its name we also change its category. OK. What do you mean here by "category"? No theory I am aware of has a principal like the one you have just annunciated.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 13:04 -0500 |
| Message-ID | <WcmdnaM2sc8CHhHCnZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #23960 |
On 10/18/2020 12:44 PM, David Kleinecke wrote: > On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: >> On 10/18/2020 11:05 AM, David Kleinecke wrote: >> >>> Changing the name of something does not >>> change its nature in any way. >>> >> >> By changing its name we also change its category. > > OK. What do you mean here by "category"? > When an undecidable sentence ceases to be construed as a valid sentence that that a formal system can't prove and is placed into the category of an incorrect expression of language the "blame" shifts from the formal system to the expression of language. (T ⊬ φ) and (T ⊬ ¬φ). Incomplete(T) and Correct(φ) has their categories changed to ~Incomplete(T) and ~Correct(φ) > No theory I am aware of has a principal like the one > you have just annunciated. > Like I keep saying over and over and over: I am talking about the steps required to verify that an expression of language is true on the basis of the philosophical subject of foundationalism. https://plato.stanford.edu/entries/justep-foundational/ Math really is not free to stipulate how the notion of Truth actually works. This whole subject is even outside the realm of meta-math. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-18 15:55 -0700 |
| Message-ID | <b52dbe45-17b1-4dde-8b2e-c3e11e170489o@googlegroups.com> |
| In reply to | #23961 |
On Sunday, October 18, 2020 at 11:04:23 AM UTC-7, olcott wrote: > On 10/18/2020 12:44 PM, David Kleinecke wrote: > > On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: > >> On 10/18/2020 11:05 AM, David Kleinecke wrote: > >> > >>> Changing the name of something does not > >>> change its nature in any way. > >>> > >> > >> By changing its name we also change its category. > > > > OK. What do you mean here by "category"? > > > > When an undecidable sentence ceases to be construed as a valid sentence Aha. I see that you are associating the set of all things with a particular name with that name so that by changing the name you change the set membership. That is an especially primitive fallacy and probably has a name that I don't know. "When A ceases to be construed as B and is placed into C, D shifts from E to F." asserts that a change in name causes further changes. This is an error unless "construed as B" is not about the name but about the set membership. Names and set membership do not interact. > that that a formal system can't prove and is placed into the category of > an incorrect expression of language the "blame" shifts from the formal > system to the expression of language. > > (T ⊬ φ) and (T ⊬ ¬φ). > Incomplete(T) and Correct(φ) has their categories changed to > ~Incomplete(T) and ~Correct(φ) > > > No theory I am aware of has a principal like the one > > you have just annunciated. > > > > Like I keep saying over and over and over: > I am talking about the steps required to verify that an expression of > language is true on the basis of the philosophical subject of > foundationalism. https://plato.stanford.edu/entries/justep-foundational/ > > Math really is not free to stipulate how the notion of Truth actually > works. This whole subject is even outside the realm of meta-math. > > -- > Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 18:05 -0500 |
| Message-ID | <NNqdnVmX3oymVxHCnZ2dnUU7-XXNnZ2d@giganews.com> |
| In reply to | #23972 |
On 10/18/2020 5:55 PM, David Kleinecke wrote: > On Sunday, October 18, 2020 at 11:04:23 AM UTC-7, olcott wrote: >> On 10/18/2020 12:44 PM, David Kleinecke wrote: >>> On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: >>>> On 10/18/2020 11:05 AM, David Kleinecke wrote: >>>> >>>>> Changing the name of something does not >>>>> change its nature in any way. >>>>> >>>> >>>> By changing its name we also change its category. >>> >>> OK. What do you mean here by "category"? >>> >> >> When an undecidable sentence ceases to be construed as a valid sentence > > Aha. I see that you are associating the set of all things with > a particular name with that name so that by changing the name > you change the set membership. That is an especially primitive > fallacy and probably has a name that I don't know. > > "When A ceases to be construed as B and is placed into C, D shifts > from E to F." asserts that a change in name causes further changes. > This is an error unless "construed as B" is not about the name but > about the set membership. Names and set membership do not interact. Yes I an correcting its incorrect set membership. If a call a cat a dog yet the cat retains all the properties of a cat I err. If I call a cat a dog because the cat has all the properties of a dog and none of the properties of a cat then I have corrected a classification error. Undecidable propositions are only undecidable because they are incorrect. > >> that that a formal system can't prove and is placed into the category of >> an incorrect expression of language the "blame" shifts from the formal >> system to the expression of language. >> >> (T ⊬ φ) and (T ⊬ ¬φ). >> Incomplete(T) and Correct(φ) has their categories changed to >> ~Incomplete(T) and ~Correct(φ) >> >>> No theory I am aware of has a principal like the one >>> you have just annunciated. >>> >> >> Like I keep saying over and over and over: >> I am talking about the steps required to verify that an expression of >> language is true on the basis of the philosophical subject of >> foundationalism. https://plato.stanford.edu/entries/justep-foundational/ >> >> Math really is not free to stipulate how the notion of Truth actually >> works. This whole subject is even outside the realm of meta-math. >> >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-19 01:17 +0100 |
| Message-ID | <87d01fhxvx.fsf@bsb.me.uk> |
| In reply to | #23973 |
olcott <NoOne@NoWhere.com> writes: <cut> > Undecidable propositions are only undecidable because they are > incorrect. Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) What is incorrect about x+y=y+x? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 20:52 -0500 |
| Message-ID | <X6ednXXUe7vQbBHCnZ2dnUU7-TvNnZ2d@giganews.com> |
| In reply to | #23974 |
On 10/18/2020 7:17 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > <cut> >> Undecidable propositions are only undecidable because they are >> incorrect. > > Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) > > What is incorrect about x+y=y+x? > Not provable by any means what-so-ever and true is impossible. Not provable in Q because Q is insufficiently expressive is the same as the inability to do differential calculus in baby talk: trivial. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 11 of 21 — ← Prev page 1 … 9 10 [11] 12 13 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web