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 10 of 21 — ← Prev page 1 … 8 9 [10] 11 12 … 21 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 11:45 -0500 |
| Message-ID | <OrmdnWI7aZW4UxTCnZ2dnUU7-KnNnZ2d@giganews.com> |
| In reply to | #23891 |
On 10/16/2020 10:43 AM, André G. Isaak wrote: > On 2020-10-16 09:27, olcott wrote: >> On 10/16/2020 10:07 AM, André G. Isaak wrote: > >> Every single case where we would otherwise determine that a formal >> system is incomplete on the basis of this: (T ⊬ φ) and (T ⊬ ¬φ) >> leaving zero cases where formal systems are determined to be incomplete. >> >> If all X are Y then there are no X that are not Y that you continue to >> push that even though all X are Y that some X are not Y makes it quite >> obvious that you are a liar. >> >>> So instead of an incomplete system, you instead have a system which >>> contains 'incorrect' propositions, but where you cannot identify >>> which sentences are 'incorrect' and thus have no way of actually >>> excluding them. >> >> In every single case where we would otherwise determine that a formal >> system Y is incomplete on this basis: (T ⊬ φ) and (T ⊬ ¬φ) we instead >> determine that expression φ is incorrect. >> >> This utterly eliminates every element of the set of incomplete formal >> systems. > > You are missing the point. Gödel demonstrates that formal systems with a > certain amount of expressiveness must be incomplete by providing a > method which is guaranteed to generate an undecidable proposition. He > does not provide a method for generating or identifying *every* > undecidable proposition in a system. Eliminating known undecidable > propositions from a system still leaves you with all the *unknown* > undecidable propositions in that system. > > Goldbach's conjecture has been given as an example. > You must not be very smart. You can't seem to tell the difference between an undecided proposition and an undecidable proposition. > We have been unable to prove Goldbach's conjecture, thus we cannot > conclude that it is true. > > We have been unable to disprove Goldbach's conjecture, thus we cannot > conclude that it is false. > > Based on the above, we have no basis for concluding that Goldbach's > conjecture is actually decidable. > > However, we have no proof that Goldbach's conjecture is undecidable, > either. > > Do you exclude it or not? If you exclude it, you may be excluding a true > yet as-of-yet unproven statement. If you don't exclude it, you may be > including an undecidable (though as of yet not proven to be undecidable) > proposition. > You must not be very smart. You can't seem to tell the difference between an undecided proposition and an undecidable proposition. > Either is problematic for you. > > If you want to claim that some set of propositions are excluded on the > grounds that they are 'ill-formed', minimally you need some method for > determining exactly what that set is. And no such method exists. > > <snip immature and asinine repetition> > > André > ∀T ∈ Formal_System ∀φ ∈ expression_of_language(T) (Incorrect(φ) ↔ (T ⊬ φ) ∧ (T ⊬ ¬φ)) ∀T ∈ Formal_System ∀φ ∈ expression_of_language(T) (¬Incomplete(T) ↔ (T ⊬ φ) ∧ (T ⊬ ¬φ)) -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-16 10:50 -0600 |
| Message-ID | <rmcj0v$3lv$1@dont-email.me> |
| In reply to | #23892 |
On 2020-10-16 10:45, olcott wrote: > On 10/16/2020 10:43 AM, André G. Isaak wrote: >> On 2020-10-16 09:27, olcott wrote: >>> On 10/16/2020 10:07 AM, André G. Isaak wrote: >> >>> Every single case where we would otherwise determine that a formal >>> system is incomplete on the basis of this: (T ⊬ φ) and (T ⊬ ¬φ) >>> leaving zero cases where formal systems are determined to be incomplete. >>> >>> If all X are Y then there are no X that are not Y that you continue >>> to push that even though all X are Y that some X are not Y makes it >>> quite obvious that you are a liar. >>> >>>> So instead of an incomplete system, you instead have a system which >>>> contains 'incorrect' propositions, but where you cannot identify >>>> which sentences are 'incorrect' and thus have no way of actually >>>> excluding them. >>> >>> In every single case where we would otherwise determine that a formal >>> system Y is incomplete on this basis: (T ⊬ φ) and (T ⊬ ¬φ) we instead >>> determine that expression φ is incorrect. >>> >>> This utterly eliminates every element of the set of incomplete formal >>> systems. >> >> You are missing the point. Gödel demonstrates that formal systems with >> a certain amount of expressiveness must be incomplete by providing a >> method which is guaranteed to generate an undecidable proposition. He >> does not provide a method for generating or identifying *every* >> undecidable proposition in a system. Eliminating known undecidable >> propositions from a system still leaves you with all the *unknown* >> undecidable propositions in that system. >> >> Goldbach's conjecture has been given as an example. >> > > You must not be very smart. You can't seem to tell the difference > between an undecided proposition and an undecidable proposition. > >> We have been unable to prove Goldbach's conjecture, thus we cannot >> conclude that it is true. >> >> We have been unable to disprove Goldbach's conjecture, thus we cannot >> conclude that it is false. >> >> Based on the above, we have no basis for concluding that Goldbach's >> conjecture is actually decidable. >> >> However, we have no proof that Goldbach's conjecture is undecidable, >> either. >> >> Do you exclude it or not? If you exclude it, you may be excluding a >> true yet as-of-yet unproven statement. If you don't exclude it, you >> may be including an undecidable (though as of yet not proven to be >> undecidable) proposition. >> > > You must not be very smart. You can't seem to tell the difference > between an undecided proposition and an undecidable proposition. The point is that we do not *know* whether it is an undecidable proposition or merely an undecided proposition. It *might* be undecidable. And there is no general method which will allow us to determine whether it is or is not decidable. So you have to decide whether to exclude it without actually knowing whether it is a decidable proposition or an undecidable proposition. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 12:27 -0500 |
| Message-ID | <T5ednQ8wROdtShTCnZ2dnUU7-W_NnZ2d@giganews.com> |
| In reply to | #23893 |
On 10/16/2020 11:50 AM, André G. Isaak wrote: > On 2020-10-16 10:45, olcott wrote: >> On 10/16/2020 10:43 AM, André G. Isaak wrote: >>> On 2020-10-16 09:27, olcott wrote: >>>> On 10/16/2020 10:07 AM, André G. Isaak wrote: >>> >>>> Every single case where we would otherwise determine that a formal >>>> system is incomplete on the basis of this: (T ⊬ φ) and (T ⊬ ¬φ) >>>> leaving zero cases where formal systems are determined to be >>>> incomplete. >>>> >>>> If all X are Y then there are no X that are not Y that you continue >>>> to push that even though all X are Y that some X are not Y makes it >>>> quite obvious that you are a liar. >>>> >>>>> So instead of an incomplete system, you instead have a system which >>>>> contains 'incorrect' propositions, but where you cannot identify >>>>> which sentences are 'incorrect' and thus have no way of actually >>>>> excluding them. >>>> >>>> In every single case where we would otherwise determine that a >>>> formal system Y is incomplete on this basis: (T ⊬ φ) and (T ⊬ ¬φ) we >>>> instead determine that expression φ is incorrect. >>>> >>>> This utterly eliminates every element of the set of incomplete >>>> formal systems. >>> >>> You are missing the point. Gödel demonstrates that formal systems >>> with a certain amount of expressiveness must be incomplete by >>> providing a method which is guaranteed to generate an undecidable >>> proposition. He does not provide a method for generating or >>> identifying *every* undecidable proposition in a system. Eliminating >>> known undecidable propositions from a system still leaves you with >>> all the *unknown* undecidable propositions in that system. >>> >>> Goldbach's conjecture has been given as an example. >>> >> >> You must not be very smart. You can't seem to tell the difference >> between an undecided proposition and an undecidable proposition. >> >>> We have been unable to prove Goldbach's conjecture, thus we cannot >>> conclude that it is true. >>> >>> We have been unable to disprove Goldbach's conjecture, thus we cannot >>> conclude that it is false. >>> >>> Based on the above, we have no basis for concluding that Goldbach's >>> conjecture is actually decidable. >>> >>> However, we have no proof that Goldbach's conjecture is undecidable, >>> either. >>> >>> Do you exclude it or not? If you exclude it, you may be excluding a >>> true yet as-of-yet unproven statement. If you don't exclude it, you >>> may be including an undecidable (though as of yet not proven to be >>> undecidable) proposition. >>> >> >> You must not be very smart. You can't seem to tell the difference >> between an undecided proposition and an undecidable proposition. > > The point is that we do not *know* whether it is an undecidable > proposition or merely an undecided proposition. It *might* be > undecidable. And there is no general method which will allow us to > determine whether it is or is not decidable. So you have to decide > whether to exclude it without actually knowing whether it is a decidable > proposition or an undecidable proposition. > > André > Yes and we all know that this: "⊬" is the might not be provable symbol, therefore this is the definition of "might be" incompleteness: A theory T [might be] incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-16 21:03 +0100 |
| Message-ID | <87imbakkg7.fsf@bsb.me.uk> |
| In reply to | #23894 |
olcott <NoOne@NoWhere.com> writes: > ... we all know that this: "⊬" is the might not be provable symbol No it isn't. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 15:20 -0500 |
| Message-ID | <lMydnfwdTIHknRfCnZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #23900 |
On 10/16/2020 3:03 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> ... we all know that this: "⊬" is the might not be provable symbol > > No it isn't. > So then the following set includes zero "*might* be undecidable" propositions, thus proving that Andre's position is baseless: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). On 10/16/2020 11:50 AM, André G. Isaak wrote: > The point is that we do not *know* whether it is an undecidable > proposition or merely an undecided proposition. It *might* be > undecidable. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 15:25 -0500 |
| Message-ID | <zLWdnYzkQqpXnBfCnZ2dnUU7-c3NnZ2d@giganews.com> |
| In reply to | #23901 |
On 10/16/2020 3:20 PM, olcott wrote: > On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> ... we all know that this: "⊬" is the might not be provable symbol >> >> No it isn't. >> > > So then the following set includes zero "*might* be undecidable" > propositions, thus proving that Andre's position is baseless: > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > On 10/16/2020 11:50 AM, André G. Isaak wrote: > > The point is that we do not *know* whether it is an undecidable > > proposition or merely an undecided proposition. It *might* be > > undecidable. Since Andre would know that this: "⊬" is not the "might not be provable" symbol his position is a lie and not merely an honest mistake. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-16 22:15 +0100 |
| Message-ID | <877drplvnl.fsf@bsb.me.uk> |
| In reply to | #23902 |
olcott <NoOne@NoWhere.com> writes: > On 10/16/2020 3:20 PM, olcott wrote: >> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> ... we all know that this: "⊬" is the might not be provable symbol >>> >>> No it isn't. >>> >> >> So then the following set includes zero "*might* be undecidable" >> propositions, thus proving that Andre's position is baseless: >> >> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >> >> On 10/16/2020 11:50 AM, André G. Isaak wrote: >> > The point is that we do not *know* whether it is an undecidable >> > proposition or merely an undecided proposition. It *might* be >> > undecidable. > > Since Andre would know that this: "⊬" is not the "might not be > provable" symbol his position is a lie and not merely an honest > mistake. Hmm... and this makes me think that Jeff Barnett may be right -- that you do indeed know you are wrong. There's no mistake and certainly no lies. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 16:32 -0500 |
| Message-ID | <Pa6dnbwMZ6jOjBfCnZ2dnUU7-L_NnZ2d@giganews.com> |
| In reply to | #23904 |
On 10/16/2020 4:15 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/16/2020 3:20 PM, olcott wrote: >>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>> >>>> No it isn't. >>>> >>> >>> So then the following set includes zero "*might* be undecidable" >>> propositions, thus proving that Andre's position is baseless: >>> >>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>> > The point is that we do not *know* whether it is an undecidable >>> > proposition or merely an undecided proposition. It *might* be >>> > undecidable. >> >> Since Andre would know that this: "⊬" is not the "might not be >> provable" symbol his position is a lie and not merely an honest >> mistake. > > Hmm... and this makes me think that Jeff Barnett may be right -- that > you do indeed know you are wrong. There's no mistake and certainly no > lies. > It might not seem that way when you start in the middle and do not read the full dialogue. Andre has been consistently claiming that the φ in this set may include some expressions of language that are not known to be undecidable in T: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 16:56 -0500 |
| Message-ID | <48adnUAvuI6GihfCnZ2dnUU7-fmdnZ2d@giganews.com> |
| In reply to | #23904 |
On 10/16/2020 4:15 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/16/2020 3:20 PM, olcott wrote: >>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>> >>>> No it isn't. >>>> >>> >>> So then the following set includes zero "*might* be undecidable" >>> propositions, thus proving that Andre's position is baseless: >>> >>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>> > The point is that we do not *know* whether it is an undecidable >>> > proposition or merely an undecided proposition. It *might* be >>> > undecidable. >> >> Since Andre would know that this: "⊬" is not the "might not be >> provable" symbol his position is a lie and not merely an honest >> mistake. > > Hmm... and this makes me think that Jeff Barnett may be right -- that > you do indeed know you are wrong. There's no mistake and certainly no > lies. > Andre has been consistently claiming that in some cases the the φ in this expression may not be known to be undecidable in T: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-17 00:33 +0100 |
| Message-ID | <871rhxlp95.fsf@bsb.me.uk> |
| In reply to | #23907 |
olcott <NoOne@NoWhere.com> writes: > On 10/16/2020 4:15 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/16/2020 3:20 PM, olcott wrote: >>>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>>> >>>>> No it isn't. >>>>> >>>> >>>> So then the following set includes zero "*might* be undecidable" >>>> propositions, thus proving that Andre's position is baseless: >>>> >>>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>> >>>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>>> > The point is that we do not *know* whether it is an undecidable >>>> > proposition or merely an undecided proposition. It *might* be >>>> > undecidable. >>> >>> Since Andre would know that this: "⊬" is not the "might not be >>> provable" symbol his position is a lie and not merely an honest >>> mistake. >> >> Hmm... and this makes me think that Jeff Barnett may be right -- that >> you do indeed know you are wrong. There's no mistake and certainly no >> lies. > > Andre has been consistently claiming that in some cases the the φ in > this expression may not be known to be undecidable in T: > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). He has been consistently (and correctly) claiming that there is no way to know, /in general/, if any given sentence φ is such that T ⊬ φ and T ⊬ ¬φ. Anything else you think he's been saying is in your head. Meanwhile, you have been consistently (and evasively) pretending that this doesn't matter. You have not been bold enough to claim that there is such an algorithm (unless your muddled reference to Curry-Howard was meant to imply that there is when in fact it doesn't), but neither have you been so bold as to agreed that there isn't one. You just keep avoiding the question: how do you decide if a formula is acceptable to you or not? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 18:54 -0500 |
| Message-ID | <68udneB7APherxfCnZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #23908 |
On 10/16/2020 6:33 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/16/2020 4:15 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/16/2020 3:20 PM, olcott wrote: >>>>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>>>> >>>>>> No it isn't. >>>>>> >>>>> >>>>> So then the following set includes zero "*might* be undecidable" >>>>> propositions, thus proving that Andre's position is baseless: >>>>> >>>>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>> >>>>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>>>> > The point is that we do not *know* whether it is an undecidable >>>>> > proposition or merely an undecided proposition. It *might* be >>>>> > undecidable. >>>> >>>> Since Andre would know that this: "⊬" is not the "might not be >>>> provable" symbol his position is a lie and not merely an honest >>>> mistake. >>> >>> Hmm... and this makes me think that Jeff Barnett may be right -- that >>> you do indeed know you are wrong. There's no mistake and certainly no >>> lies. >> >> Andre has been consistently claiming that in some cases the the φ in >> this expression may not be known to be undecidable in T: >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). > > He has been consistently (and correctly) claiming that there is no way > to know, /in general/, if any given sentence φ is such that T ⊬ φ and T > ⊬ ¬φ. Anything else you think he's been saying is in your head. > Sure that is correct AND a dishonest dodge. > Meanwhile, you have been consistently (and evasively) pretending that > this doesn't matter. If an expression of language: φ is stipulated to be undecidable in theory T: (T ⊬ φ) and (T ⊬ ¬φ), then we can know with complete certainty that φ is indeed undecidable in theory T. > You have not been bold enough to claim that there > is such an algorithm (unless your muddled reference to Curry-Howard was > meant to imply that there is when in fact it doesn't), but neither have > you been so bold as to agreed that there isn't one. > > You just keep avoiding the question: how do you decide if a formula is > acceptable to you or not? > ∀T ∈ Formal_System ∀φ ∈ expression_of_language(T) (Incorrect(φ) ↔ (T ⊬ φ) ∧ (T ⊬ ¬φ)) -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-17 01:33 +0100 |
| Message-ID | <87v9f9k7wp.fsf@bsb.me.uk> |
| In reply to | #23909 |
olcott <NoOne@NoWhere.com> writes: > On 10/16/2020 6:33 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/16/2020 4:15 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/16/2020 3:20 PM, olcott wrote: >>>>>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>>>>> >>>>>>> No it isn't. >>>>>>> >>>>>> >>>>>> So then the following set includes zero "*might* be undecidable" >>>>>> propositions, thus proving that Andre's position is baseless: >>>>>> >>>>>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>> >>>>>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>>>>> > The point is that we do not *know* whether it is an undecidable >>>>>> > proposition or merely an undecided proposition. It *might* be >>>>>> > undecidable. >>>>> >>>>> Since Andre would know that this: "⊬" is not the "might not be >>>>> provable" symbol his position is a lie and not merely an honest >>>>> mistake. >>>> >>>> Hmm... and this makes me think that Jeff Barnett may be right -- that >>>> you do indeed know you are wrong. There's no mistake and certainly no >>>> lies. >>> >>> Andre has been consistently claiming that in some cases the the φ in >>> this expression may not be known to be undecidable in T: >>> >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> He has been consistently (and correctly) claiming that there is no way >> to know, /in general/, if any given sentence φ is such that T ⊬ φ and T >> ⊬ ¬φ. Anything else you think he's been saying is in your head. > > Sure that is correct AND a dishonest dodge. You agree that that is what is being said? Good. >> Meanwhile, you have been consistently (and evasively) pretending that >> this doesn't matter. > > If an expression of language: φ is stipulated to be undecidable in > theory T: (T ⊬ φ) and (T ⊬ ¬φ), > > then we can know with complete certainty that φ is indeed undecidable > in theory T. Nonsense. What matters is whether T ⊬ φ and T ⊬ ¬φ is, in fact, the case for some particular formula φ, not that it is stipulated to be the case. Stipulations don't alter facts. Your problem (unacknowledged though it is) is that there is no effective method for deciding, in general, if T ⊬ φ and T ⊬ ¬φ is, indeed, the case for some φ. Specific examples are know, but there is no general method. You duck this question by simply re-stating the criterion, and ignoring the fact that there is no way to determine, in general, if a formula meets it. >> You have not been bold enough to claim that there >> is such an algorithm (unless your muddled reference to Curry-Howard was >> meant to imply that there is when in fact it doesn't), but neither have >> you been so bold as to agreed that there isn't one. Evasion noted! You won't say, will you? >> You just keep avoiding the question: how do you decide if a formula is >> acceptable to you or not? > > ∀T ∈ Formal_System ∀φ ∈ expression_of_language(T) > (Incorrect(φ) ↔ (T ⊬ φ) ∧ (T ⊬ ¬φ)) Stating the criterion, again and again, does not answer the question. Either you simply don't know what is being asked of you (and you are, as always, too proud to ask), or you do know and you hope that by endlessly repeating this math poem you can appear to be addressing it. Nether is a good look. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-16 19:53 -0500 |
| Message-ID | <QuqdnVDE66AK3RfCnZ2dnUU7-anNnZ2d@giganews.com> |
| In reply to | #23911 |
On 10/16/2020 7:33 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/16/2020 6:33 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/16/2020 4:15 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/16/2020 3:20 PM, olcott wrote: >>>>>>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>>>>>> >>>>>>>> No it isn't. >>>>>>>> >>>>>>> >>>>>>> So then the following set includes zero "*might* be undecidable" >>>>>>> propositions, thus proving that Andre's position is baseless: >>>>>>> >>>>>>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>> >>>>>>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>>>>>> > The point is that we do not *know* whether it is an undecidable >>>>>>> > proposition or merely an undecided proposition. It *might* be >>>>>>> > undecidable. >>>>>> >>>>>> Since Andre would know that this: "⊬" is not the "might not be >>>>>> provable" symbol his position is a lie and not merely an honest >>>>>> mistake. >>>>> >>>>> Hmm... and this makes me think that Jeff Barnett may be right -- that >>>>> you do indeed know you are wrong. There's no mistake and certainly no >>>>> lies. >>>> >>>> Andre has been consistently claiming that in some cases the the φ in >>>> this expression may not be known to be undecidable in T: >>>> >>>> A theory T is incomplete if and only if there is some sentence φ such >>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> He has been consistently (and correctly) claiming that there is no way >>> to know, /in general/, if any given sentence φ is such that T ⊬ φ and T >>> ⊬ ¬φ. Anything else you think he's been saying is in your head. >> >> Sure that is correct AND a dishonest dodge. > > You agree that that is what is being said? Good. > >>> Meanwhile, you have been consistently (and evasively) pretending that >>> this doesn't matter. >> >> If an expression of language: φ is stipulated to be undecidable in >> theory T: (T ⊬ φ) and (T ⊬ ¬φ), >> >> then we can know with complete certainty that φ is indeed undecidable >> in theory T. > > Nonsense. What matters is whether T ⊬ φ and T ⊬ ¬φ is, in fact, the > case for some particular formula φ, not that it is stipulated to be the > case. Stipulations don't alter facts. > > Your problem (unacknowledged though it is) is that there is no effective > method for deciding, in general, if T ⊬ φ and T ⊬ ¬φ is, indeed, the > case for some φ. Specific examples are know, but there is no general > method. You duck this question by simply re-stating the criterion, and > ignoring the fact that there is no way to determine, in general, if a > formula meets it. > Incompleteness is only determined when an undecidable expression of language has been proven to exist: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). All of the expressions of language that have not been proven to be undecidable do not pertain to the determination of incompleteness at all. You know this Andre knows this why choose to be liars? >>> You have not been bold enough to claim that there >>> is such an algorithm (unless your muddled reference to Curry-Howard was >>> meant to imply that there is when in fact it doesn't), but neither have >>> you been so bold as to agreed that there isn't one. > > Evasion noted! You won't say, will you? > It is a side issue not relevant to the specific point at hand. >>> You just keep avoiding the question: how do you decide if a formula is >>> acceptable to you or not? >> You have such sloppy wording. We have never been talking about my mere opinion of acceptable formulas. We have always been talking about the object criteria that decides that a formula is incorrect. THIS IS THE DEFINITION OF AN UNDECIDABLE / INCORRECT FORMULA >> ∀T ∈ Formal_System ∀φ ∈ expression_of_language(T) >> (Incorrect(φ) ↔ (T ⊬ φ) ∧ (T ⊬ ¬φ)) > Stating the criterion, again and again, does not answer the question. Sure it is you are just acting as if you are too stupid to know this. > Either you simply don't know what is being asked of you (and you are, as > always, too proud to ask), or you do know and you hope that by endlessly > repeating this math poem you can appear to be addressing it. Nether is > a good look. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-17 13:32 +0100 |
| Message-ID | <87eelxjamx.fsf@bsb.me.uk> |
| In reply to | #23912 |
olcott <NoOne@NoWhere.com> writes: > On 10/16/2020 7:33 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 10/16/2020 6:33 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 10/16/2020 4:15 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 10/16/2020 3:20 PM, olcott wrote: >>>>>>>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>>>>>>> >>>>>>>>> No it isn't. >>>>>>>>> >>>>>>>> >>>>>>>> So then the following set includes zero "*might* be undecidable" >>>>>>>> propositions, thus proving that Andre's position is baseless: >>>>>>>> >>>>>>>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>>> >>>>>>>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>>>>>>> > The point is that we do not *know* whether it is an undecidable >>>>>>>> > proposition or merely an undecided proposition. It *might* be >>>>>>>> > undecidable. >>>>>>> >>>>>>> Since Andre would know that this: "⊬" is not the "might not be >>>>>>> provable" symbol his position is a lie and not merely an honest >>>>>>> mistake. >>>>>> >>>>>> Hmm... and this makes me think that Jeff Barnett may be right -- that >>>>>> you do indeed know you are wrong. There's no mistake and certainly no >>>>>> lies. >>>>> >>>>> Andre has been consistently claiming that in some cases the the φ in >>>>> this expression may not be known to be undecidable in T: >>>>> >>>>> A theory T is incomplete if and only if there is some sentence φ such >>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>> >>>> He has been consistently (and correctly) claiming that there is no way >>>> to know, /in general/, if any given sentence φ is such that T ⊬ φ and T >>>> ⊬ ¬φ. Anything else you think he's been saying is in your head. >>> >>> Sure that is correct AND a dishonest dodge. >> >> You agree that that is what is being said? Good. >> >>>> Meanwhile, you have been consistently (and evasively) pretending that >>>> this doesn't matter. >>> >>> If an expression of language: φ is stipulated to be undecidable in >>> theory T: (T ⊬ φ) and (T ⊬ ¬φ), >>> >>> then we can know with complete certainty that φ is indeed undecidable >>> in theory T. >> >> Nonsense. What matters is whether T ⊬ φ and T ⊬ ¬φ is, in fact, the >> case for some particular formula φ, not that it is stipulated to be the >> case. Stipulations don't alter facts. >> >> Your problem (unacknowledged though it is) is that there is no effective >> method for deciding, in general, if T ⊬ φ and T ⊬ ¬φ is, indeed, the >> case for some φ. Specific examples are know, but there is no general >> method. You duck this question by simply re-stating the criterion, and >> ignoring the fact that there is no way to determine, in general, if a >> formula meets it. > > Incompleteness is only determined when an undecidable expression of > language has been proven to exist: > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). This is a fact not in dispute. > All of the expressions of language that have not been proven to be > undecidable do not pertain to the determination of incompleteness at > all. They pertain to incompleteness when we know they exist, and we often do. We know there are infinitely many in PA, for example. You don't know all of them. Your position is patently absurd. Presumably you, as the Grand High Keeper of Completeness maintain an ever-growing list of the formulas that are excluded for each and every theory (many of perfectly trivial like x+y=y+x in Q). Your acolytes must swear never to talk about the infinite number of as yet unlisted undecidable formulas of arithmetic, despite knowing that they exist. Your followers must enter into a Newspeak world where your version of PA to called "complete" despite it having already had many formulas of arithmetic excluded from it, and with an infinite number of as yet un-banned formulas lurking in plain sight. > You know this Andre knows this why choose to be liars? You should know by now that when you find yourself thinking that someone as patently honest as André is lying you have almost certainly misunderstood what he is saying. For myself I no longer care. You've accused me of lying, being mad and playing head games so many times it's like water off a duck's back. But remember, you always found out I was not lying if you eventually deigned to understand the issue. And the last time you though I must be mad, it turned our you didn't know what a function was. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-17 09:36 -0500 |
| Message-ID | <RdKdnULM6-sfnBbCnZ2dnUU7-eHNnZ2d@giganews.com> |
| In reply to | #23916 |
On 10/17/2020 7:32 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 10/16/2020 7:33 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 10/16/2020 6:33 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 10/16/2020 4:15 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 10/16/2020 3:20 PM, olcott wrote: >>>>>>>>> On 10/16/2020 3:03 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> ... we all know that this: "⊬" is the might not be provable symbol >>>>>>>>>> >>>>>>>>>> No it isn't. >>>>>>>>>> >>>>>>>>> >>>>>>>>> So then the following set includes zero "*might* be undecidable" >>>>>>>>> propositions, thus proving that Andre's position is baseless: >>>>>>>>> >>>>>>>>> A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>>>> >>>>>>>>> On 10/16/2020 11:50 AM, André G. Isaak wrote: >>>>>>>>> > The point is that we do not *know* whether it is an undecidable >>>>>>>>> > proposition or merely an undecided proposition. It *might* be >>>>>>>>> > undecidable. >>>>>>>> >>>>>>>> Since Andre would know that this: "⊬" is not the "might not be >>>>>>>> provable" symbol his position is a lie and not merely an honest >>>>>>>> mistake. >>>>>>> >>>>>>> Hmm... and this makes me think that Jeff Barnett may be right -- that >>>>>>> you do indeed know you are wrong. There's no mistake and certainly no >>>>>>> lies. >>>>>> >>>>>> Andre has been consistently claiming that in some cases the the φ in >>>>>> this expression may not be known to be undecidable in T: >>>>>> >>>>>> A theory T is incomplete if and only if there is some sentence φ such >>>>>> that (T ⊬ φ) and (T ⊬ ¬φ). >>>>> >>>>> He has been consistently (and correctly) claiming that there is no way >>>>> to know, /in general/, if any given sentence φ is such that T ⊬ φ and T >>>>> ⊬ ¬φ. Anything else you think he's been saying is in your head. >>>> >>>> Sure that is correct AND a dishonest dodge. >>> >>> You agree that that is what is being said? Good. >>> >>>>> Meanwhile, you have been consistently (and evasively) pretending that >>>>> this doesn't matter. >>>> >>>> If an expression of language: φ is stipulated to be undecidable in >>>> theory T: (T ⊬ φ) and (T ⊬ ¬φ), >>>> >>>> then we can know with complete certainty that φ is indeed undecidable >>>> in theory T. >>> >>> Nonsense. What matters is whether T ⊬ φ and T ⊬ ¬φ is, in fact, the >>> case for some particular formula φ, not that it is stipulated to be the >>> case. Stipulations don't alter facts. >>> >>> Your problem (unacknowledged though it is) is that there is no effective >>> method for deciding, in general, if T ⊬ φ and T ⊬ ¬φ is, indeed, the >>> case for some φ. Specific examples are know, but there is no general >>> method. You duck this question by simply re-stating the criterion, and >>> ignoring the fact that there is no way to determine, in general, if a >>> formula meets it. >> >> Incompleteness is only determined when an undecidable expression of >> language has been proven to exist: >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). > > This is a fact not in dispute. > >> All of the expressions of language that have not been proven to be >> undecidable do not pertain to the determination of incompleteness at >> all. > > They pertain to incompleteness when we know they exist, 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. > and we often do. > We know there are infinitely many in PA, for example. You don't know > all of them. > > Your position is patently absurd. Presumably you, as the Grand High > Keeper of Completeness maintain an ever-growing list of the formulas > that are excluded for each and every theory (many of perfectly trivial > like x+y=y+x in Q). Your acolytes must swear never to talk about the > infinite number of as yet unlisted undecidable formulas of arithmetic, > despite knowing that they exist. > > Your followers must enter into a Newspeak world where your version of PA > to called "complete" despite it having already had many formulas of > arithmetic excluded from it, and with an infinite number of as yet > un-banned formulas lurking in plain sight. > >> You know this Andre knows this why choose to be liars? > > You should know by now that when you find yourself thinking that someone > as patently honest as André is lying you have almost certainly > misunderstood what he is saying. For myself I no longer care. You've > accused me of lying, being mad and playing head games so many times it's > like water off a duck's back. But remember, you always found out I was > not lying if you eventually deigned to understand the issue. And the > last time you though I must be mad, it turned our you didn't know what a > function was. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-18 02:25 +0100 |
| Message-ID | <878sc4jpem.fsf@bsb.me.uk> |
| In reply to | #23920 |
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). 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. And since there is no effective procedure to determine if Incorrect(φ), you are not even offering anything of practical value. Apart from a few particular cases, you will never know if Incorrect(φ) is true for any given sentence. So even though they give you the heebee jeebees, you still have to live with them because you have no way to pick them out. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-17 21:23 -0500 |
| Message-ID | <q-6dneiFauOaOhbCnZ2dnUU7-TnNnZ2d@giganews.com> |
| In reply to | #23933 |
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. > So even though they give you the heebee jeebees, you > still have to live with them because you have no way to pick them out. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2020-10-17 21:31 -0600 |
| Message-ID | <rmgctv$589$1@dont-email.me> |
| In reply to | #23934 |
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, 2) blatantly ignorant of almost every relevant result and how it was developed, 3) ambitious but stupid, or 4) some weird combination of 1 thru 3. Can we therefore remove him from the world? The curious are very interested in that question. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-17 22:53 -0500 |
| Message-ID | <aLmdnccI5e-2IRbCnZ2dnUU7-LvNnZ2d@giganews.com> |
| In reply to | #23935 |
On 10/17/2020 10:31 PM, 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, 2) blatantly ignorant of almost every relevant result and > how it was developed, 3) ambitious but stupid, or 4) some weird > combination of 1 thru 3. > Can we therefore remove him from the world? Malevolent threats are a criminal act that can be prosecuted. > The curious are very interested in that question. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 14:58 -0500 |
| Message-ID | <vOidnerK0sbjAxHCnZ2dnUU7-XNQAAAA@giganews.com> |
| In reply to | #23936 |
On 10/18/2020 9:36 AM, kint...@gmail.com wrote: > >>> Can we therefore remove him from the world? >>> The curious are very interested in that question. > > You pretend olcott is the problem and try to whip up the fervor of the gang against Him but! YOU are the one issuing death threats around here so how about YOU fukc off instead ? > > ~~kintalken . > Thanks for your support! -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 10 of 21 — ← Prev page 1 … 8 9 [10] 11 12 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web