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 3 of 21 — ← Prev page 1 2 [3] 4 5 … 21 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 19:55 +0100 |
| Message-ID | <875z7v9jrs.fsf@bsb.me.uk> |
| In reply to | #23675 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 6:40 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2020 8:38 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>> This is just an aside... >>>> >>>>> In computer science >>>>> #define LP !True(LP) >>>>> would specify copying the string !True(!True(!True(...))) an infinite >>>>> number of times. >>>> >>>> Why do you say "would"? It might or it might not depending on the >>>> notation. This looks like a C (or C++) macro, and in C, using LP does >>>> /not/ produce infinite recursion. >>> >>> The C/C++ macro preprocessor recognizes the pathological >>> self-reference and: "The self-reference rule cuts this process short >>> after one step" >>> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html >> >> I am not lacking information about C. I asked about your use of words. >> You said, in essence, that "X would mean Y if it didn't mean what it >> actually means". I just think you could put that more clearly. Maybe >> that it /appears/ to define an infinite expansion, but it isn't. > > LP := ~True(LP) > G := ~Provable(G) > > both specify infinite expansion when the rule is to replace every > instance of the variable on the LHS that occurs within the body on the > RHS with the body of the RHS. Suit yourself. You don't have to explain why you said what you said. But you will no doubt say it again soon: that a C macro "would" do something that it won't. >> This is just waffling unless you can back it up either with examples or, >> better yet, and actual definition of (a) self-reference, and (b) when it >> is "pathological". > > When-so-ever the LHS of a := define operator appears anywhere on the > RHS of this same expression infinite recursion is specified. Is that your definition? You declare all directly recursive definitions in your made-up notation to be pathological? I suppose that's one way to make it look like you've thought about the issue, though it does nothing to support your claims that /other/ systems have pathological self-reference. (And of course it's a silly and inadequate definition even in your own terms.) -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 14:25 -0500 |
| Message-ID | <edCdnXIK4vk5RunCnZ2dnUU7-dPNnZ2d@giganews.com> |
| In reply to | #23679 |
On 9/30/2020 1:55 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 6:40 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/29/2020 8:38 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>> This is just an aside... >>>>> >>>>>> In computer science >>>>>> #define LP !True(LP) >>>>>> would specify copying the string !True(!True(!True(...))) an infinite >>>>>> number of times. >>>>> >>>>> Why do you say "would"? It might or it might not depending on the >>>>> notation. This looks like a C (or C++) macro, and in C, using LP does >>>>> /not/ produce infinite recursion. >>>> >>>> The C/C++ macro preprocessor recognizes the pathological >>>> self-reference and: "The self-reference rule cuts this process short >>>> after one step" >>>> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html >>> >>> I am not lacking information about C. I asked about your use of words. >>> You said, in essence, that "X would mean Y if it didn't mean what it >>> actually means". I just think you could put that more clearly. Maybe >>> that it /appears/ to define an infinite expansion, but it isn't. >> >> LP := ~True(LP) >> G := ~Provable(G) >> >> both specify infinite expansion when the rule is to replace every >> instance of the variable on the LHS that occurs within the body on the >> RHS with the body of the RHS. > > Suit yourself. You don't have to explain why you said what you said. > But you will no doubt say it again soon: that a C macro "would" do > something that it won't. > The macro preprocessor recognizes that the expression specifies infinite expansion and ignores this. >>> This is just waffling unless you can back it up either with examples or, >>> better yet, and actual definition of (a) self-reference, and (b) when it >>> is "pathological". >> >> When-so-ever the LHS of a := define operator appears anywhere on the >> RHS of this same expression infinite recursion is specified. > > Is that your definition? You declare all directly recursive definitions > in your made-up notation to be pathological? Only non-terminating recursive definitions are pathological. > I suppose that's one way > to make it look like you've thought about the issue, though it does > nothing to support your claims that /other/ systems have pathological > self-reference. (And of course it's a silly and inadequate definition > even in your own terms.) > That is one thing to say when you want to keep focused on denigration no matter what the actual truth really is. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 21:01 +0100 |
| Message-ID | <87d0238260.fsf@bsb.me.uk> |
| In reply to | #23683 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 1:55 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: <cut> >>> When-so-ever the LHS of a := define operator appears anywhere on the >>> RHS of this same expression infinite recursion is specified. >> >> Is that your definition? You declare all directly recursive definitions >> in your made-up notation to be pathological? > > Only non-terminating recursive definitions are pathological. So there is no pathological self-reference in Gödel's proof then? I thought you said he had found a way to do that, something that you had declared to be impossible in "symbolic logic". -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 15:12 -0500 |
| Message-ID | <ycGdnW91YKM3e-nCnZ2dnUU7-bednZ2d@giganews.com> |
| In reply to | #23689 |
On 9/30/2020 3:01 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 1:55 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: > <cut> >>>> When-so-ever the LHS of a := define operator appears anywhere on the >>>> RHS of this same expression infinite recursion is specified. >>> >>> Is that your definition? You declare all directly recursive definitions >>> in your made-up notation to be pathological? >> >> Only non-terminating recursive definitions are pathological. > > So there is no pathological self-reference in Gödel's proof then? I > thought you said he had found a way to do that, something that you had > declared to be impossible in "symbolic logic". > You clearly have no interest in understanding what I am saying. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2020-09-30 15:30 -0600 |
| Message-ID | <rl2tdc$m4d$1@dont-email.me> |
| In reply to | #23690 |
On 9/30/2020 2:12 PM, olcott wrote: > On 9/30/2020 3:01 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/30/2020 1:55 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >> <cut> >>>>> When-so-ever the LHS of a := define operator appears anywhere on the >>>>> RHS of this same expression infinite recursion is specified. >>>> >>>> Is that your definition? You declare all directly recursive >>>> definitions >>>> in your made-up notation to be pathological? >>> >>> Only non-terminating recursive definitions are pathological. >> >> So there is no pathological self-reference in Gödel's proof then? I >> thought you said he had found a way to do that, something that you had >> declared to be impossible in "symbolic logic". >> > > You clearly have no interest in understanding what I am saying. Better: You (PO) have no interest in saying what another could understand. If you did, you'd prove yourself completely idiotic as we have seen so often in the past. Now we only suspect but are pretty sure. Slither, evade, and keep on trucking. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-30 08:57 -0600 |
| Message-ID | <rl26cs$mhd$1@dont-email.me> |
| In reply to | #23653 |
On 2020-09-29 19:38, Ben Bacarisse wrote: > The maths/CS distinction you make is an artificial one. I'm not actually convinced that Olcott knows what CS is. There's been many instances where he seems to use it as a synonym for 'computer programming'. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 12:04 -0500 |
| Message-ID | <GPKdnWYNR8kqJ-nCnZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #23673 |
On 9/30/2020 9:57 AM, André G. Isaak wrote: > On 2020-09-29 19:38, Ben Bacarisse wrote: > >> The maths/CS distinction you make is an artificial one. > > I'm not actually convinced that Olcott knows what CS is. There's been > many instances where he seems to use it as a synonym for 'computer > programming'. > > André > Compared to the average PhD mathematician I know hardly any of the whole body of mathematics at all. Compared to the average PhD computer scientist my knowledge of the whole body of computer science is a little better yet still far far less. My whole focus since 2004 is the single issue of how pathological self-reference creates what appears to be undecidable expressions of language. From the perspective of mathematics I simply ignore most of mathematics and only examine the portion of meta-mathematics that most directly applies to pathological self-reference. So I may be an expert on the meta-mathematics of pathological self-reference and mostly clueless about the rest of the body of mathematics. Everyone here has been judging my credibility on the meta-mathematics of pathological self-reference entirely on the basis of my lack of credibility in mathematics. That turns out to be an incorrect basis, firstly because the notion of credibility itself is sometimes a very poor proxy for validity. Some people lacking the proper credentials to show that they should know what they are talking about indeed still do know what they are talking about. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 19:40 +0100 |
| Message-ID | <87blhn9kgb.fsf@bsb.me.uk> |
| In reply to | #23677 |
olcott <NoOne@NoWhere.com> writes: > My whole focus since 2004 is the single issue of how pathological > self-reference creates what appears to be undecidable expressions of > language. ... > Everyone here has been judging my credibility on the meta-mathematics > of pathological self-reference entirely on the basis of my lack of > credibility in mathematics. I can't speak for everyone, but I start my judgement with the fact that you have not been able to define pathological self-reference in over a decade and a half of trying. (By the way, I don't claim that it is not possible to define such a thing very precisely indeed, only that you have repeatedly failed to do so.) You may /think/ you have defined it because you can say "pathological self-reference" using different words in seventeen different ways, but that does not define it in any useful way. Not being able to define the property that has been your "sole focus since 2004" puts a big dent in your credibility, but more importantly, it means that we all know that you don't know, quite literally, what you are talking about when you use that term. Oh, and your lying about having two impossible "actual Turing machines", "fully encoded", when you did not have any such things puts a pretty big dent in it too. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 14:21 -0500 |
| Message-ID | <24OdnbrgP_hcR-nCnZ2dnUU7-Y3NnZ2d@giganews.com> |
| In reply to | #23678 |
On 9/30/2020 1:40 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> My whole focus since 2004 is the single issue of how pathological
>> self-reference creates what appears to be undecidable expressions of
>> language.
> ...
>> Everyone here has been judging my credibility on the meta-mathematics
>> of pathological self-reference entirely on the basis of my lack of
>> credibility in mathematics.
>
> I can't speak for everyone, but I start my judgement with the fact that
> you have not been able to define pathological self-reference in over a
> decade and a half of trying. (By the way, I don't claim that it is not
> possible to define such a thing very precisely indeed, only that you
> have repeatedly failed to do so.)
>
> You may /think/ you have defined it because you can say "pathological
> self-reference" using different words in seventeen different ways, but
> that does not define it in any useful way.
>
> Not being able to define the property that has been your "sole focus
> since 2004" puts a big dent in your credibility, but more importantly,
> it means that we all know that you don't know, quite literally, what you
> are talking about when you use that term.
>
Alternatively I have defined it many times in many ways each one of them
correctly and you simply continue to make the totally unsupported
assertion that I have never defined it at all.
Even the bot named Eliza could be a mere naysayer:
https://en.wikipedia.org/wiki/ELIZA
Pathological self reference is the case where an expression of language
refers to itself and this self-reference prevents the truth value of the
expression from being correctly determined.
Expressions of language that have Pathological self reference are not
truth bearers because their structure make its impossible to resolve
their truth value to either true or false.
"This sentence is true." is not a truth bearer therefore it is neither
true nor false.
"This sentence is not true." is not a truth bearer therefore it is
neither true nor false.
"This sentence is not provable." is not a truth bearer therefore it is
neither true nor false.
All three of those sentences have vacuous truth objects.
int main()
{
bool LP = !(LP == true);
}
Compares a non-existent Boolean value to true, negates the result and
then assigns this result to LP. It is exactly the same process as the
above three sentences. All four examples have a vacuous Boolean value.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 20:50 +0100 |
| Message-ID | <87imbv82nq.fsf@bsb.me.uk> |
| In reply to | #23682 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 1:40 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> My whole focus since 2004 is the single issue of how pathological >>> self-reference creates what appears to be undecidable expressions of >>> language. >> ... >>> Everyone here has been judging my credibility on the meta-mathematics >>> of pathological self-reference entirely on the basis of my lack of >>> credibility in mathematics. >> >> I can't speak for everyone, but I start my judgement with the fact that >> you have not been able to define pathological self-reference in over a >> decade and a half of trying. (By the way, I don't claim that it is not >> possible to define such a thing very precisely indeed, only that you >> have repeatedly failed to do so.) >> >> You may /think/ you have defined it because you can say "pathological >> self-reference" using different words in seventeen different ways, but >> that does not define it in any useful way. >> >> Not being able to define the property that has been your "sole focus >> since 2004" puts a big dent in your credibility, but more importantly, >> it means that we all know that you don't know, quite literally, what you >> are talking about when you use that term. > > Alternatively I have defined it many times in many ways each one of > them correctly and you simply continue to make the totally unsupported > assertion that I have never defined it at all. That is, of course, possible. I will let other readers decide who they believe. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 14:57 -0500 |
| Message-ID | <YZedndqY45fffunCnZ2dnUU7-KFQAAAA@giganews.com> |
| In reply to | #23686 |
On 9/30/2020 2:50 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 1:40 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> My whole focus since 2004 is the single issue of how pathological >>>> self-reference creates what appears to be undecidable expressions of >>>> language. >>> ... >>>> Everyone here has been judging my credibility on the meta-mathematics >>>> of pathological self-reference entirely on the basis of my lack of >>>> credibility in mathematics. >>> >>> I can't speak for everyone, but I start my judgement with the fact that >>> you have not been able to define pathological self-reference in over a >>> decade and a half of trying. (By the way, I don't claim that it is not >>> possible to define such a thing very precisely indeed, only that you >>> have repeatedly failed to do so.) >>> >>> You may /think/ you have defined it because you can say "pathological >>> self-reference" using different words in seventeen different ways, but >>> that does not define it in any useful way. >>> >>> Not being able to define the property that has been your "sole focus >>> since 2004" puts a big dent in your credibility, but more importantly, >>> it means that we all know that you don't know, quite literally, what you >>> are talking about when you use that term. >> >> Alternatively I have defined it many times in many ways each one of >> them correctly and you simply continue to make the totally unsupported >> assertion that I have never defined it at all. > > That is, of course, possible. I will let other readers decide who they > believe. > A very large percentage of the voters in the USA believe that Trump always tells the truth even though he directly contradicts verifiable facts five times a day. Belief is a horribly poor proxy for truth. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2020-09-30 15:42 -0600 |
| Message-ID | <rl2u3i$ppd$1@dont-email.me> |
| In reply to | #23688 |
On 9/30/2020 1:57 PM, olcott wrote: > On 9/30/2020 2:50 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/30/2020 1:40 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> My whole focus since 2004 is the single issue of how pathological >>>>> self-reference creates what appears to be undecidable expressions of >>>>> language. >>>> ... >>>>> Everyone here has been judging my credibility on the meta-mathematics >>>>> of pathological self-reference entirely on the basis of my lack of >>>>> credibility in mathematics. >>>> >>>> I can't speak for everyone, but I start my judgement with the fact that >>>> you have not been able to define pathological self-reference in over a >>>> decade and a half of trying. (By the way, I don't claim that it is not >>>> possible to define such a thing very precisely indeed, only that you >>>> have repeatedly failed to do so.) >>>> >>>> You may /think/ you have defined it because you can say "pathological >>>> self-reference" using different words in seventeen different ways, but >>>> that does not define it in any useful way. >>>> >>>> Not being able to define the property that has been your "sole focus >>>> since 2004" puts a big dent in your credibility, but more importantly, >>>> it means that we all know that you don't know, quite literally, what >>>> you >>>> are talking about when you use that term. >>> >>> Alternatively I have defined it many times in many ways each one of >>> them correctly and you simply continue to make the totally unsupported >>> assertion that I have never defined it at all. >> >> That is, of course, possible. I will let other readers decide who they >> believe. >> > > A very large percentage of the voters in the USA believe that Trump > always tells the truth even though he directly contradicts verifiable > facts five times a day. Belief is a horribly poor proxy for truth. Readers of these forums know you lie at least that much. All you have for your position(s) are beliefs; your not a good enough mathematician to try to (semi)rigorously define and prove them - the lingua franca of mathematics and logic. You are the one operating on belief alone. Why do you always, and I mean always, try to foist your failings and very long shortcomings on your betters? It's a nasty and boring habit. I will quote you, about you: "Belief is a horribly poor proxy for truth." If you want to attack another, do so citing their issues, not your own. The way you do it makes you look like a nasty, bitter moron. You have no insights and no scientific or logical bolsters for your beliefs. So clean up your act before criticizing others for your own inanities. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 21:25 -0600 |
| Message-ID | <rl0trl$9uh$1@dont-email.me> |
| In reply to | #23651 |
On 2020-09-29 18:51, olcott wrote: > On 9/29/2020 5:40 PM, André G. Isaak wrote: >> On 2020-09-29 14:47, olcott wrote: >>> On 9/29/2020 3:06 PM, André G. Isaak wrote: >>>> On 2020-09-29 13:34, olcott wrote: >>>>> On 9/29/2020 1:40 PM, André G. Isaak wrote: >>>>>> On 2020-09-29 10:31, olcott wrote: >>>>>> >>>>>>> I rewrote my grammar to correct the error that you caught, now it >>>>>>> simply rejects the sample expressions that you provided as >>>>>>> ill-formed. >>>>>>> >>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>>>> >>>>>> >>>>>> >>>>>> >>>>>> >>>>>> >>>>>> >>>>>> Not quite. You added a new category, "definition", but you still >>>>>> list your := under "sentence" as well. You want to remove it from >>>>>> that. >>>>>> >>>>> >>>>> Clearly you do not understand YACC BNF. >>>>> definition is list OVER sentence not UNDER it. >>>> >>>> IDENTIFIER ASSIGN_ALIAS sentence >>>> >>>> appears in *both* lists. >>>> >>> >>> You are right again. I only changed the fully executable YACC that >>> has semantic actions. I did not change the one in my paper. It is >>> fixed now. >> >> Right, so when I pointed this out it might have been better for you to >> have double-checked the paper rather than immediately claiming that I >> didn't understand YACC. >> > > In retrospect it would have been much better. > >>>>> The outermost part of a logical expression is either a definition >>>>> or it has no definition at all. >>>>> >>>>>> You now need to define what a 'definition' is in the semantics. By >>>>> >>>>> Unless it detects pathological self-reference it is only macro >>>>> substitution has zero semantics what-so-ever. >>>>> >>>>>> placing it in a separate category you are clearly affirming that >>>>>> it isn't something like a sentence, i.e. a boolean expression. So >>>>>> what exactly is it? >>>>>> >>>>> >>>>> It is a way for people to see that when pathological self-reference >>>>> is specified that an infinite expression cannot be evaluated. If we >>>>> use mathematical conventions we might consider pathological >>>>> self-reference as the same sort of thing as dividing by zero. >>>> >>>> Except that you are trying to claim that X := ¬X is a translation of >>>> 'this sentence is false'. >>>> >>> >>> It is as close as I can get in mathematics. To get closer than this >>> it seems that we have to move to computer science. >>> >>>> It isn't. It is a translation of 'X is defined as ¬X', which is not >>>> the same thing. >>> >>> >>> http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf >>> >>> >>> The fact that even as macro expansion it specifies an infinite term >>> that cannot be evaluated is as close as I can get to saying this in >>> math. >>> >>>> >>>> 'This sentence is false' is an assertion, not a definition. As such, it >>> >>> Yet symbolic has no way to precisely specify actual self-reference so >>> I had to make one up. >> >> Except your made up way doesn't actually capture this. > > Sure it does. > In computer science > #define LP !True(LP) > would specify copying the string !True(!True(!True(...))) an infinite > number of times. Which isn't self-reference. As I've pointed out, if a notation cannot capture the general statement "This sentence has property P", then that notation doesn't capture self-reference. Until your notation provides a way for expressing 'this sentence is written in German' in which it comes out as false rather than as infinitely recursive, then your notation doesn't capture self-reference. > In Math > LP := ~True(LP) > we are only dealing with concepts not finite strings making the > expression infitely recursive. > >> >>>> would need to be categorized as a sentence rather than a definition >>>> in your grammar. But your grammar lacks any way of translating "this >>>> sentence". Definitions or "macro expansion" don't capture this. >>>> >>> >>> They capture it closer than anything else that I can think of. >>> LP := ~AnyPedicateAtALL(LP) // specifies an infinite term >>> >>> All the other ideas that everyone else has is: "lets simply ignore >>> pathogical self-reference because there is no way to say it using >>> symbolic logic." >> >> There is, of course, another, far more sensible alternative. Since the >> liar's paradox is something that arises in natural language but not in >> logic, > > The ONLY reason why it does no arise in logic is because nobody ever > bothered to translate it to logic. The Liar Paradox is merely a > proposition that makes an assertion about its own truth value. It need > not know anything about the world. The reason it doesn't arise in logic is that the goal of logic is to create systems which are *consistent*. Deliberately trying to find some way to allow inconsistent propositions is an absurd goal. And logic doesn't know anything about the world, nor should it need to. André > It was obvious to you that the truth teller paradox is vacuous. > "This sentence is true." True about what? > True about being true. True about being true about what? > > The Liar Paradox also lack a truth object, it is vacuous. > Because it is vacuous it meets this definition: > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > Vacuous sentences can neither be proved nor disproved because they are > vacuous. > >> discuss it in natural language rather than in the language of logic. >> >> André >> > > -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 22:41 -0500 |
| Message-ID | <_t6dnRGSX9LKY-7CnZ2dnUU7-XWdnZ2d@giganews.com> |
| In reply to | #23657 |
On 9/29/2020 10:25 PM, André G. Isaak wrote: > On 2020-09-29 18:51, olcott wrote: >> On 9/29/2020 5:40 PM, André G. Isaak wrote: >>> On 2020-09-29 14:47, olcott wrote: >>>> On 9/29/2020 3:06 PM, André G. Isaak wrote: >>>>> On 2020-09-29 13:34, olcott wrote: >>>>>> On 9/29/2020 1:40 PM, André G. Isaak wrote: >>>>>>> On 2020-09-29 10:31, olcott wrote: >>>>>>> >>>>>>>> I rewrote my grammar to correct the error that you caught, now >>>>>>>> it simply rejects the sample expressions that you provided as >>>>>>>> ill-formed. >>>>>>>> >>>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>>>>> >>>>>>> >>>>>>> >>>>>>> >>>>>>> >>>>>>> >>>>>>> >>>>>>> >>>>>>> Not quite. You added a new category, "definition", but you still >>>>>>> list your := under "sentence" as well. You want to remove it from >>>>>>> that. >>>>>>> >>>>>> >>>>>> Clearly you do not understand YACC BNF. >>>>>> definition is list OVER sentence not UNDER it. >>>>> >>>>> IDENTIFIER ASSIGN_ALIAS sentence >>>>> >>>>> appears in *both* lists. >>>>> >>>> >>>> You are right again. I only changed the fully executable YACC that >>>> has semantic actions. I did not change the one in my paper. It is >>>> fixed now. >>> >>> Right, so when I pointed this out it might have been better for you >>> to have double-checked the paper rather than immediately claiming >>> that I didn't understand YACC. >>> >> >> In retrospect it would have been much better. >> >>>>>> The outermost part of a logical expression is either a definition >>>>>> or it has no definition at all. >>>>>> >>>>>>> You now need to define what a 'definition' is in the semantics. By >>>>>> >>>>>> Unless it detects pathological self-reference it is only macro >>>>>> substitution has zero semantics what-so-ever. >>>>>> >>>>>>> placing it in a separate category you are clearly affirming that >>>>>>> it isn't something like a sentence, i.e. a boolean expression. So >>>>>>> what exactly is it? >>>>>>> >>>>>> >>>>>> It is a way for people to see that when pathological >>>>>> self-reference is specified that an infinite expression cannot be >>>>>> evaluated. If we use mathematical conventions we might consider >>>>>> pathological self-reference as the same sort of thing as dividing >>>>>> by zero. >>>>> >>>>> Except that you are trying to claim that X := ¬X is a translation >>>>> of 'this sentence is false'. >>>>> >>>> >>>> It is as close as I can get in mathematics. To get closer than this >>>> it seems that we have to move to computer science. >>>> >>>>> It isn't. It is a translation of 'X is defined as ¬X', which is not >>>>> the same thing. >>>> >>>> >>>> http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf >>>> >>>> >>>> The fact that even as macro expansion it specifies an infinite term >>>> that cannot be evaluated is as close as I can get to saying this in >>>> math. >>>> >>>>> >>>>> 'This sentence is false' is an assertion, not a definition. As >>>>> such, it >>>> >>>> Yet symbolic has no way to precisely specify actual self-reference >>>> so I had to make one up. >>> >>> Except your made up way doesn't actually capture this. >> >> Sure it does. >> In computer science >> #define LP !True(LP) >> would specify copying the string !True(!True(!True(...))) an infinite >> number of times. > > Which isn't self-reference. As I've pointed out, You continue with the same mere unsupported assertion. I explained several different ways to formalize pathological self reference and it all boils down that you simply disbelieve them. > if a notation cannot > capture the general statement "This sentence has property P", then that > notation doesn't capture self-reference. > The notion of (pathological) self reference in the case is that the expression refers to a vacuous property that it does not have. > Until your notation provides a way for expressing 'this sentence is > written in German' in which it comes out as false rather than as > infinitely recursive, then your notation doesn't capture self-reference. That sentence is NOT referring to itself, it is refering to its natural language encoding. "This sentence is true." is a proposition that refers to its own truth value. >> In Math >> LP := ~True(LP) >> we are only dealing with concepts not finite strings making the >> expression infitely recursive. >> >>> >>>>> would need to be categorized as a sentence rather than a definition >>>>> in your grammar. But your grammar lacks any way of translating >>>>> "this sentence". Definitions or "macro expansion" don't capture this. >>>>> >>>> >>>> They capture it closer than anything else that I can think of. >>>> LP := ~AnyPedicateAtALL(LP) // specifies an infinite term >>>> >>>> All the other ideas that everyone else has is: "lets simply ignore >>>> pathogical self-reference because there is no way to say it using >>>> symbolic logic." >>> >>> There is, of course, another, far more sensible alternative. Since >>> the liar's paradox is something that arises in natural language but >>> not in logic, >> >> The ONLY reason why it does no arise in logic is because nobody ever >> bothered to translate it to logic. The Liar Paradox is merely a >> proposition that makes an assertion about its own truth value. It need >> not know anything about the world. > > The reason it doesn't arise in logic is that the goal of logic is to > create systems which are *consistent*. Deliberately trying to find some > way to allow inconsistent propositions is an absurd goal. Deliberately showing that the standard definition of incompleteness is simply wrong-headed: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). Because it reject whole formal system on the basis of ill-formed expessions. > > And logic doesn't know anything about the world, nor should it need to. The point is that we do not need to formalize natural language to formalize the liar paradox because the liar paradox only requires the ordinary attributes of propositions. X := ¬(P ∨ Q) ↔ (¬P ∧ ¬Q) In the above case we can simply say that X is true. In the following cases we can say that the truth value is vacuous: LP := ~True(LP) G := ~Provable(G) That you simply do not believe me counts as less than no rebuttal at all. Instead of any sort of rebuttal it is merely an example of the systematic error of bias. > > André > >> It was obvious to you that the truth teller paradox is vacuous. >> "This sentence is true." True about what? >> True about being true. True about being true about what? >> >> The Liar Paradox also lack a truth object, it is vacuous. >> Because it is vacuous it meets this definition: >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> Vacuous sentences can neither be proved nor disproved because they are >> vacuous. >> >>> discuss it in natural language rather than in the language of logic. >>> >>> André >>> >> >> > > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 22:22 -0600 |
| Message-ID | <rl115r$oqm$1@dont-email.me> |
| In reply to | #23660 |
On 2020-09-29 21:41, olcott wrote: > On 9/29/2020 10:25 PM, André G. Isaak wrote: >> On 2020-09-29 18:51, olcott wrote: >>> On 9/29/2020 5:40 PM, André G. Isaak wrote: >>>> On 2020-09-29 14:47, olcott wrote: >>>>> Yet symbolic has no way to precisely specify actual self-reference >>>>> so I had to make one up. >>>> >>>> Except your made up way doesn't actually capture this. >>> >>> Sure it does. >>> In computer science >>> #define LP !True(LP) >>> would specify copying the string !True(!True(!True(...))) an infinite >>> number of times. >> >> Which isn't self-reference. As I've pointed out, > > You continue with the same mere unsupported assertion. It isn't unsupported. I support it directly below. > I explained several different ways to formalize pathological self > reference and it all boils down that you simply disbelieve them. You can't formalize 'pathological' self-reference without first formalizing self-reference. >> if a notation cannot capture the general statement "This sentence has >> property P", then that notation doesn't capture self-reference. >> > > The notion of (pathological) self reference in the case is that the > expression refers to a vacuous property that it does not have. > >> Until your notation provides a way for expressing 'this sentence is >> written in German' in which it comes out as false rather than as >> infinitely recursive, then your notation doesn't capture self-reference. > > That sentence is NOT referring to itself, it is refering to its natural > language encoding. Of course that sentence refers to itself. What the hell do you think "this sentence" is referring to if not itself? > "This sentence is true." > is a proposition that refers to its own truth value. That sentence is self-referential in exactly the same way that "this sentence is in german" is self-referential. The only difference is that the latter results in an undecidable proposition whereas the former does not. >>> In Math >>> LP := ~True(LP) >>> we are only dealing with concepts not finite strings making the >>> expression infitely recursive. >>> >>>> >>>>>> would need to be categorized as a sentence rather than a >>>>>> definition in your grammar. But your grammar lacks any way of >>>>>> translating "this sentence". Definitions or "macro expansion" >>>>>> don't capture this. >>>>>> >>>>> >>>>> They capture it closer than anything else that I can think of. >>>>> LP := ~AnyPedicateAtALL(LP) // specifies an infinite term >>>>> >>>>> All the other ideas that everyone else has is: "lets simply ignore >>>>> pathogical self-reference because there is no way to say it using >>>>> symbolic logic." >>>> >>>> There is, of course, another, far more sensible alternative. Since >>>> the liar's paradox is something that arises in natural language but >>>> not in logic, >>> >>> The ONLY reason why it does no arise in logic is because nobody ever >>> bothered to translate it to logic. The Liar Paradox is merely a >>> proposition that makes an assertion about its own truth value. It >>> need not know anything about the world. >> >> The reason it doesn't arise in logic is that the goal of logic is to >> create systems which are *consistent*. Deliberately trying to find >> some way to allow inconsistent propositions is an absurd goal. > > Deliberately showing that the standard definition of incompleteness is > simply wrong-headed: > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > Because it reject whole formal system on the basis of ill-formed > expessions. Claiming that a formal system is incomplete does *not* involved rejecting that system. It involves claiming that it is incomplete. And no one has argued that systems are incomplete based on 'ill-formed' expressions. >> >> And logic doesn't know anything about the world, nor should it need to. > > The point is that we do not need to formalize natural language to > formalize the liar paradox because the liar paradox only requires the > ordinary attributes of propositions. > > X := ¬(P ∨ Q) ↔ (¬P ∧ ¬Q) > In the above case we can simply say that X is true. Except that isn't a proposition in any standard logic. Your MTT is not a standard logic, and is far too ill-defined to be useful as one. > In the following cases we can say that the truth value is vacuous: > LP := ~True(LP) > G := ~Provable(G) > > That you simply do not believe me counts as less than no rebuttal at > all. Instead of any sort of rebuttal it is merely an example of the > systematic error of bias. No. My point has always been that until you actually define a semantics to go along with your syntax, you don't have a system at all. Saying you are using the 'standard semantics' doesn't cut it. You can't mix concepts from different languages and assume that the results will be internally coherent. >> >> André >> >>> It was obvious to you that the truth teller paradox is vacuous. >>> "This sentence is true." True about what? >>> True about being true. True about being true about what? >>> >>> The Liar Paradox also lack a truth object, it is vacuous. >>> Because it is vacuous it meets this definition: >>> >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). No, the liar's paradox does not meet that definition. For starters, it isn't a statement of logic. And even in natural language, it is not undecidable, it is inconsistent. >>> Vacuous sentences can neither be proved nor disproved because they >>> are vacuous. (A ∨ ¬A) is entirely vacuous until an interpretation is supplied, yet it is perfectly provable. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 00:54 -0500 |
| Message-ID | <Ff6dnbBnBcMfgOnCnZ2dnUU7-bvNnZ2d@giganews.com> |
| In reply to | #23662 |
On 9/29/2020 11:22 PM, André G. Isaak wrote:
> On 2020-09-29 21:41, olcott wrote:
>> On 9/29/2020 10:25 PM, André G. Isaak wrote:
>>> On 2020-09-29 18:51, olcott wrote:
>>>> On 9/29/2020 5:40 PM, André G. Isaak wrote:
>>>>> On 2020-09-29 14:47, olcott wrote:
>
>>>>>> Yet symbolic has no way to precisely specify actual self-reference
>>>>>> so I had to make one up.
>>>>>
>>>>> Except your made up way doesn't actually capture this.
>>>>
>>>> Sure it does.
>>>> In computer science
>>>> #define LP !True(LP)
>>>> would specify copying the string !True(!True(!True(...))) an
>>>> infinite number of times.
>>>
>>> Which isn't self-reference. As I've pointed out,
>>
>> You continue with the same mere unsupported assertion.
>
> It isn't unsupported. I support it directly below.
>
>> I explained several different ways to formalize pathological self
>> reference and it all boils down that you simply disbelieve them.
>
> You can't formalize 'pathological' self-reference without first
> formalizing self-reference.
That seems reasonable except that at the level of logical propositions
there may not be any kind of self-reference that is not pathological.
>>> if a notation cannot capture the general statement "This sentence has
>>> property P", then that notation doesn't capture self-reference.
>>>
>>
>> The notion of (pathological) self reference in the case is that the
>> expression refers to a vacuous property that it does not have.
>>
>>> Until your notation provides a way for expressing 'this sentence is
>>> written in German' in which it comes out as false rather than as
>>> infinitely recursive, then your notation doesn't capture self-reference.
>>
>> That sentence is NOT referring to itself, it is refering to its
>> natural language encoding.
>
> Of course that sentence refers to itself. What the hell do you think
> "this sentence" is referring to if not itself?
I always thought that the sentence:
"This sentence has five words". referred to itself, except that when it
is translated into symbolic logic it ceases to have any words.
>> "This sentence is true."
>> is a proposition that refers to its own truth value.
>
> That sentence is self-referential in exactly the same way that "this
> sentence is in german" is self-referential.
int main()
{
bool LP = !(LP == true);
}
Taken literally means to compare a non-exsitent truth value to true and
then negate the result.
>
> The only difference is that the latter results in an undecidable
> proposition whereas the former does not.
It is not really undecidable at all. It has no truth value at all.
>
>>>> In Math
>>>> LP := ~True(LP)
>>>> we are only dealing with concepts not finite strings making the
>>>> expression infitely recursive.
>>>>
>>>>>
>>>>>>> would need to be categorized as a sentence rather than a
>>>>>>> definition in your grammar. But your grammar lacks any way of
>>>>>>> translating "this sentence". Definitions or "macro expansion"
>>>>>>> don't capture this.
>>>>>>>
>>>>>>
>>>>>> They capture it closer than anything else that I can think of.
>>>>>> LP := ~AnyPedicateAtALL(LP) // specifies an infinite term
>>>>>>
>>>>>> All the other ideas that everyone else has is: "lets simply ignore
>>>>>> pathogical self-reference because there is no way to say it using
>>>>>> symbolic logic."
>>>>>
>>>>> There is, of course, another, far more sensible alternative. Since
>>>>> the liar's paradox is something that arises in natural language but
>>>>> not in logic,
>>>>
>>>> The ONLY reason why it does no arise in logic is because nobody ever
>>>> bothered to translate it to logic. The Liar Paradox is merely a
>>>> proposition that makes an assertion about its own truth value. It
>>>> need not know anything about the world.
>>>
>>> The reason it doesn't arise in logic is that the goal of logic is to
>>> create systems which are *consistent*. Deliberately trying to find
>>> some way to allow inconsistent propositions is an absurd goal.
>>
>> Deliberately showing that the standard definition of incompleteness is
>> simply wrong-headed:
>
>> A theory T is incomplete if and only if there is some sentence φ such
>> that (T ⊬ φ) and (T ⊬ ¬φ).
>>
>> Because it reject whole formal system on the basis of ill-formed
>> expessions.
>
> Claiming that a formal system is incomplete does *not* involved
> rejecting that system. It involves claiming that it is incomplete. And
> no one has argued that systems are incomplete based on 'ill-formed'
> expressions.
>
I am doing that right now. I am not no one.
>>>
>>> And logic doesn't know anything about the world, nor should it need to.
>>
>> The point is that we do not need to formalize natural language to
>> formalize the liar paradox because the liar paradox only requires the
>> ordinary attributes of propositions.
>>
>> X := ¬(P ∨ Q) ↔ (¬P ∧ ¬Q)
>> In the above case we can simply say that X is true.
>
> Except that isn't a proposition in any standard logic. Your MTT is not a
> standard logic, and is far too ill-defined to be useful as one.
So then you say that all new ideas must be wrong because they are new
ideas.
>> In the following cases we can say that the truth value is vacuous:
>> LP := ~True(LP)
>> G := ~Provable(G)
>>
>> That you simply do not believe me counts as less than no rebuttal at
>> all. Instead of any sort of rebuttal it is merely an example of the
>> systematic error of bias.
>
> No. My point has always been that until you actually define a semantics
> to go along with your syntax, you don't have a system at all. Saying you
> are using the 'standard semantics' doesn't cut it. You can't mix
> concepts from different languages and assume that the results will be
> internally coherent.
They work consistently and you can't show otherwise.
>>>
>>> André
>>>
>>>> It was obvious to you that the truth teller paradox is vacuous.
>>>> "This sentence is true." True about what?
>>>> True about being true. True about being true about what?
>>>>
>>>> The Liar Paradox also lack a truth object, it is vacuous.
>>>> Because it is vacuous it meets this definition:
>>>>
>>>> A theory T is incomplete if and only if there is some sentence φ
>>>> such that (T ⊬ φ) and (T ⊬ ¬φ).
>
> No, the liar's paradox does not meet that definition. For starters, it
> isn't a statement of logic. And even in natural language, it is not
> undecidable, it is inconsistent.
Because it cannot be proved or disproved IT DOES MEET THAT DEFINITION.
>>>> Vacuous sentences can neither be proved nor disproved because they
>>>> are vacuous.
>
> (A ∨ ¬A) is entirely vacuous until an interpretation is supplied, yet it
> is perfectly provable.
>
> André
Yeah who knows maybe some people will interpret this: (A ∨ ¬A)
as a demand for an ice cream cone right now!!!
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2020-09-30 09:08 -0400 |
| Message-ID | <jr%cH.105992$nI.76964@fx21.iad> |
| In reply to | #23660 |
On 9/29/20 11:41 PM, olcott wrote: > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > Because it reject whole formal system on the basis of ill-formed > expessions. "Incomplete" doesn't reject whole formal systems, it states that such a consistant system of axioms that can be enumerated by some algorithm, will have some propositions that they can not prove or disprove, or stated another way, some true statements they can not prove just by the axiom of the system (if it is just a false statement that can not be disproven, then you can convert it to its negation and that isn't provable) The statement also fully allows systems that are 'complete', but also points out that such systems are limited in the sense that they can not express all truths about the arithmetic of natural numbers. You having an axiom that Truth is defined by ability to be proven, is an acceptable axiom, but Godel proof just shows that the system you derive from that axiom will be incapable of expressing all the truths about the arithmetic of natural numbers. I suppose you could conclude from this that to properly show all the truths about the arithmetic of natural numbers, we need to be able to employ the recursion that you are rejecting by your axioms.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 10:39 -0500 |
| Message-ID | <M_CdnQjCLektO-nCnZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #23672 |
On 9/30/2020 8:08 AM, Richard Damon wrote: > On 9/29/20 11:41 PM, olcott wrote: >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> Because it reject whole formal system on the basis of ill-formed >> expessions. > > "Incomplete" doesn't reject whole formal systems, it states that such a > consistant system of axioms that can be enumerated by some algorithm, > will have some propositions that they can not prove or disprove, or > stated another way, some true statements they can not prove just by the > axiom of the system (if it is just a false statement that can not be > disproven, then you can convert it to its negation and that isn't provable) The problem is that the inability of a formal system to prove or disprove ill-formed propositions makes this formal system incomplete. > The statement also fully allows systems that are 'complete', but also > points out that such systems are limited in the sense that they can not > express all truths about the arithmetic of natural numbers. When we cut out the purely extraneous complexity of natural numbers See the bottom of the first page: https://www.researchgate.net/publication/342503359_Defining_Godel_Incompleteness_Away And perform this same proof on the basis of its meta-mathematics alone, then we can see that any logical expression that asserts that it is logically equivalent to its own unprovability would fail Prolog's unify_with_occurs_check/2 because it specifies an "infinite term". http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf > > You having an axiom that Truth is defined by ability to be proven, is an > acceptable axiom, but Godel proof just shows that the system you derive > from that axiom will be incapable of expressing all the truths about the > arithmetic of natural numbers. > > I suppose you could conclude from this that to properly show all the > truths about the arithmetic of natural numbers, we need to be able to > employ the recursion that you are rejecting by your axioms. > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2020-09-29 21:04 -0600 |
| Message-ID | <rl0skt$4ie$1@dont-email.me> |
| In reply to | #23644 |
On 9/29/2020 1:34 PM, olcott wrote: > I have a fully operational parser that rejects that expression. > The ONLY thing that can be in the left-hand-side (LHS) of a > ASSIGN_ALIAS / (definition operator) is a single identifier all by itself. You could have a fully operational parser that blew your nose and that wouldn't make any difference either. If the grammar allows it and the parser rejects it, then two things are wrong: 1) the parser and 2) the idiot that wrote it. Gee. I wonder who that might be? Oh I knew, it's prePOsterous POppycock := (PO). Oh, you troll so well. My complements to the act of the total nitwit on the trail of trivia. Once again you are cheated out of recognition due you because of USENET contraction. Sigh. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 22:28 -0500 |
| Message-ID | <jZWdnS7gM9DVZu7CnZ2dnUU7-K2dnZ2d@giganews.com> |
| In reply to | #23656 |
On 9/29/2020 10:04 PM, Jeff Barnett wrote: > On 9/29/2020 1:34 PM, olcott wrote: > >> I have a fully operational parser that rejects that expression. >> The ONLY thing that can be in the left-hand-side (LHS) of a >> ASSIGN_ALIAS / (definition operator) is a single identifier all by >> itself. > > You could have a fully operational parser that blew your nose and that > wouldn't make any difference either. If the grammar allows it and the > parser rejects it, then two things are wrong: 1) the parser and 2) the > idiot that wrote it. Gee. I wonder who that might be? Oh I knew, it's > prePOsterous POppycock := (PO). Oh, you troll so well. My complements to > the act of the total nitwit on the trail of trivia. Once again you are > cheated out of recognition due you because of USENET contraction. Sigh. You have sufficiently proven that you are not a fool, I wonder why you continue acting like one? -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
Page 3 of 21 — ← Prev page 1 2 [3] 4 5 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web