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 1 of 21 [1] 2 3 … 21 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-28 16:22 -0500 |
| Subject | Formal specification of Minimal Type Theory (updated) |
| Message-ID | <Z5GdnRVta6-wye_CnZ2dnUU7-WvNnZ2d@giganews.com> |
Minimal Type Theory is intended to be its own Tarski Meta-language and show exactly why logic expressions having pathological self-reference meet the standard definition of incompleteness. A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). It would be incorrect to construe a formal system as incomplete on the basis that this formal system can neither prove nor disprove infinitely recursive logic expressions. https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF -- Copyright 2020 Pete Olcott
[toc] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-28 15:29 -0600 |
| Message-ID | <rktkkk$i5t$1@dont-email.me> |
| In reply to | #23621 |
On 2020-09-28 15:22, olcott wrote: > Minimal Type Theory is intended to be its own Tarski Meta-language and > show exactly why logic expressions having pathological self-reference > meet the standard definition of incompleteness. > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > It would be incorrect to construe a formal system as incomplete on the > basis that this formal system can neither prove nor disprove infinitely > recursive logic expressions. > > https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF According to the syntax you give in that lank, the following would be a well-formed expression of your system: (A := B) → C Do explain what that could possibly mean. 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-28 16:36 -0500 |
| Message-ID | <MqadnZKLyI_yyu_CnZ2dnUU7-R3NnZ2d@giganews.com> |
| In reply to | #23622 |
On 9/28/2020 4:29 PM, André G. Isaak wrote: > On 2020-09-28 15:22, olcott wrote: >> Minimal Type Theory is intended to be its own Tarski Meta-language and >> show exactly why logic expressions having pathological self-reference >> meet the standard definition of incompleteness. >> >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). >> >> It would be incorrect to construe a formal system as incomplete on the >> basis that this formal system can neither prove nor disprove >> infinitely recursive logic expressions. >> >> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF > > > According to the syntax you give in that lank, the following would be a > well-formed expression of your system: > > (A := B) → C > > Do explain what that could possibly mean. > > André > Unless B is defined somewhere else the semantic phase of the parse would fail. This is an example of another sentence is that syntactically correct nonsense: https://en.wikipedia.org/wiki/Colorless_green_ideas_sleep_furiously -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-28 16:31 -0600 |
| Message-ID | <rkto7k$a4i$1@dont-email.me> |
| In reply to | #23624 |
On 2020-09-28 15:36, olcott wrote: > On 9/28/2020 4:29 PM, André G. Isaak wrote: >> On 2020-09-28 15:22, olcott wrote: >>> Minimal Type Theory is intended to be its own Tarski Meta-language >>> and show exactly why logic expressions having pathological >>> self-reference meet the standard definition of incompleteness. >>> >>> A theory T is incomplete if and only if there is some sentence φ such >>> that (T ⊬ φ) and (T ⊬ ¬φ). >>> >>> It would be incorrect to construe a formal system as incomplete on >>> the basis that this formal system can neither prove nor disprove >>> infinitely recursive logic expressions. >>> >>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >> >> >> >> According to the syntax you give in that lank, the following would be >> a well-formed expression of your system: >> >> (A := B) → C >> >> Do explain what that could possibly mean. >> >> André >> > > Unless B is defined somewhere else the semantic phase of the parse would > fail. Assume B is defined. It is an atomic statement which is true. What would the above mean? Alternately, what would ¬(A := B) mean? You seem to not be getting the issue which I am raising. Your grammar claims that (A := B) is a type of SENTENCE, and as such it should appear wherever sentences appear, i.e. as one of the operands of a connective like ∧, ∨, →, etc. But unlike every other type of sentence in your grammar, which are things which have truth-values, definitions are things which *don't* have truth values. You can't treat them as a type of sentence en par with atomic sentences, conjunctions, disjunctions, etc. There is a good reason why symbols used to form definitions are relegated to the meta-language. They are fundamentally different from the kinds of things which appear in the language. 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-28 19:00 -0500 |
| Message-ID | <gbydnRJK97yX5O_CnZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #23626 |
On 9/28/2020 5:31 PM, André G. Isaak wrote: > On 2020-09-28 15:36, olcott wrote: >> On 9/28/2020 4:29 PM, André G. Isaak wrote: >>> On 2020-09-28 15:22, olcott wrote: >>>> Minimal Type Theory is intended to be its own Tarski Meta-language >>>> and show exactly why logic expressions having pathological >>>> self-reference meet the standard definition of incompleteness. >>>> >>>> A theory T is incomplete if and only if there is some sentence φ >>>> such that (T ⊬ φ) and (T ⊬ ¬φ). >>>> >>>> It would be incorrect to construe a formal system as incomplete on >>>> the basis that this formal system can neither prove nor disprove >>>> infinitely recursive logic expressions. >>>> >>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>> >>> >>> >>> >>> According to the syntax you give in that lank, the following would be >>> a well-formed expression of your system: >>> >>> (A := B) → C >>> >>> Do explain what that could possibly mean. >>> >>> André >>> >> >> Unless B is defined somewhere else the semantic phase of the parse >> would fail. > > Assume B is defined. It is an atomic statement which is true. What would > the above mean? > T → c // Where T is the logic symbol for True > Alternately, what would > > ¬(A := B) > ¬(T) means ⊥ // Where ⊥ is the logic symbol for false. > mean? > > You seem to not be getting the issue which I am raising. Your grammar > claims that (A := B) is a type of SENTENCE, and as such it should appear > wherever sentences appear, i.e. as one of the operands of a connective %left ASSIGN_ALIAS // := (definition operator) x := y means x is defined to be another name for y It is the exactly same macro substitution as C/C++ and is only used for two things, (1) To construct higher order logic expressions from layers of first order logic expressions (see example in the updated paper). Two layers creates second order logic. (a) S1 := ∀x (Px ∨ ¬Px) (b) ∀P(S1) Every instance of the left-hand-side of a definition is to be expanded into its right-hand-side. Thus the above two lines specify: ∀P(∀x (Px ∨ ¬Px)) (2) To accurately formalize actual self-reference to show its infinitely recursive structure as this link explains: https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html > like ∧, ∨, →, etc. But unlike every other type of sentence in your > grammar, which are things which have truth-values, definitions are > things which *don't* have truth values. You can't treat them as a type > of sentence en par with atomic sentences, conjunctions, disjunctions, etc. > > There is a good reason why symbols used to form definitions are > relegated to the meta-language. They are fundamentally different from > the kinds of things which appear in the language. > > André > Tarski's theory / metatheory hides the fact that the original expression is ill-formed because it has pathological self-reference. It is not that his metatheory has brilliant insights that his theory cannot see, it is merely that his metatheory is defined with one level of indirection away from his theory, thus no longer self-referential. http://www.liarparadox.org/Tarski_275_276.pdf -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-28 19:04 -0600 |
| Message-ID | <rku16u$vis$1@dont-email.me> |
| In reply to | #23628 |
On 2020-09-28 18:00, olcott wrote:
> On 9/28/2020 5:31 PM, André G. Isaak wrote:
>> On 2020-09-28 15:36, olcott wrote:
>>> On 9/28/2020 4:29 PM, André G. Isaak wrote:
>>>> On 2020-09-28 15:22, olcott wrote:
>>>>> Minimal Type Theory is intended to be its own Tarski Meta-language
>>>>> and show exactly why logic expressions having pathological
>>>>> self-reference meet the standard definition of incompleteness.
>>>>>
>>>>> A theory T is incomplete if and only if there is some sentence φ
>>>>> such that (T ⊬ φ) and (T ⊬ ¬φ).
>>>>>
>>>>> It would be incorrect to construe a formal system as incomplete on
>>>>> the basis that this formal system can neither prove nor disprove
>>>>> infinitely recursive logic expressions.
>>>>>
>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF
>>>>
>>>>
>>>>
>>>>
>>>>
>>>> According to the syntax you give in that lank, the following would
>>>> be a well-formed expression of your system:
>>>>
>>>> (A := B) → C
>>>>
>>>> Do explain what that could possibly mean.
>>>>
>>>> André
>>>>
>>>
>>> Unless B is defined somewhere else the semantic phase of the parse
>>> would fail.
>>
>> Assume B is defined. It is an atomic statement which is true. What
>> would the above mean?
>>
>
> T → c // Where T is the logic symbol for True
>
>> Alternately, what would
>>
>> ¬(A := B)
>>
>
> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false.
If A := B means 'A is henceforth another name for B', in what possible
sense can that be evaluated as either true or false?
You avoid this question by simply NOT PROVIDING ANY SEMANTICS for your
MTT. If you want to claim that (A := B) is a sentence of the same sort
as A or as (A ∨ B), then you need to give it a truth table, which, of
course, makes utterly no sense since giving a definition isn't a
truth-functional operation. Were you to attempt to provide some actual
semantics, you would realize why this proposal is blatant nonsense.
>> mean?
>>
>> You seem to not be getting the issue which I am raising. Your grammar
>> claims that (A := B) is a type of SENTENCE, and as such it should
>> appear wherever sentences appear, i.e. as one of the operands of a
>> connective
>
> %left ASSIGN_ALIAS
> // := (definition operator) x := y means x is defined to be another
> name for y
>
> It is the exactly same macro substitution as C/C++ and is only used for
> two things,
And in C I can't write:
If #define A B {do something}
else {do something else}
It makes absolutely no sense.
> (1) To construct higher order logic expressions from layers of first
> order logic expressions (see example in the updated paper).
> Two layers creates second order logic.
>
> (a) S1 := ∀x (Px ∨ ¬Px)
> (b) ∀P(S1)
So what would
¬(S1 := ∀x (Px ∨ ¬Px))
mean?
Your grammar claims the above can be negated. If so, what would the
'negation' of the above definition mean?
> Every instance of the left-hand-side of a definition is to be expanded
> into its right-hand-side. Thus the above two lines specify:
> ∀P(∀x (Px ∨ ¬Px))
Which would not be well-formed first order logic. If you allow variables
to refer to predicates, you are not dealing with FOL. If you do allow
variables to refer to predicates, then what's the point of using the above?
> (2) To accurately formalize actual self-reference to show its infinitely
> recursive structure as this link explains:
> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html
>
>> like ∧, ∨, →, etc. But unlike every other type of sentence in your
>> grammar, which are things which have truth-values, definitions are
>> things which *don't* have truth values. You can't treat them as a type
>> of sentence en par with atomic sentences, conjunctions, disjunctions,
>> etc.
Good of you to completely ignore the above paragraph.
André
>> There is a good reason why symbols used to form definitions are
>> relegated to the meta-language. They are fundamentally different from
>> the kinds of things which appear in the language.
>>
>> André
>>
>
> Tarski's theory / metatheory hides the fact that the original expression
> is ill-formed because it has pathological self-reference. It is not that
> his metatheory has brilliant insights that his theory cannot see, it is
> merely that his metatheory is defined with one level of indirection away
> from his theory, thus no longer self-referential.
>
> http://www.liarparadox.org/Tarski_275_276.pdf
>
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-28 22:00 -0500 |
| Message-ID | <xM2dnTIRBoOjPu_CnZ2dnUU7-cfNnZ2d@giganews.com> |
| In reply to | #23630 |
On 9/28/2020 8:04 PM, André G. Isaak wrote:
> On 2020-09-28 18:00, olcott wrote:
>> On 9/28/2020 5:31 PM, André G. Isaak wrote:
>>> On 2020-09-28 15:36, olcott wrote:
>>>> On 9/28/2020 4:29 PM, André G. Isaak wrote:
>>>>> On 2020-09-28 15:22, olcott wrote:
>>>>>> Minimal Type Theory is intended to be its own Tarski Meta-language
>>>>>> and show exactly why logic expressions having pathological
>>>>>> self-reference meet the standard definition of incompleteness.
>>>>>>
>>>>>> A theory T is incomplete if and only if there is some sentence φ
>>>>>> such that (T ⊬ φ) and (T ⊬ ¬φ).
>>>>>>
>>>>>> It would be incorrect to construe a formal system as incomplete on
>>>>>> the basis that this formal system can neither prove nor disprove
>>>>>> infinitely recursive logic expressions.
>>>>>>
>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF
>>>>>
>>>>>
>>>>>
>>>>>
>>>>>
>>>>>
>>>>> According to the syntax you give in that lank, the following would
>>>>> be a well-formed expression of your system:
>>>>>
>>>>> (A := B) → C
>>>>>
>>>>> Do explain what that could possibly mean.
>>>>>
>>>>> André
>>>>>
>>>>
>>>> Unless B is defined somewhere else the semantic phase of the parse
>>>> would fail.
>>>
>>> Assume B is defined. It is an atomic statement which is true. What
>>> would the above mean?
>>>
>>
>> T → c // Where T is the logic symbol for True
>>
>>> Alternately, what would
>>>
>>> ¬(A := B)
>>>
>>
>> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false.
>
> If A := B means 'A is henceforth another name for B', in what possible
> sense can that be evaluated as either true or false?
>
You said that B had the value of True, therefore ¬B is false.
> You avoid this question by simply NOT PROVIDING ANY SEMANTICS for your
Not at all, not in the least. All of the semantics comes from the
conventional meaning of the logical operators.
> MTT. If you want to claim that (A := B) is a sentence of the same sort
No it is not a sentence of the same sort...
I know that what I am saying is unconventional and that must be the
reason that you are having difficulty with it.
As I said a few times now think of A := B as macro expansion.
X := blah blah blah
Now whenever you see X substitute blah blah blah just like the C/C++
#define would do.
In the case of self-reference the substitution is impossible proving
that ill-formed nature of self-referential expressions.
If you read the second page of this link you will see that Clocksin and
Mellish describe the same problem with Prolog expressions.
http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
> as A or as (A ∨ B), then you need to give it a truth table, which, of
> course, makes utterly no sense since giving a definition isn't a
> truth-functional operation. Were you to attempt to provide some actual
> semantics, you would realize why this proposal is blatant nonsense.
>
>>> mean?
>>>
>>> You seem to not be getting the issue which I am raising. Your grammar
>>> claims that (A := B) is a type of SENTENCE, and as such it should
>>> appear wherever sentences appear, i.e. as one of the operands of a
>>> connective
>>
>> %left ASSIGN_ALIAS
>> // := (definition operator) x := y means x is defined to be another
>> name for y
>>
>> It is the exactly same macro substitution as C/C++ and is only used
>> for two things,
>
> And in C I can't write:
>
> If #define A B {do something}
> else {do something else}
>
> It makes absolutely no sense.
>
#define LP !True(LP) // is infinitely recursive.
https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html
>> (1) To construct higher order logic expressions from layers of first
>> order logic expressions (see example in the updated paper).
>> Two layers creates second order logic.
>>
>> (a) S1 := ∀x (Px ∨ ¬Px)
>> (b) ∀P(S1)
>
> So what would
>
> ¬(S1 := ∀x (Px ∨ ¬Px))
~(S1 := ∀x (P(x) ∨ ~P(x)))
<sentence_2 token="NOT">
<sentence_15 token="ASSIGN_ALIAS">
<sentence_15 token="IDENTIFIER" value="S1"/>
<sentence_4 token="FOR_ALL">
<sentence_4 token="IDENTIFIER" value="x"/>
<sentence_13 token="OR">
<atomic_sentence_1 token="IDENTIFIER" value="P">
<term_2 token="IDENTIFIER" value="x"/>
</atomic_sentence_1>
<sentence_2 token="NOT">
<atomic_sentence_1 token="IDENTIFIER" value="P">
<term_2 token="IDENTIFIER" value="x"/>
</atomic_sentence_1>
</sentence_2>
</sentence_13>
</sentence_4>
</sentence_15>
</sentence_2>
I should probably rewrite the syntax disallow that expression.
>
> mean?
>
> Your grammar claims the above can be negated. If so, what would the
> 'negation' of the above definition mean?
>
You found a bug in my grammar. Now that I found my fully operational
parser I can fix it and test the fix.
>> Every instance of the left-hand-side of a definition is to be expanded
>> into its right-hand-side. Thus the above two lines specify:
>> ∀P(∀x (Px ∨ ¬Px))
>
> Which would not be well-formed first order logic.
Of course the above is not a well-formed FOL expression as I have said
several times now.
You have to do much more than glance at a few of my words to understand
what I am saying. You also have to carefully read every word of my links.
The above is a second order logic expression that can be expressed using
first order logic syntax AND the ":=" assign alias operator. I have said
this and provided the example of how to do this three times times now.
> If you allow variables
> to refer to predicates, you are not dealing with FOL. If you do allow
> variables to refer to predicates, then what's the point of using the above?
>
The point is that with MTT you can write 187th order logic expressions
as FOL expressions nested 186 levels deep, all using the very simple
slightly augmented syntax of FOL.
>> (2) To accurately formalize actual self-reference to show its
>> infinitely recursive structure as this link explains:
>> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html
>>
>>> like ∧, ∨, →, etc. But unlike every other type of sentence in your
>>> grammar, which are things which have truth-values, definitions are
>>> things which *don't* have truth values. You can't treat them as a
>>> type of sentence en par with atomic sentences, conjunctions,
>>> disjunctions, etc.
>
> Good of you to completely ignore the above paragraph.
>
You are asking what is the semantics of a thing that has no semantics.
:= is only macro substitution it has no semantics.
> André
>
>>> There is a good reason why symbols used to form definitions are
>>> relegated to the meta-language. They are fundamentally different from
>>> the kinds of things which appear in the language.
>>>
>>> André
>>>
>>
>> Tarski's theory / metatheory hides the fact that the original
>> expression is ill-formed because it has pathological self-reference.
>> It is not that his metatheory has brilliant insights that his theory
>> cannot see, it is merely that his metatheory is defined with one level
>> of indirection away from his theory, thus no longer self-referential.
>>
>> http://www.liarparadox.org/Tarski_275_276.pdf
>>
>
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 01:48 -0600 |
| Message-ID | <rkuosv$gfm$1@dont-email.me> |
| In reply to | #23631 |
On 2020-09-28 21:00, olcott wrote:
> On 9/28/2020 8:04 PM, André G. Isaak wrote:
>> On 2020-09-28 18:00, olcott wrote:
>>> On 9/28/2020 5:31 PM, André G. Isaak wrote:
>>>> On 2020-09-28 15:36, olcott wrote:
>>>>> On 9/28/2020 4:29 PM, André G. Isaak wrote:
>>>>>> On 2020-09-28 15:22, olcott wrote:
>>>>>>> Minimal Type Theory is intended to be its own Tarski
>>>>>>> Meta-language and show exactly why logic expressions having
>>>>>>> pathological self-reference meet the standard definition of
>>>>>>> incompleteness.
>>>>>>>
>>>>>>> A theory T is incomplete if and only if there is some sentence φ
>>>>>>> such that (T ⊬ φ) and (T ⊬ ¬φ).
>>>>>>>
>>>>>>> It would be incorrect to construe a formal system as incomplete
>>>>>>> on the basis that this formal system can neither prove nor
>>>>>>> disprove infinitely recursive logic expressions.
>>>>>>>
>>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> According to the syntax you give in that lank, the following would
>>>>>> be a well-formed expression of your system:
>>>>>>
>>>>>> (A := B) → C
>>>>>>
>>>>>> Do explain what that could possibly mean.
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> Unless B is defined somewhere else the semantic phase of the parse
>>>>> would fail.
>>>>
>>>> Assume B is defined. It is an atomic statement which is true. What
>>>> would the above mean?
>>>>
>>>
>>> T → c // Where T is the logic symbol for True
>>>
>>>> Alternately, what would
>>>>
>>>> ¬(A := B)
>>>>
>>>
>>> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false.
>>
>> If A := B means 'A is henceforth another name for B', in what possible
>> sense can that be evaluated as either true or false?
>>
>
> You said that B had the value of True, therefore ¬B is false.
But I didn't ask about the value of ¬B (or B or A or ¬A). I asked about
the value of ¬(A := B)
Since this isn't sinking in, let's use a pascal analogy.
In pascal, the following mean different things
A := B
A = B
The first is a variable assignment. The second is a comparison. The
first is a statement which describes an action and has no value. The
second is an expression which has a boolean value. The syntax of pascal
treats statements and expressions as fundamentally different units. The
first can stand alone; the second must be a part of some larger statement.
Your := is analogous to the first of these, but your grammar treats it
as the same type of object as the second. That's simply wrong. Which is
particularly ironic given that a language which you call 'minimal type
theory' fails to distinguish between different types of things.
>> You avoid this question by simply NOT PROVIDING ANY SEMANTICS for your
>
> Not at all, not in the least. All of the semantics comes from the
> conventional meaning of the logical operators.
Except := isn't a conventional operator. You can claim that your ¬, ∧,
→, etc. have conventional meanings. You can't state this for :=.
>> MTT. If you want to claim that (A := B) is a sentence of the same sort
>
> No it is not a sentence of the same sort...
According to your grammar it is, since your grammar only recognizes
SENTENCES. There is nothing in the grammar which mentions different
types of sentences.
> I know that what I am saying is unconventional and that must be the
> reason that you are having difficulty with it.
> As I said a few times now think of A := B as macro expansion.
>
> X := blah blah blah
> Now whenever you see X substitute blah blah blah just like the C/C++
> #define would do.
And is it possible to evaluate the following as true or false?
#define A B
No. It isn't. So why should it be possible to evaluate (A := B) as true
or false?
> In the case of self-reference the substitution is impossible proving
> that ill-formed nature of self-referential expressions.
>
> If you read the second page of this link you will see that Clocksin and
> Mellish describe the same problem with Prolog expressions.
>
> http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
>
>> as A or as (A ∨ B), then you need to give it a truth table, which, of
>> course, makes utterly no sense since giving a definition isn't a
>> truth-functional operation. Were you to attempt to provide some actual
>> semantics, you would realize why this proposal is blatant nonsense.
>>
>>>> mean?
>>>>
>>>> You seem to not be getting the issue which I am raising. Your
>>>> grammar claims that (A := B) is a type of SENTENCE, and as such it
>>>> should appear wherever sentences appear, i.e. as one of the operands
>>>> of a connective
>>>
>>> %left ASSIGN_ALIAS
>>> // := (definition operator) x := y means x is defined to be another
>>> name for y
>>>
>>> It is the exactly same macro substitution as C/C++ and is only used
>>> for two things,
>>
>> And in C I can't write:
>>
>> If #define A B {do something}
>> else {do something else}
>>
>> It makes absolutely no sense.
>>
>
> #define LP !True(LP) // is infinitely recursive.
> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html
You really need to actually read that article. #define LP !True(LP) is
*not* infinitely recursive. From the article: "The self-reference rule
cuts this process short after one step, at (4 + foo)". You have a habit
of posting things which say exactly the opposite of what you claim they do.
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 10:49 -0500 |
| Message-ID | <y7qdnV3BN9A-yu7CnZ2dnUU7-WXNnZ2d@giganews.com> |
| In reply to | #23635 |
On 9/29/2020 2:48 AM, André G. Isaak wrote:
> On 2020-09-28 21:00, olcott wrote:
>> On 9/28/2020 8:04 PM, André G. Isaak wrote:
>>> On 2020-09-28 18:00, olcott wrote:
>>>> On 9/28/2020 5:31 PM, André G. Isaak wrote:
>>>>> On 2020-09-28 15:36, olcott wrote:
>>>>>> On 9/28/2020 4:29 PM, André G. Isaak wrote:
>>>>>>> On 2020-09-28 15:22, olcott wrote:
>>>>>>>> Minimal Type Theory is intended to be its own Tarski
>>>>>>>> Meta-language and show exactly why logic expressions having
>>>>>>>> pathological self-reference meet the standard definition of
>>>>>>>> incompleteness.
>>>>>>>>
>>>>>>>> A theory T is incomplete if and only if there is some sentence φ
>>>>>>>> such that (T ⊬ φ) and (T ⊬ ¬φ).
>>>>>>>>
>>>>>>>> It would be incorrect to construe a formal system as incomplete
>>>>>>>> on the basis that this formal system can neither prove nor
>>>>>>>> disprove infinitely recursive logic expressions.
>>>>>>>>
>>>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> According to the syntax you give in that lank, the following
>>>>>>> would be a well-formed expression of your system:
>>>>>>>
>>>>>>> (A := B) → C
>>>>>>>
>>>>>>> Do explain what that could possibly mean.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> Unless B is defined somewhere else the semantic phase of the parse
>>>>>> would fail.
>>>>>
>>>>> Assume B is defined. It is an atomic statement which is true. What
>>>>> would the above mean?
>>>>>
>>>>
>>>> T → c // Where T is the logic symbol for True
>>>>
>>>>> Alternately, what would
>>>>>
>>>>> ¬(A := B)
>>>>>
>>>>
>>>> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false.
>>>
>>> If A := B means 'A is henceforth another name for B', in what
>>> possible sense can that be evaluated as either true or false?
>>>
>>
>> You said that B had the value of True, therefore ¬B is false.
>
> But I didn't ask about the value of ¬B (or B or A or ¬A). I asked about
> the value of ¬(A := B)
>
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
I have said that so many times and you igored it so I said it ten more
times in a row.
> Since this isn't sinking in, let's use a pascal analogy.
>
> In pascal, the following mean different things
>
> A := B
> A = B
>
This is not Pascal it is Minimal Type Theory.
> The first is a variable assignment. The second is a comparison. The
Yes and neither one of those is macro substitution.
It seems that you might not believe that self reference can be
pathological. It seems that you must be ignoring the material on my
links. You can' do that and actually understand what I am saying.
Let me know when you have read the yellow highlighted material on the
second page of this link.
http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
> first is a statement which describes an action and has no value. The
> second is an expression which has a boolean value. The syntax of pascal
> treats statements and expressions as fundamentally different units. The
> first can stand alone; the second must be a part of some larger statement.
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
>
> Your := is analogous to the first of these, but your grammar treats it
> as the same type of object as the second. That's simply wrong. Which is
> particularly ironic given that a language which you call 'minimal type
> theory' fails to distinguish between different types of things.
Yes the grammar has a bug.
>
>>> You avoid this question by simply NOT PROVIDING ANY SEMANTICS for your
>>
>> Not at all, not in the least. All of the semantics comes from the
>> conventional meaning of the logical operators.
>
> Except := isn't a conventional operator. You can claim that your ¬, ∧,
> →, etc. have conventional meanings. You can't state this for :=.
It is a conventional, macro substitution operator.
If is referred to as the definition operator.
Different variations of it have "def" as a subscript.
>
>>> MTT. If you want to claim that (A := B) is a sentence of the same sort
>>
>> No it is not a sentence of the same sort...
>
> According to your grammar it is, since your grammar only recognizes
> SENTENCES. There is nothing in the grammar which mentions different
> types of sentences.
>
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
A := B is only macro substitution nothing more
>> I know that what I am saying is unconventional and that must be the
>> reason that you are having difficulty with it.
>
>> As I said a few times now think of A := B as macro expansion.
>>
>> X := blah blah blah
>> Now whenever you see X substitute blah blah blah just like the C/C++
>> #define would do.
>
> And is it possible to evaluate the following as true or false?
>
> #define A B
>
> No. It isn't. So why should it be possible to evaluate (A := B) as true
> or false?
>
This can be construed two different ways:
(1) It is not possible to evaluate the expression as true or false.
(2) The LHS of the expression aquires the truth value of its RHS.
I am leaning towards your interpretation as more apt.
>> In the case of self-reference the substitution is impossible proving
>> that ill-formed nature of self-referential expressions.
>>
>> If you read the second page of this link you will see that Clocksin
>> and Mellish describe the same problem with Prolog expressions.
>>
>> http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
>>
>>> as A or as (A ∨ B), then you need to give it a truth table, which, of
>>> course, makes utterly no sense since giving a definition isn't a
>>> truth-functional operation. Were you to attempt to provide some
>>> actual semantics, you would realize why this proposal is blatant
>>> nonsense.
>>>
>>>>> mean?
>>>>>
>>>>> You seem to not be getting the issue which I am raising. Your
>>>>> grammar claims that (A := B) is a type of SENTENCE, and as such it
>>>>> should appear wherever sentences appear, i.e. as one of the
>>>>> operands of a connective
>>>>
>>>> %left ASSIGN_ALIAS
>>>> // := (definition operator) x := y means x is defined to be another
>>>> name for y
>>>>
>>>> It is the exactly same macro substitution as C/C++ and is only used
>>>> for two things,
>>>
>>> And in C I can't write:
>>>
>>> If #define A B {do something}
>>> else {do something else}
>>>
>>> It makes absolutely no sense.
>>>
>>
>> #define LP !True(LP) // is infinitely recursive.
>> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html
>
> You really need to actually read that article. #define LP !True(LP) is
> *not* infinitely recursive. From the article: "The self-reference rule
It specifies infinite recursion and this infinite recursion is ignored.
#define foo (4 + foo)
where foo is also a variable in your program.
Following the ordinary rules, each reference to foo will expand into (4
+ foo); then this will be rescanned and will expand into (4 + (4 +
foo)); and so on until the computer runs out of memory.
> cuts this process short after one step, at (4 + foo)". You have a habit
> of posting things which say exactly the opposite of what you claim they do.
>
> André
>
It recognizes the infinite recursion and intentionally fails to
interpret it correctly because interpreting it correctly has
dysfunctional results.
Prolog's unify_with_occurs_check/2 will report an error in this case.
None-the-less the point that you have been consistently dodging is that
infinitely recursive expressions are ill-formed expressions that cannot
be evaluated and because they cannot be evaluated they meet the standard
definition of incompleteness:
A theory T is incomplete if and only if there is some sentence φ such
that (T ⊬ φ) and (T ⊬ ¬φ).
So error with the standard definition of Incompleteness is that it
allocates incompleteness to formal systems entirely on the basis that it
cannot evaluate infinitely recursive (thus ill-formed) expressions.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 12:34 -0600 |
| Message-ID | <rkvuoh$iq3$1@dont-email.me> |
| In reply to | #23637 |
On 2020-09-29 09:49, olcott wrote: > On 9/29/2020 2:48 AM, André G. Isaak wrote: >> On 2020-09-28 21:00, olcott wrote: >>> On 9/28/2020 8:04 PM, André G. Isaak wrote: >>>> On 2020-09-28 18:00, olcott wrote: >>>>> On 9/28/2020 5:31 PM, André G. Isaak wrote: >>>>>> On 2020-09-28 15:36, olcott wrote: >>>>>>> On 9/28/2020 4:29 PM, André G. Isaak wrote: >>>>>>>> On 2020-09-28 15:22, olcott wrote: >>>>>>>>> Minimal Type Theory is intended to be its own Tarski >>>>>>>>> Meta-language and show exactly why logic expressions having >>>>>>>>> pathological self-reference meet the standard definition of >>>>>>>>> incompleteness. >>>>>>>>> >>>>>>>>> A theory T is incomplete if and only if there is some sentence >>>>>>>>> φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>>>> >>>>>>>>> It would be incorrect to construe a formal system as incomplete >>>>>>>>> on the basis that this formal system can neither prove nor >>>>>>>>> disprove infinitely recursive logic expressions. >>>>>>>>> >>>>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> According to the syntax you give in that lank, the following >>>>>>>> would be a well-formed expression of your system: >>>>>>>> >>>>>>>> (A := B) → C >>>>>>>> >>>>>>>> Do explain what that could possibly mean. >>>>>>>> >>>>>>>> André >>>>>>>> >>>>>>> >>>>>>> Unless B is defined somewhere else the semantic phase of the >>>>>>> parse would fail. >>>>>> >>>>>> Assume B is defined. It is an atomic statement which is true. What >>>>>> would the above mean? >>>>>> >>>>> >>>>> T → c // Where T is the logic symbol for True >>>>> >>>>>> Alternately, what would >>>>>> >>>>>> ¬(A := B) >>>>>> >>>>> >>>>> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false. >>>> >>>> If A := B means 'A is henceforth another name for B', in what >>>> possible sense can that be evaluated as either true or false? >>>> >>> >>> You said that B had the value of True, therefore ¬B is false. >> >> But I didn't ask about the value of ¬B (or B or A or ¬A). I asked >> about the value of ¬(A := B) >> > > > A := B is only macro substitution nothing more snip 15 repetitions of the above >> Your := is analogous to the first of these, but your grammar treats it >> as the same type of object as the second. That's simply wrong. Which >> is particularly ironic given that a language which you call 'minimal >> type theory' fails to distinguish between different types of things. > > Yes the grammar has a bug. Wouldn't it have been much easier to just acknowledge that without repeating your assertion above 15 times? And yet you still go on to repeat it an additional 5 times below (which I have also snipped). >>> Not at all, not in the least. All of the semantics comes from the >>> conventional meaning of the logical operators. >> >> Except := isn't a conventional operator. You can claim that your ¬, ∧, >> →, etc. have conventional meanings. You can't state this for :=. > > It is a conventional, macro substitution operator. No. It is used to indicate definitions in the meta language. Definitions are not the same as macro expansion which is a simple text replacement operation. And I am not aware of *any* logic which defines the semantics of such a symbol within the language itself. If you want to use it in the language, you need to actually do so. >> And is it possible to evaluate the following as true or false? >> >> #define A B >> >> No. It isn't. So why should it be possible to evaluate (A := B) as >> true or false? >> > > This can be construed two different ways: > (1) It is not possible to evaluate the expression as true or false. Right. That's because definitions aren't boolean expressions. But this means that your definition isn't actually a translation of the Liar's paradox which does present itself as a boolean expression. >>> #define LP !True(LP) // is infinitely recursive. >>> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html >> >> You really need to actually read that article. #define LP !True(LP) is >> *not* infinitely recursive. From the article: "The self-reference rule > > It specifies infinite recursion and this infinite recursion is ignored. > > #define foo (4 + foo) > where foo is also a variable in your program. > > Following the ordinary rules, each reference to foo will expand into (4 > + foo); then this will be rescanned and will expand into (4 + (4 + > foo)); and so on until the computer runs out of memory. > >> cuts this process short after one step, at (4 + foo)". You have a >> habit of posting things which say exactly the opposite of what you >> claim they do. >> >> André >> > > It recognizes the infinite recursion and intentionally fails to > interpret it correctly because interpreting it correctly has > dysfunctional results. No. It interprets it correctly, since that is the way #define is defined to work for C. That's why you can't keep claiming that your := is the same as macro replacement in C when clearly you don't intend it to be the same as in C. You need to actually define how you want it to work. And here you run into a serious problem. C is a computer language. C programs are contained in a text file which is then run through a compiler. Macro replacement is a *text replacement* operation, not something which has any actual semantics associated with it (well, that's not quite true, but the amount of interpretation which the preprocessor applies to macros is extremely limited). The language of logic isn't like that. Claiming to have 'macro expansion' for FOL or some extension thereof makes no more sense than claiming to have macro expansion for English. 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 14:17 -0500 |
| Message-ID | <PMCdnRwp0ZezFe7CnZ2dnUU7-YvNnZ2d@giganews.com> |
| In reply to | #23641 |
On 9/29/2020 1:34 PM, André G. Isaak wrote: > On 2020-09-29 09:49, olcott wrote: >> On 9/29/2020 2:48 AM, André G. Isaak wrote: >>> On 2020-09-28 21:00, olcott wrote: >>>> On 9/28/2020 8:04 PM, André G. Isaak wrote: >>>>> On 2020-09-28 18:00, olcott wrote: >>>>>> On 9/28/2020 5:31 PM, André G. Isaak wrote: >>>>>>> On 2020-09-28 15:36, olcott wrote: >>>>>>>> On 9/28/2020 4:29 PM, André G. Isaak wrote: >>>>>>>>> On 2020-09-28 15:22, olcott wrote: >>>>>>>>>> Minimal Type Theory is intended to be its own Tarski >>>>>>>>>> Meta-language and show exactly why logic expressions having >>>>>>>>>> pathological self-reference meet the standard definition of >>>>>>>>>> incompleteness. >>>>>>>>>> >>>>>>>>>> A theory T is incomplete if and only if there is some sentence >>>>>>>>>> φ such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>>>>>> >>>>>>>>>> It would be incorrect to construe a formal system as >>>>>>>>>> incomplete on the basis that this formal system can neither >>>>>>>>>> prove nor disprove infinitely recursive logic expressions. >>>>>>>>>> >>>>>>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> According to the syntax you give in that lank, the following >>>>>>>>> would be a well-formed expression of your system: >>>>>>>>> >>>>>>>>> (A := B) → C >>>>>>>>> >>>>>>>>> Do explain what that could possibly mean. >>>>>>>>> >>>>>>>>> André >>>>>>>>> >>>>>>>> >>>>>>>> Unless B is defined somewhere else the semantic phase of the >>>>>>>> parse would fail. >>>>>>> >>>>>>> Assume B is defined. It is an atomic statement which is true. >>>>>>> What would the above mean? >>>>>>> >>>>>> >>>>>> T → c // Where T is the logic symbol for True >>>>>> >>>>>>> Alternately, what would >>>>>>> >>>>>>> ¬(A := B) >>>>>>> >>>>>> >>>>>> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false. >>>>> >>>>> If A := B means 'A is henceforth another name for B', in what >>>>> possible sense can that be evaluated as either true or false? >>>>> >>>> >>>> You said that B had the value of True, therefore ¬B is false. >>> >>> But I didn't ask about the value of ¬B (or B or A or ¬A). I asked >>> about the value of ¬(A := B) >>> >> >> >> A := B is only macro substitution nothing more > > snip 15 repetitions of the above > >>> Your := is analogous to the first of these, but your grammar treats >>> it as the same type of object as the second. That's simply wrong. >>> Which is particularly ironic given that a language which you call >>> 'minimal type theory' fails to distinguish between different types of >>> things. >> >> Yes the grammar has a bug. > > Wouldn't it have been much easier to just acknowledge that without > repeating your assertion above 15 times? Apparently not. I explained this all to you before in about five different replies and you seemed to simply ignore the explanation. > And yet you still go on to > repeat it an additional 5 times below (which I have also snipped). > > >>> Not at all, not in the least. All of the semantics comes from the > >>> conventional meaning of the logical operators. > >> > >> Except := isn't a conventional operator. You can claim that your ¬, ∧, > >> →, etc. have conventional meanings. You can't state this for :=. > > > > It is a conventional, macro substitution operator. > > No. It is used to indicate definitions in the meta language. Definitions > are not the same as macro expansion which is a simple text replacement > operation. I just proved that they are and you ignored my proof several times now. Ignoring a proof is not at all the same thing as proving a correct rebuttal. Following the ordinary rules, each reference to foo will expand into (4 + foo); then this will be rescanned and will expand into (4 + (4 + foo)); and so on until the computer runs out of memory. The self-reference rule cuts this process short after one step, at (4 + foo). https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html The macro does specify infinite recursion. The macro processor knows this and overrides the specification. > And I am not aware of *any* logic which defines the semantics of such a > symbol within the language itself. If you want to use it in the > language, you need to actually do so. > -- A := B is only macro substitution nothing more -- A := B is only macro substitution nothing more -- A := B is only macro substitution nothing more -- A := B is only macro substitution nothing more -- A := B is only macro substitution nothing more It is a syntactic aspect of the language in the same way that #define is a syntatic aspect of C/C++. It is not a sementic aspect of the language. >>> And is it possible to evaluate the following as true or false? >>> >>> #define A B >>> >>> No. It isn't. So why should it be possible to evaluate (A := B) as >>> true or false? >>> >> >> This can be construed two different ways: >> (1) It is not possible to evaluate the expression as true or false. > > Right. That's because definitions aren't boolean expressions. > But this > means that your definition isn't actually a translation of the Liar's > paradox which does present itself as a boolean expression. > Sure it is: #define LP !True(LP) // is infinitely recursive. The macro preprocessor recognizes this and overrides it. I show that the Liar Paradox must be rejected as a Boolean expression. The Liar Paradox is not a truth bearer. >>>> #define LP !True(LP) // is infinitely recursive. >>>> https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html >>> >>> You really need to actually read that article. #define LP !True(LP) >>> is *not* infinitely recursive. From the article: "The self-reference >>> rule >> >> It specifies infinite recursion and this infinite recursion is ignored. >> >> #define foo (4 + foo) >> where foo is also a variable in your program. >> >> Following the ordinary rules, each reference to foo will expand into >> (4 + foo); then this will be rescanned and will expand into (4 + (4 + >> foo)); and so on until the computer runs out of memory. >> >>> cuts this process short after one step, at (4 + foo)". You have a >>> habit of posting things which say exactly the opposite of what you >>> claim they do. >>> >>> André >>> >> >> It recognizes the infinite recursion and intentionally fails to >> interpret it correctly because interpreting it correctly has >> dysfunctional results. > > No. It interprets it correctly, since that is the way #define is defined > to work for C. > Following the ordinary rules, each reference to foo will expand into (4 + foo); then this will be rescanned and will expand into (4 + (4 + foo)); and so on until the computer runs out of memory. The self-reference rule cuts this process short after one step, at (4 + foo). https://gcc.gnu.org/onlinedocs/cpp/Self-Referential-Macros.html The macro preprocessor recognizes infinite recursion and overrides it. The macro preprocessor recognizes infinite recursion and overrides it. The macro preprocessor recognizes infinite recursion and overrides it. The macro preprocessor recognizes infinite recursion and overrides it. The macro preprocessor recognizes infinite recursion and overrides it. > That's why you can't keep claiming that your := is the same as macro > replacement in C when clearly you don't intend it to be the same as in C. > > You need to actually define how you want it to work. For pathological self-reference yt works the same way as other text that you perpetually ignore. http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf It recognizes the infinite recursion the same way that Prolog's unify_with_occurs_check/2 does and reports it as an error. > And here you run into a serious problem. C is a computer language. C > programs are contained in a text file which is then run through a > compiler. Macro replacement is a *text replacement* operation, not > something which has any actual semantics associated with it (well, > that's not quite true, but the amount of interpretation which the > preprocessor applies to macros is extremely limited). > I could have presented the whole thing the way that Prolog does it but then mathematicians would say that my work has nothing to do with mathematics it is computer science. > The language of logic isn't like that. Claiming to have 'macro > expansion' for FOL or some extension thereof makes no more sense than > claiming to have macro expansion for English. > > André > Maybe there is a better way to do this mathematically, yet I can think of none. The point is that pathological self-reference must be accurately formalized so that is erroneous nature can be seen. More properly pathological self-reference is infinite recursion in computer science. https://www.researchgate.net/publication/342503359_Defining_Godel_Incompleteness_Away This: G ↔ (F ⊬ G) is the same sort of pathological self-reference that Prolog would reject with its unify_with_occurs_check/2 When we say it this way: G := (F ⊬ G) Then even mathematicians can see its error. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 11:31 -0500 |
| Message-ID | <U5ydnYr_Yv7q_O7CnZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #23630 |
On 9/28/2020 8:04 PM, André G. Isaak wrote: > On 2020-09-28 18:00, olcott wrote: >> On 9/28/2020 5:31 PM, André G. Isaak wrote: >>> On 2020-09-28 15:36, olcott wrote: >>>> On 9/28/2020 4:29 PM, André G. Isaak wrote: >>>>> On 2020-09-28 15:22, olcott wrote: >>>>>> Minimal Type Theory is intended to be its own Tarski Meta-language >>>>>> and show exactly why logic expressions having pathological >>>>>> self-reference meet the standard definition of incompleteness. >>>>>> >>>>>> A theory T is incomplete if and only if there is some sentence φ >>>>>> such that (T ⊬ φ) and (T ⊬ ¬φ). >>>>>> >>>>>> It would be incorrect to construe a formal system as incomplete on >>>>>> the basis that this formal system can neither prove nor disprove >>>>>> infinitely recursive logic expressions. >>>>>> >>>>>> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF >>>>> >>>>> >>>>> >>>>> >>>>> >>>>> >>>>> According to the syntax you give in that lank, the following would >>>>> be a well-formed expression of your system: >>>>> >>>>> (A := B) → C >>>>> >>>>> Do explain what that could possibly mean. >>>>> >>>>> André >>>>> >>>> >>>> Unless B is defined somewhere else the semantic phase of the parse >>>> would fail. >>> >>> Assume B is defined. It is an atomic statement which is true. What >>> would the above mean? >>> >> >> T → c // Where T is the logic symbol for True >> >>> Alternately, what would >>> >>> ¬(A := B) >>> >> >> ¬(T) means ⊥ // Where ⊥ is the logic symbol for false. > > If A := B means 'A is henceforth another name for B', in what possible > sense can that be evaluated as either true or false? > > You avoid this question by simply NOT PROVIDING ANY SEMANTICS for your > MTT. If you want to claim that (A := B) is a sentence of the same sort > as A or as (A ∨ B), then you need to give it a truth table, which, of > course, makes utterly no sense since giving a definition isn't a > truth-functional operation. Were you to attempt to provide some actual > semantics, you would realize why this proposal is blatant nonsense. > 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 -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 12:40 -0600 |
| Message-ID | <rkvv25$l09$1@dont-email.me> |
| In reply to | #23638 |
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. You now need to define what a 'definition' is in the semantics. By 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? Your grammar also claims that the following is well-formed: (A, B, C) := (D ∨ E) → F What might that mean? 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 14:34 -0500 |
| Message-ID | <WLqdnQNY3ZS2Ee7CnZ2dnUU7-VfNnZ2d@giganews.com> |
| In reply to | #23642 |
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. 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. > Your grammar also claims that the following is well-formed: > > (A, B, C) := (D ∨ E) → F > > What might that mean? 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. > > André > That was a good catch. My YACC grammar was way off. I haven't looked at it for a very long time. I must have stopped working on it before it was finished. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-29 14:06 -0600 |
| Message-ID | <rl044q$qk3$1@dont-email.me> |
| In reply to | #23644 |
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. > 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 isn't. It is a translation of 'X is defined as ¬X', which is not the same thing. 'This sentence is false' is an assertion, not a definition. As such, it 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. >> Your grammar also claims that the following is well-formed: >> >> (A, B, C) := (D ∨ E) → F >> >> What might that mean? > > I have a fully operational parser that rejects that expression. Yes, that was a misreading on my part. 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 15:47 -0500 |
| Message-ID | <3_2dnemWz9PSAO7CnZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #23645 |
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. >> 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. > 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." >>> Your grammar also claims that the following is well-formed: >>> >>> (A, B, C) := (D ∨ E) → F >>> >>> What might that mean? >> >> I have a fully operational parser that rejects that expression. > > Yes, that was a misreading on my part. > > André > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 16:44 -0500 |
| Message-ID | <06OdnUbEm6lHN-7CnZ2dnUU7-f-dnZ2d@giganews.com> |
| In reply to | #23646 |
On 9/29/2020 3:47 PM, 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. > >>> 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 Yet symbolic logic > had to make one up. > >> 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." > >>>> Your grammar also claims that the following is well-formed: >>>> >>>> (A, B, C) := (D ∨ E) → F >>>> >>>> What might that mean? >>> >>> I have a fully operational parser that rejects that expression. >> >> Yes, that was a misreading on my part. >> >> André >> > > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-29 23:26 +0100 |
| Message-ID | <87o8lob4oz.fsf@bsb.me.uk> |
| In reply to | #23646 |
olcott <NoOne@NoWhere.com> writes: > Yet symbolic [logic] has no way to precisely specify actual > self-reference so I had to make one up. Yet you claim that Gödel's proof uses self-reference. Will you now retract that claim? If not, why make up a way to do it when you think Gödel managed it nearly a century ago? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-29 19:40 -0500 |
| Message-ID | <vaOdnVL9tqFiTu7CnZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #23648 |
On 9/29/2020 5:26 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> Yet symbolic [logic] has no way to precisely specify actual
>> self-reference so I had to make one up.
>
> Yet you claim that Gödel's proof uses self-reference. Will you now
> retract that claim? If not, why make up a way to do it when you think
> Gödel managed it nearly a century ago?
>
https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf
14 Every epistemological antinomy can likewise be used for a similar
undecidability proof. (Gödel 1931)
Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA MATHEMATICA
AND RELATED SYSTEMS I
A theory T is incomplete if and only if there is some sentence φ such
that (T ⊬ φ) and (T ⊬ ¬φ).
Instead of going around and around about what the math says or what it
doesn't say Gödel himself said Every epistemological antinomy (including
the Liar Paradox) can likewise be used for a similar undecidability proof.
So all we have to do is formalize the natural language sentence:
"This sentence is not true."
Unlike the formalization of every other natural language sentence the
formalization of this sentence does not need to include any knowledge
about the world what-so-ever.
The Liar Paradox is merely an ordinary logical proposition that make an
assertion about its own truth value.
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)
http://www.liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
Prolog's unify_with_occurs_check/2 rejects such "infinite terms".
The same thing occurs when we examine the actual semantics of this C/C++
initialization.
int main()
{
bool LP = (LP != true);
}
When we actually pay attention to the semantics of this instead of
focusing on what compilers do or what C/C++ standards require then the
above expression would assign a Boolean value to LP on the basis of
comparing the Boolean value of true to an non-existent value.
This is exactly the same thing as recording the number of feet of length
of the car of a person that has no car.
--
Copyright 2020 Pete Olcott
.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 02:12 +0100 |
| Message-ID | <87d024awzp.fsf@bsb.me.uk> |
| In reply to | #23650 |
olcott <NoOne@NoWhere.com> writes: > On 9/29/2020 5:26 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Yet symbolic [logic] has no way to precisely specify actual >>> self-reference so I had to make one up. >> >> Yet you claim that Gödel's proof uses self-reference. Will you now >> retract that claim? If not, why make up a way to do it when you think >> Gödel managed it nearly a century ago? > > https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf > > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931) > > Gödel 1931 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA > MATHEMATICA AND RELATED SYSTEMS I > > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). > > Instead of going around and around about what the math says... By which you mean you can see the problem (you can't be right about both your claims) so you'd rather not talk about it. OK. Fine by me. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 1 of 21 [1] 2 3 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web