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 4 of 21 — ← Prev page 1 2 3 [4] 5 6 … 21 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 11:42 +0100 |
| Message-ID | <87y2kra6lb.fsf@bsb.me.uk> |
| In reply to | #23644 |
olcott <NoOne@NoWhere.com> writes: > I have a fully operational parser that rejects that expression. Your parser can only be based on what you want the published grammar to mean, not on what you actually published because, to the delight of fans of irony, you have a syntax error (two in fact) in your syntax specification. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 14:03 -0500 |
| Message-ID | <R4CdndhcspoFS-nCnZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #23668 |
On 9/30/2020 5:42 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> I have a fully operational parser that rejects that expression. > > Your parser can only be based on what you want the published grammar to > mean, not on what you actually published because, to the delight of fans > of irony, you have a syntax error (two in fact) in your syntax > specification. > I had a huge error in the prior one that Andre caught. It was only an error in the sense in that I was not saying what I meant. This was the YACC grammar that forms the basis of my augmentations. https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ As a first guess I would say that the two "errors" that you found are merely that you do not understand my intentions. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 20:44 +0100 |
| Message-ID | <87o8ln82x5.fsf@bsb.me.uk> |
| In reply to | #23680 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 5:42 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> I have a fully operational parser that rejects that expression. >> >> Your parser can only be based on what you want the published grammar to >> mean, not on what you actually published because, to the delight of fans >> of irony, you have a syntax error (two in fact) in your syntax >> specification. > > I had a huge error in the prior one that Andre caught. > It was only an error in the sense in that I was not saying what I meant. > > This was the YACC grammar that forms the basis of my augmentations. > https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ I am, of course, referring to what you published up thread -- the link to what you claim to be a corrected grammar -- the one for which you have "a fully operational parser that rejects that expression". > As a first guess I would say that the two "errors" that you found are > merely that you do not understand my intentions. Well, you would, wouldn't you? Despite much evidence from previous exchanges that it might pay to listen when I say something like this. Anyway, I am happy for these minor errors to remain in place. There is no reason for me to help you correct anything you put out into the world. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 14:55 -0500 |
| Message-ID | <YZednduY45dXf-nCnZ2dnUU7-KHNnZ2d@giganews.com> |
| In reply to | #23685 |
On 9/30/2020 2:44 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 5:42 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> I have a fully operational parser that rejects that expression. >>> >>> Your parser can only be based on what you want the published grammar to >>> mean, not on what you actually published because, to the delight of fans >>> of irony, you have a syntax error (two in fact) in your syntax >>> specification. >> >> I had a huge error in the prior one that Andre caught. >> It was only an error in the sense in that I was not saying what I meant. >> >> This was the YACC grammar that forms the basis of my augmentations. >> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ > > I am, of course, referring to what you published up thread -- the link > to what you claim to be a corrected grammar -- the one for which you > have "a fully operational parser that rejects that expression". > >> As a first guess I would say that the two "errors" that you found are >> merely that you do not understand my intentions. > > Well, you would, wouldn't you? Despite much evidence from previous > exchanges that it might pay to listen when I say something like this. > Anyway, I am happy for these minor errors to remain in place. There is > no reason for me to help you correct anything you put out into the > world. > As always you continue to make empty assertions of my mistakes. It could be the case that the above grammar is still incorrect. The fully operational grammar has some complexities that I manually simplified. These simpifactions could not be tested because I have to change the corresponding semantic actions. Even if the grammar is not yet perfect it does very effectively express the details of how meta-mathematics can itself be directly formalized. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-09-30 21:40 +0100 |
| Message-ID | <87v9fv6lrj.fsf@bsb.me.uk> |
| In reply to | #23687 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: <cut> >>> As a first guess I would say that the two "errors" that you found are >>> merely that you do not understand my intentions. >> >> Well, you would, wouldn't you? Despite much evidence from previous >> exchanges that it might pay to listen when I say something like this. >> Anyway, I am happy for these minor errors to remain in place. There is >> no reason for me to help you correct anything you put out into the >> world. > > As always you continue to make empty assertions of my mistakes. If you can't see the errors for yourself, just ask me for more details (a "please" would be welcome). But as I said, I am more than happy for them to remain uncorrected. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 17:48 -0500 |
| Message-ID | <UJOdnbZpF5jRlujCnZ2dnUU7-VmdnZ2d@giganews.com> |
| In reply to | #23692 |
On 9/30/2020 3:40 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: > <cut> >>>> As a first guess I would say that the two "errors" that you found are >>>> merely that you do not understand my intentions. >>> >>> Well, you would, wouldn't you? Despite much evidence from previous >>> exchanges that it might pay to listen when I say something like this. >>> Anyway, I am happy for these minor errors to remain in place. There is >>> no reason for me to help you correct anything you put out into the >>> world. >> >> As always you continue to make empty assertions of my mistakes. > > If you can't see the errors for yourself, just ask me for more details > (a "please" would be welcome). But as I said, I am more than happy for > them to remain uncorrected. > I have always been open to greater cooperation. Can you please point out the errors in my current grammar? https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-01 01:17 +0100 |
| Message-ID | <87pn627qap.fsf@bsb.me.uk> |
| In reply to | #23697 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2020 3:40 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >> <cut> >>>>> As a first guess I would say that the two "errors" that you found are >>>>> merely that you do not understand my intentions. >>>> >>>> Well, you would, wouldn't you? Despite much evidence from previous >>>> exchanges that it might pay to listen when I say something like this. >>>> Anyway, I am happy for these minor errors to remain in place. There is >>>> no reason for me to help you correct anything you put out into the >>>> world. >>> >>> As always you continue to make empty assertions of my mistakes. >> >> If you can't see the errors for yourself, just ask me for more details >> (a "please" would be welcome). But as I said, I am more than happy for >> them to remain uncorrected. > > I have always been open to greater cooperation. > Can you please point out the errors in my current grammar? > > https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF Certainly. You have swapped the ':' and '|' that follow "definition", and there is no ';' terminating the rule. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 19:33 -0500 |
| Message-ID | <t62dnadPi5JpvujCnZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #23699 |
On 9/30/2020 7:17 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2020 3:40 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>> <cut> >>>>>> As a first guess I would say that the two "errors" that you found are >>>>>> merely that you do not understand my intentions. >>>>> >>>>> Well, you would, wouldn't you? Despite much evidence from previous >>>>> exchanges that it might pay to listen when I say something like this. >>>>> Anyway, I am happy for these minor errors to remain in place. There is >>>>> no reason for me to help you correct anything you put out into the >>>>> world. >>>> >>>> As always you continue to make empty assertions of my mistakes. >>> >>> If you can't see the errors for yourself, just ask me for more details >>> (a "please" would be welcome). But as I said, I am more than happy for >>> them to remain uncorrected. >> >> I have always been open to greater cooperation. >> Can you please point out the errors in my current grammar? >> >> https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF > > Certainly. You have swapped the ':' and '|' that follow "definition", and > there is no ';' terminating the rule. > Ah that was great only punctuation errors. Thanks for the help. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-30 16:22 -0600 |
| Message-ID | <rl30fp$8ph$1@dont-email.me> |
| In reply to | #23687 |
On 2020-09-30 13:55, olcott wrote: > On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/30/2020 5:42 AM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> I have a fully operational parser that rejects that expression. >>>> >>>> Your parser can only be based on what you want the published grammar to >>>> mean, not on what you actually published because, to the delight of >>>> fans >>>> of irony, you have a syntax error (two in fact) in your syntax >>>> specification. >>> >>> I had a huge error in the prior one that Andre caught. >>> It was only an error in the sense in that I was not saying what I meant. >>> >>> This was the YACC grammar that forms the basis of my augmentations. >>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>> >> >> I am, of course, referring to what you published up thread -- the link >> to what you claim to be a corrected grammar -- the one for which you >> have "a fully operational parser that rejects that expression". >> >>> As a first guess I would say that the two "errors" that you found are >>> merely that you do not understand my intentions. >> >> Well, you would, wouldn't you? Despite much evidence from previous >> exchanges that it might pay to listen when I say something like this. >> Anyway, I am happy for these minor errors to remain in place. There is >> no reason for me to help you correct anything you put out into the >> world. >> > > As always you continue to make empty assertions of my mistakes. > It could be the case that the above grammar is still incorrect. > > The fully operational grammar has some complexities that I manually > simplified. These simpifactions could not be tested because I have to > change the corresponding semantic actions. Why would you do this? Maybe if you provided the complete, unsimplified grammar along with a description of these 'semantic actions' it would become more clear what you 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-30 17:51 -0500 |
| Message-ID | <UJOdnbFpF5hplujCnZ2dnUU7-VmdnZ2d@giganews.com> |
| In reply to | #23696 |
On 9/30/2020 5:22 PM, André G. Isaak wrote: > On 2020-09-30 13:55, olcott wrote: >> On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/30/2020 5:42 AM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> I have a fully operational parser that rejects that expression. >>>>> >>>>> Your parser can only be based on what you want the published >>>>> grammar to >>>>> mean, not on what you actually published because, to the delight of >>>>> fans >>>>> of irony, you have a syntax error (two in fact) in your syntax >>>>> specification. >>>> >>>> I had a huge error in the prior one that Andre caught. >>>> It was only an error in the sense in that I was not saying what I >>>> meant. >>>> >>>> This was the YACC grammar that forms the basis of my augmentations. >>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>>> >>> >>> I am, of course, referring to what you published up thread -- the link >>> to what you claim to be a corrected grammar -- the one for which you >>> have "a fully operational parser that rejects that expression". >>> >>>> As a first guess I would say that the two "errors" that you found are >>>> merely that you do not understand my intentions. >>> >>> Well, you would, wouldn't you? Despite much evidence from previous >>> exchanges that it might pay to listen when I say something like this. >>> Anyway, I am happy for these minor errors to remain in place. There is >>> no reason for me to help you correct anything you put out into the >>> world. >>> >> >> As always you continue to make empty assertions of my mistakes. >> It could be the case that the above grammar is still incorrect. >> >> The fully operational grammar has some complexities that I manually >> simplified. These simpifactions could not be tested because I have to >> change the corresponding semantic actions. > > Why would you do this? Maybe if you provided the complete, unsimplified > grammar along with a description of these 'semantic actions' it would > become more clear what you mean. > > André > > https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ Maybe you can start with the above FOL YACC grammar, MTT grammar is based on it. Although MTT is based on FOL grammar MTT specfies HOL. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-30 19:10 -0600 |
| Message-ID | <rl3ab4$qb9$1@dont-email.me> |
| In reply to | #23698 |
On 2020-09-30 16:51, olcott wrote: > On 9/30/2020 5:22 PM, André G. Isaak wrote: >> On 2020-09-30 13:55, olcott wrote: >>> On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/30/2020 5:42 AM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> I have a fully operational parser that rejects that expression. >>>>>> >>>>>> Your parser can only be based on what you want the published >>>>>> grammar to >>>>>> mean, not on what you actually published because, to the delight >>>>>> of fans >>>>>> of irony, you have a syntax error (two in fact) in your syntax >>>>>> specification. >>>>> >>>>> I had a huge error in the prior one that Andre caught. >>>>> It was only an error in the sense in that I was not saying what I >>>>> meant. >>>>> >>>>> This was the YACC grammar that forms the basis of my augmentations. >>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>>>> >>>> >>>> I am, of course, referring to what you published up thread -- the link >>>> to what you claim to be a corrected grammar -- the one for which you >>>> have "a fully operational parser that rejects that expression". >>>> >>>>> As a first guess I would say that the two "errors" that you found are >>>>> merely that you do not understand my intentions. >>>> >>>> Well, you would, wouldn't you? Despite much evidence from previous >>>> exchanges that it might pay to listen when I say something like this. >>>> Anyway, I am happy for these minor errors to remain in place. There is >>>> no reason for me to help you correct anything you put out into the >>>> world. >>>> >>> >>> As always you continue to make empty assertions of my mistakes. >>> It could be the case that the above grammar is still incorrect. >>> >>> The fully operational grammar has some complexities that I manually >>> simplified. These simpifactions could not be tested because I have to >>> change the corresponding semantic actions. >> >> Why would you do this? Maybe if you provided the complete, >> unsimplified grammar along with a description of these 'semantic >> actions' it would become more clear what you mean. >> >> André >> >> > > > https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ > > > Maybe you can start with the above FOL YACC grammar, MTT grammar is > based on it. Although MTT is based on FOL grammar MTT specfies HOL. How is looking at a FOL grammar by someone named Gene supposed to give me insight into the unsimplified version of your grammar? Or the 'semantic actions' to which you refer? And note that if your MTT grammar is based on this grammar (which it appears to be), then you are guilty of plagiarism since you do not credit gene in your paper. But here's a small note for you. The following is quoted from your article: Here it is encoded using first order logic syntax and the definition operator: (a) S1 := ∀x (Px ∨ ¬Px) (b) ∀P(S1) In what sense is (b) 'first order logic syntax'? If P is a predicate, then ∀P(...) is not valid first order logic. Your 'macro substitution' doesn't change this. And I'd *really* like to see the semantics you give to: | sentence PROVES sentence It's easy enough to put that into the syntax. The semantics is an entirely different matter. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 20:41 -0500 |
| Message-ID | <WbOdnWfp__csrujCnZ2dnUU7-LnNnZ2d@giganews.com> |
| In reply to | #23701 |
On 9/30/2020 8:10 PM, André G. Isaak wrote: > On 2020-09-30 16:51, olcott wrote: >> On 9/30/2020 5:22 PM, André G. Isaak wrote: >>> On 2020-09-30 13:55, olcott wrote: >>>> On 9/30/2020 2:44 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 9/30/2020 5:42 AM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> I have a fully operational parser that rejects that expression. >>>>>>> >>>>>>> Your parser can only be based on what you want the published >>>>>>> grammar to >>>>>>> mean, not on what you actually published because, to the delight >>>>>>> of fans >>>>>>> of irony, you have a syntax error (two in fact) in your syntax >>>>>>> specification. >>>>>> >>>>>> I had a huge error in the prior one that Andre caught. >>>>>> It was only an error in the sense in that I was not saying what I >>>>>> meant. >>>>>> >>>>>> This was the YACC grammar that forms the basis of my augmentations. >>>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>>>>> >>>>> >>>>> I am, of course, referring to what you published up thread -- the link >>>>> to what you claim to be a corrected grammar -- the one for which you >>>>> have "a fully operational parser that rejects that expression". >>>>> >>>>>> As a first guess I would say that the two "errors" that you found are >>>>>> merely that you do not understand my intentions. >>>>> >>>>> Well, you would, wouldn't you? Despite much evidence from previous >>>>> exchanges that it might pay to listen when I say something like this. >>>>> Anyway, I am happy for these minor errors to remain in place. >>>>> There is >>>>> no reason for me to help you correct anything you put out into the >>>>> world. >>>>> >>>> >>>> As always you continue to make empty assertions of my mistakes. >>>> It could be the case that the above grammar is still incorrect. >>>> >>>> The fully operational grammar has some complexities that I manually >>>> simplified. These simpifactions could not be tested because I have >>>> to change the corresponding semantic actions. >>> >>> Why would you do this? Maybe if you provided the complete, >>> unsimplified grammar along with a description of these 'semantic >>> actions' it would become more clear what you mean. >>> >>> André >>> >>> >> >> >> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >> >> >> Maybe you can start with the above FOL YACC grammar, MTT grammar is >> based on it. Although MTT is based on FOL grammar MTT specfies HOL. > > How is looking at a FOL grammar by someone named Gene supposed to give > me insight into the unsimplified version of your grammar? Or the > 'semantic actions' to which you refer? > This is the correct grammar for FOL from the comp.compilers moderated group. > And note that if your MTT grammar is based on this grammar (which it > appears to be), then you are guilty of plagiarism since you do not > credit gene in your paper. > It is the standard grammar specification for FOL. IT IS FIRST ORDER LOGIC. There is no copyright or patent on first order logic. > But here's a small note for you. The following is quoted from your article: > > Here it is encoded using first order logic syntax and the definition > operator: > (a) S1 := ∀x (Px ∨ ¬Px) > (b) ∀P(S1) > > In what sense is (b) 'first order logic syntax'? If P is a predicate, > then ∀P(...) is not valid first order logic. Your 'macro substitution' > doesn't change this. > HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? > And I'd *really* like to see the semantics you give to: > > | sentence PROVES sentence > > It's easy enough to put that into the syntax. The semantics is an > entirely different matter. > > André > It is an assertion that a proof exists. Natural_Number(N) asserts that N is a Natural_Number. ~Provable(F, G) asserts that G is not provable in F. ~(F ⊢ G) asserts that G is not provable in F. It took Gödel dozens and dozens of formulas to artificially contrive the same statement that G is not provable in F. More specifically his statement says: (G ⊬ F) ∧ (G ⊬ ¬F) http://www.liarparadox.org/G%C3%B6del_Sentence(1931).pdf Proposition VI: To every w-consistent recursive class c of formulae there correspond recursive class-signs r, such that neither v Gen r nor Neg (v Gen r) belongs to Flg (c) (where v is the free variable of r). -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-09-30 20:06 -0600 |
| Message-ID | <rl3diu$acf$1@dont-email.me> |
| In reply to | #23702 |
On 2020-09-30 19:41, olcott wrote: > On 9/30/2020 8:10 PM, André G. Isaak wrote: >> On 2020-09-30 16:51, olcott wrote: >>> On 9/30/2020 5:22 PM, André G. Isaak wrote: >>>> On 2020-09-30 13:55, olcott wrote: >>>>> The fully operational grammar has some complexities that I manually >>>>> simplified. These simpifactions could not be tested because I have >>>>> to change the corresponding semantic actions. >>>> >>>> Why would you do this? Maybe if you provided the complete, >>>> unsimplified grammar along with a description of these 'semantic >>>> actions' it would become more clear what you mean. >>>> >>>> André >>>> >>>> >>> >>> >>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>> >>> >>> Maybe you can start with the above FOL YACC grammar, MTT grammar is >>> based on it. Although MTT is based on FOL grammar MTT specfies HOL. >> >> How is looking at a FOL grammar by someone named Gene supposed to give >> me insight into the unsimplified version of your grammar? Or the >> 'semantic actions' to which you refer? >> > > This is the correct grammar for FOL from the comp.compilers moderated > group. > >> And note that if your MTT grammar is based on this grammar (which it >> appears to be), then you are guilty of plagiarism since you do not >> credit gene in your paper. >> > > It is the standard grammar specification for FOL. > IT IS FIRST ORDER LOGIC. > There is no copyright or patent on first order logic. No, but there might be on a particular bison implementation, and you appear to have based yours on this one. Plagiarism and copyright violation are entirely different things. Academic honesty demands you properly cite your sources regardless of whether they have copyrights or patents associated with them. And that doesn't address my question. How does giving me someone else's grammar of FOL explain what simplifications you made in your article or why you felt it was necessary to make them. Why not just post the unsimplified version? And what do you mean by 'semantic action'? >> But here's a small note for you. The following is quoted from your >> article: >> >> Here it is encoded using first order logic syntax and the definition >> operator: >> (a) S1 := ∀x (Px ∨ ¬Px) >> (b) ∀P(S1) >> >> In what sense is (b) 'first order logic syntax'? If P is a predicate, >> then ∀P(...) is not valid first order logic. Your 'macro substitution' >> doesn't change this. >> > > HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? > HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? > HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? > HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? > HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? You claim that your silly := allows you to express higher order logics using first order logic syntax. It does not. That was my point. >> And I'd *really* like to see the semantics you give to: >> >> | sentence PROVES sentence >> >> It's easy enough to put that into the syntax. The semantics is an >> entirely different matter. >> >> André >> > > It is an assertion that a proof exists. That isn't a semantics. I know what the symbol stands for. I want to know the semantics you actually assign to this given that your grammar incorporates this directly into the language rather than simply leaving it in the metalanguage. That means it needs to have its semantics specified as part of your MTT. How exactly do you do this? André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-09-30 21:37 -0500 |
| Message-ID | <A_adnXUWsddg3ejCnZ2dnUU7-f3NnZ2d@giganews.com> |
| In reply to | #23703 |
On 9/30/2020 9:06 PM, André G. Isaak wrote:
> On 2020-09-30 19:41, olcott wrote:
>> On 9/30/2020 8:10 PM, André G. Isaak wrote:
>>> On 2020-09-30 16:51, olcott wrote:
>>>> On 9/30/2020 5:22 PM, André G. Isaak wrote:
>>>>> On 2020-09-30 13:55, olcott wrote:
>
>>>>>> The fully operational grammar has some complexities that I
>>>>>> manually simplified. These simpifactions could not be tested
>>>>>> because I have to change the corresponding semantic actions.
>>>>>
>>>>> Why would you do this? Maybe if you provided the complete,
>>>>> unsimplified grammar along with a description of these 'semantic
>>>>> actions' it would become more clear what you mean.
>>>>>
>>>>> André
>>>>>
>>>>>
>>>>
>>>>
>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ
>>>>
>>>>
>>>> Maybe you can start with the above FOL YACC grammar, MTT grammar is
>>>> based on it. Although MTT is based on FOL grammar MTT specfies HOL.
>>>
>>> How is looking at a FOL grammar by someone named Gene supposed to
>>> give me insight into the unsimplified version of your grammar? Or the
>>> 'semantic actions' to which you refer?
>>>
>>
>> This is the correct grammar for FOL from the comp.compilers moderated
>> group.
>>
>>> And note that if your MTT grammar is based on this grammar (which it
>>> appears to be), then you are guilty of plagiarism since you do not
>>> credit gene in your paper.
>>>
>>
>> It is the standard grammar specification for FOL.
>> IT IS FIRST ORDER LOGIC.
>> There is no copyright or patent on first order logic.
>
> No, but there might be on a particular bison implementation, and you
> appear to have based yours on this one.
>
> Plagiarism and copyright violation are entirely different things.
> Academic honesty demands you properly cite your sources regardless of
> whether they have copyrights or patents associated with them.
>
https://www.analyzemath.com/algebra/rules_algebra.html
Since there is only one way to do it correctly the grammar of first
order logic is like the commutative property of addition common
knowledge in the public domain.
> And that doesn't address my question. How does giving me someone else's
> grammar of FOL
It is NOT any an individual's mere opinion it is the only correct way to
specifiy the grammar of first order logic.
> explain what simplifications you made in your article or
> why you felt it was necessary to make them. Why not just post the
> unsimplified version? And what do you mean by 'semantic action'?
If you start with the simpler grammar of first order logic and learn to
understand this completely then understandibg my grammar will be much
easier.
>
>>> But here's a small note for you. The following is quoted from your
>>> article:
>>>
>>> Here it is encoded using first order logic syntax and the definition
>>> operator:
>>> (a) S1 := ∀x (Px ∨ ¬Px)
>>> (b) ∀P(S1)
>>>
>>> In what sense is (b) 'first order logic syntax'? If P is a predicate,
>>> then ∀P(...) is not valid first order logic. Your 'macro
>>> substitution' doesn't change this.
>>>
>>
>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>
> You claim that your silly := allows you to express higher order logics
> using first order logic syntax. It does not. That was my point.
You are wrong. I already proved that am right. You can't simply ignore
this proof in your rebuttal.
∀P∀x (Px ∨ ¬Px) // second order logic
S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name
∀P(S1) // S1 to be macro expanded
The actual parse of the above two lines:
<translation_unit_1>
<definition_2 token="ASSIGN_ALIAS">
<definition_2 token="IDENTIFIER" value="S1"/>
<sentence_4 token="FOR_ALL">
<sentence_4 token="IDENTIFIER" value="P"/>
<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_4>
</definition_2>
<sentence_4 token="FOR_ALL">
<sentence_4 token="IDENTIFIER" value="P"/>
<atomic_sentence_2 token="IDENTIFIER" value="S1"/>
</sentence_4>
</translation_unit_1>
>>> And I'd *really* like to see the semantics you give to:
>>>
>>> | sentence PROVES sentence
>>>
>>> It's easy enough to put that into the syntax. The semantics is an
>>> entirely different matter.
>>>
>>> André
>>>
>>
>> It is an assertion that a proof exists.
>
> That isn't a semantics. I know what the symbol stands for. I want to
> know the semantics you actually assign to this given that your grammar
> incorporates this directly into the language rather than simply leaving
> it in the metalanguage. That means it needs to have its semantics
> specified as part of your MTT.
>
It is the same thing as saying Provable(X).
The semantics the decides whether or it is satisfied is beyond the scope
of investigation. The scope of this investigation (since 2004) has only
been the pathological self-reference cases where it cannot be satisfied.
People seem to have an emotional attachment to the opinion that things
such as the liar paradox are well formed.
You already admitted that the truth teller paradox is vacuous, why can't
you see that all expressions that only make assertions about their truth
value or provability are equally vacuous?
> How exactly do you do this?
>
> André
>
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-01 12:15 -0600 |
| Message-ID | <rl56bn$bl3$1@dont-email.me> |
| In reply to | #23704 |
On 2020-09-30 20:37, olcott wrote: > On 9/30/2020 9:06 PM, André G. Isaak wrote: >> On 2020-09-30 19:41, olcott wrote: >>> On 9/30/2020 8:10 PM, André G. Isaak wrote: >>>> On 2020-09-30 16:51, olcott wrote: >>>>> On 9/30/2020 5:22 PM, André G. Isaak wrote: >>>>>> On 2020-09-30 13:55, olcott wrote: >> >>>>>>> The fully operational grammar has some complexities that I >>>>>>> manually simplified. These simpifactions could not be tested >>>>>>> because I have to change the corresponding semantic actions. >>>>>> >>>>>> Why would you do this? Maybe if you provided the complete, >>>>>> unsimplified grammar along with a description of these 'semantic >>>>>> actions' it would become more clear what you mean. >>>>>> >>>>>> André >>>>>> >>>>>> >>>>> >>>>> >>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>>>> >>>>> >>>>> Maybe you can start with the above FOL YACC grammar, MTT grammar is >>>>> based on it. Although MTT is based on FOL grammar MTT specfies HOL. >>>> >>>> How is looking at a FOL grammar by someone named Gene supposed to >>>> give me insight into the unsimplified version of your grammar? Or >>>> the 'semantic actions' to which you refer? >>>> >>> >>> This is the correct grammar for FOL from the comp.compilers moderated >>> group. >>> >>>> And note that if your MTT grammar is based on this grammar (which it >>>> appears to be), then you are guilty of plagiarism since you do not >>>> credit gene in your paper. >>>> >>> >>> It is the standard grammar specification for FOL. >>> IT IS FIRST ORDER LOGIC. >>> There is no copyright or patent on first order logic. >> >> No, but there might be on a particular bison implementation, and you >> appear to have based yours on this one. >> >> Plagiarism and copyright violation are entirely different things. >> Academic honesty demands you properly cite your sources regardless of >> whether they have copyrights or patents associated with them. >> > > https://www.analyzemath.com/algebra/rules_algebra.html > > Since there is only one way to do it correctly the grammar of first > order logic is like the commutative property of addition common > knowledge in the public domain. > >> And that doesn't address my question. How does giving me someone >> else's grammar of FOL > > It is NOT any an individual's mere opinion it is the only correct way to > specifiy the grammar of first order logic. Even if we agree on WHICH first order logic we are discussing (FOL is a class of logics, not a single thing), there are still multiple different ways in which the grammar of that language could implemented in bison. You appear to have based your MTT on one specific bison implementation by someone named 'gene' but have not credited him for it. That is plagiarism. >> explain what simplifications you made in your article or why you felt >> it was necessary to make them. Why not just post the unsimplified >> version? And what do you mean by 'semantic action'? > > If you start with the simpler grammar of first order logic and learn to > understand this completely then understandibg my grammar will be much > easier. I already understand the grammar of first order logics and how bison works. It is your 'unsimplified' grammar that I am asking about. Why keep it secret? >> >>>> But here's a small note for you. The following is quoted from your >>>> article: >>>> >>>> Here it is encoded using first order logic syntax and the definition >>>> operator: >>>> (a) S1 := ∀x (Px ∨ ¬Px) >>>> (b) ∀P(S1) >>>> >>>> In what sense is (b) 'first order logic syntax'? If P is a >>>> predicate, then ∀P(...) is not valid first order logic. Your 'macro >>>> substitution' doesn't change this. >>>> >>> >>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >> >> You claim that your silly := allows you to express higher order logics >> using first order logic syntax. It does not. That was my point. > > You are wrong. I already proved that am right. You can't simply ignore > this proof in your rebuttal. > > ∀P∀x (Px ∨ ¬Px) // second order logic > > S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name > ∀P(S1) // S1 to be macro expanded So where do you have higher order logic expressed in FOL syntax above? You do not. <snip irreleventia> >>>> And I'd *really* like to see the semantics you give to: >>>> >>>> | sentence PROVES sentence >>>> >>>> It's easy enough to put that into the syntax. The semantics is an >>>> entirely different matter. >>>> >>>> André >>>> >>> >>> It is an assertion that a proof exists. >> >> That isn't a semantics. I know what the symbol stands for. I want to >> know the semantics you actually assign to this given that your grammar >> incorporates this directly into the language rather than simply >> leaving it in the metalanguage. That means it needs to have its >> semantics specified as part of your MTT. >> > > It is the same thing as saying Provable(X). Wow! That certainly clarifies things! Naming a predicate and defining one are not the same things. You have a habit of inventing new names for predicates without defining them, as if somehow giving them a name was sufficient. > The semantics the decides whether or it is satisfied is beyond the scope > of investigation. It can't be since your entire argument rests on provability. If you don't explain what you mean by this, then your MTT can't be used to say anything whatsoever about provability. The scope of this investigation (since 2004) has only > been the pathological self-reference cases where it cannot be satisfied. > > People seem to have an emotional attachment to the opinion that things > such as the liar paradox are well formed. > > You already admitted that the truth teller paradox is vacuous, why can't > you see that all expressions that only make assertions about their truth > value or provability are equally vacuous? Vacuous and ill-formed are entirely different concepts. The sentence 'this sentence is true' may be vacuous, but there is nothing 'ill-formed' about it. It is simply an undecidable sentence. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-01 14:34 -0500 |
| Message-ID | <mfCdnXtteszMsuvCnZ2dnUU7-LvNnZ2d@giganews.com> |
| In reply to | #23705 |
On 10/1/2020 1:15 PM, André G. Isaak wrote: > On 2020-09-30 20:37, olcott wrote: >> On 9/30/2020 9:06 PM, André G. Isaak wrote: >>> On 2020-09-30 19:41, olcott wrote: >>>> On 9/30/2020 8:10 PM, André G. Isaak wrote: >>>>> On 2020-09-30 16:51, olcott wrote: >>>>>> On 9/30/2020 5:22 PM, André G. Isaak wrote: >>>>>>> On 2020-09-30 13:55, olcott wrote: >>> >>>>>>>> The fully operational grammar has some complexities that I >>>>>>>> manually simplified. These simpifactions could not be tested >>>>>>>> because I have to change the corresponding semantic actions. >>>>>>> >>>>>>> Why would you do this? Maybe if you provided the complete, >>>>>>> unsimplified grammar along with a description of these 'semantic >>>>>>> actions' it would become more clear what you mean. >>>>>>> >>>>>>> André >>>>>>> >>>>>>> >>>>>> >>>>>> >>>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>>>>> >>>>>> >>>>>> Maybe you can start with the above FOL YACC grammar, MTT grammar >>>>>> is based on it. Although MTT is based on FOL grammar MTT specfies >>>>>> HOL. >>>>> >>>>> How is looking at a FOL grammar by someone named Gene supposed to >>>>> give me insight into the unsimplified version of your grammar? Or >>>>> the 'semantic actions' to which you refer? >>>>> >>>> >>>> This is the correct grammar for FOL from the comp.compilers >>>> moderated group. >>>> >>>>> And note that if your MTT grammar is based on this grammar (which >>>>> it appears to be), then you are guilty of plagiarism since you do >>>>> not credit gene in your paper. >>>>> >>>> >>>> It is the standard grammar specification for FOL. >>>> IT IS FIRST ORDER LOGIC. >>>> There is no copyright or patent on first order logic. >>> >>> No, but there might be on a particular bison implementation, and you >>> appear to have based yours on this one. >>> >>> Plagiarism and copyright violation are entirely different things. >>> Academic honesty demands you properly cite your sources regardless of >>> whether they have copyrights or patents associated with them. >>> >> >> https://www.analyzemath.com/algebra/rules_algebra.html >> >> Since there is only one way to do it correctly the grammar of first >> order logic is like the commutative property of addition common >> knowledge in the public domain. >> >>> And that doesn't address my question. How does giving me someone >>> else's grammar of FOL >> >> It is NOT any an individual's mere opinion it is the only correct way >> to specifiy the grammar of first order logic. > > Even if we agree on WHICH first order logic we are discussing (FOL is a > class of logics, not a single thing), there are still multiple different > ways in which the grammar of that language could implemented in bison. > You appear to have based your MTT on one specific bison implementation > by someone named 'gene' but have not credited him for it. That is > plagiarism. > Every other grammar specification for FOL that I found is identical. I don't know how anyone could write it any other way and still be correct. I can always add a reference to the link. >>> explain what simplifications you made in your article or why you felt >>> it was necessary to make them. Why not just post the unsimplified >>> version? And what do you mean by 'semantic action'? >> >> If you start with the simpler grammar of first order logic and learn >> to understand this completely then understandibg my grammar will be >> much easier. > > I already understand the grammar of first order logics and how bison > works. It is your 'unsimplified' grammar that I am asking about. Why > keep it secret? > My unsimplified grammar merely has several redundancies to account for the limited look-ahead of YACC. Since I had to write the parser actions myself I might be able to rewrite them to create a parse tree without the redundancies. >>> >>>>> But here's a small note for you. The following is quoted from your >>>>> article: >>>>> >>>>> Here it is encoded using first order logic syntax and the >>>>> definition operator: >>>>> (a) S1 := ∀x (Px ∨ ¬Px) >>>>> (b) ∀P(S1) >>>>> >>>>> In what sense is (b) 'first order logic syntax'? If P is a >>>>> predicate, then ∀P(...) is not valid first order logic. Your 'macro >>>>> substitution' doesn't change this. >>>>> >>>> >>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>> >>> You claim that your silly := allows you to express higher order >>> logics using first order logic syntax. It does not. That was my point. >> >> You are wrong. I already proved that am right. You can't simply ignore >> this proof in your rebuttal. >> >> ∀P∀x (Px ∨ ¬Px) // second order logic >> >> S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name >> ∀P(S1) // S1 to be macro expanded > > So where do you have higher order logic expressed in FOL syntax above? > You do not. > // first order logic expression assigned to name (a) S1 := ∀x (P(x) ∨ ¬P(x)) // S1 to be macro expanded (b) ∀P(S1) As soon as expression (b) is macro expanded it becomes the second order logic expression: ∀P(∀x(P(x) ∨ ¬P(x))) I honestly don't see why you are having such a difficult time with this. > <snip irreleventia> > >>>>> And I'd *really* like to see the semantics you give to: >>>>> >>>>> | sentence PROVES sentence >>>>> >>>>> It's easy enough to put that into the syntax. The semantics is an >>>>> entirely different matter. >>>>> >>>>> André >>>>> >>>> >>>> It is an assertion that a proof exists. >>> >>> That isn't a semantics. I know what the symbol stands for. I want to >>> know the semantics you actually assign to this given that your >>> grammar incorporates this directly into the language rather than >>> simply leaving it in the metalanguage. That means it needs to have >>> its semantics specified as part of your MTT. >>> >> >> It is the same thing as saying Provable(X). > > Wow! That certainly clarifies things! Naming a predicate and defining > one are not the same things. You have a habit of inventing new names for > predicates without defining them, as if somehow giving them a name was > sufficient. > >> The semantics the decides whether or it is satisfied is beyond the >> scope of investigation. > > It can't be since your entire argument rests on provability. If you > don't explain what you mean by this, then your MTT can't be used to say > anything whatsoever about provability. > The first page answers this question: https://www.researchgate.net/publication/332864362_Deductively_Sound_Formal_Proofs > The scope of this investigation (since 2004) has only >> been the pathological self-reference cases where it cannot be satisfied. >> >> People seem to have an emotional attachment to the opinion that things >> such as the liar paradox are well formed. >> >> You already admitted that the truth teller paradox is vacuous, why >> can't you see that all expressions that only make assertions about >> their truth value or provability are equally vacuous? > > Vacuous and ill-formed are entirely different concepts. The sentence Not really not at all. An expression of language that has a vacuous truth value is ill-formed because it has a vacuous truth value. "vacuous truth value" is a type of ill-formed propostion. > 'this sentence is true' may be vacuous, but there is nothing > 'ill-formed' about it. It is simply an undecidable sentence. > > André > I really really hate it when terms-of-the-art override and supersede the conventional meaning of terms so that the term-of-the art can sneak logical incoherence into the analysis and simply write-off this logical incoherence as a stipulated definition. If we use the same reasoning as used in mathematics then I can cay the the question: What time is it (yes or no)? is simply undecidable and not an ill-formed question. It is a perfectly valid question and has a perfectly valid answer, it is merely human limitations that prevent the correct answer from being provided. The human system of reasoning is incomplete because humans cannot provide the correct (yes or no) answer to the question: What time is it? -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-01 14:32 -0600 |
| Message-ID | <rl5edp$1tc$1@dont-email.me> |
| In reply to | #23706 |
On 2020-10-01 13:34, olcott wrote: > On 10/1/2020 1:15 PM, André G. Isaak wrote: >> On 2020-09-30 20:37, olcott wrote: >>> On 9/30/2020 9:06 PM, André G. Isaak wrote: >>>> On 2020-09-30 19:41, olcott wrote: >>>>> On 9/30/2020 8:10 PM, André G. Isaak wrote: >>>>>> On 2020-09-30 16:51, olcott wrote: >>>>>>> On 9/30/2020 5:22 PM, André G. Isaak wrote: >>>>>>>> On 2020-09-30 13:55, olcott wrote: >>>> >>>>>>>>> The fully operational grammar has some complexities that I >>>>>>>>> manually simplified. These simpifactions could not be tested >>>>>>>>> because I have to change the corresponding semantic actions. >>>>>>>> >>>>>>>> Why would you do this? Maybe if you provided the complete, >>>>>>>> unsimplified grammar along with a description of these 'semantic >>>>>>>> actions' it would become more clear what you mean. >>>>>>>> >>>>>>>> André >>>>>>>> >>>>>>>> >>>>>>> >>>>>>> >>>>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ >>>>>>> >>>>>>> >>>>>>> Maybe you can start with the above FOL YACC grammar, MTT grammar >>>>>>> is based on it. Although MTT is based on FOL grammar MTT specfies >>>>>>> HOL. >>>>>> >>>>>> How is looking at a FOL grammar by someone named Gene supposed to >>>>>> give me insight into the unsimplified version of your grammar? Or >>>>>> the 'semantic actions' to which you refer? >>>>>> >>>>> >>>>> This is the correct grammar for FOL from the comp.compilers >>>>> moderated group. >>>>> >>>>>> And note that if your MTT grammar is based on this grammar (which >>>>>> it appears to be), then you are guilty of plagiarism since you do >>>>>> not credit gene in your paper. >>>>>> >>>>> >>>>> It is the standard grammar specification for FOL. >>>>> IT IS FIRST ORDER LOGIC. >>>>> There is no copyright or patent on first order logic. >>>> >>>> No, but there might be on a particular bison implementation, and you >>>> appear to have based yours on this one. >>>> >>>> Plagiarism and copyright violation are entirely different things. >>>> Academic honesty demands you properly cite your sources regardless >>>> of whether they have copyrights or patents associated with them. >>>> >>> >>> https://www.analyzemath.com/algebra/rules_algebra.html >>> >>> Since there is only one way to do it correctly the grammar of first >>> order logic is like the commutative property of addition common >>> knowledge in the public domain. >>> >>>> And that doesn't address my question. How does giving me someone >>>> else's grammar of FOL >>> >>> It is NOT any an individual's mere opinion it is the only correct way >>> to specifiy the grammar of first order logic. >> >> Even if we agree on WHICH first order logic we are discussing (FOL is >> a class of logics, not a single thing), there are still multiple >> different ways in which the grammar of that language could implemented >> in bison. You appear to have based your MTT on one specific bison >> implementation by someone named 'gene' but have not credited him for >> it. That is plagiarism. >> > > Every other grammar specification for FOL that I found is identical. I > don't know how anyone could write it any other way and still be correct. > I can always add a reference to the link. Well, trivially one could have chosen different names, e.g. BICONDITIONAL rather than IFF. One could also have grouped ∨, →, etc. into a group called INFIX, and so forth. The point is, it is fairly apparent that you have used this as a starting point but have failed to acknowledge this point. >>>> explain what simplifications you made in your article or why you >>>> felt it was necessary to make them. Why not just post the >>>> unsimplified version? And what do you mean by 'semantic action'? >>> >>> If you start with the simpler grammar of first order logic and learn >>> to understand this completely then understandibg my grammar will be >>> much easier. >> >> I already understand the grammar of first order logics and how bison >> works. It is your 'unsimplified' grammar that I am asking about. Why >> keep it secret? >> > > My unsimplified grammar merely has several redundancies to account for > the limited look-ahead of YACC. Since I had to write the parser actions > myself I might be able to rewrite them to create a parse tree without > the redundancies. And I was asking you specifically about those actions (which you previously called 'semantic actions'. But instead you direct me to someone else's FOL grammar. >>>> >>>>>> But here's a small note for you. The following is quoted from your >>>>>> article: >>>>>> >>>>>> Here it is encoded using first order logic syntax and the >>>>>> definition operator: >>>>>> (a) S1 := ∀x (Px ∨ ¬Px) >>>>>> (b) ∀P(S1) >>>>>> >>>>>> In what sense is (b) 'first order logic syntax'? If P is a >>>>>> predicate, then ∀P(...) is not valid first order logic. Your >>>>>> 'macro substitution' doesn't change this. >>>>>> >>>>> >>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC? >>>> >>>> You claim that your silly := allows you to express higher order >>>> logics using first order logic syntax. It does not. That was my point. >>> >>> You are wrong. I already proved that am right. You can't simply >>> ignore this proof in your rebuttal. >>> >>> ∀P∀x (Px ∨ ¬Px) // second order logic >>> >>> S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name >>> ∀P(S1) // S1 to be macro expanded >> >> So where do you have higher order logic expressed in FOL syntax above? >> You do not. >> > > // first order logic expression assigned to name > (a) S1 := ∀x (P(x) ∨ ¬P(x)) > > // S1 to be macro expanded > (b) ∀P(S1) > > As soon as expression (b) is macro expanded it becomes the second order > logic expression: ∀P(∀x(P(x) ∨ ¬P(x))) Even before expansion, though, it isn't FOL, nor does it follow the syntax of FOL. Nowhere do you have an expression of second order logic expressed using first order syntax. And if := is really the same as macro expansion then what it looks before expansion isn't even relevant. > I honestly don't see why you are having such a difficult time with this. Nor I why you are having such a time. If you figure this out, though, it might help you see why taking someone else's syntax for FOL and and adding a few things isn't going to work if you actually want to express HOL. There is a major flaw with your grammar as it stands if you purport that it can be used for HOL. >> <snip irreleventia> >> >>>>>> And I'd *really* like to see the semantics you give to: >>>>>> >>>>>> | sentence PROVES sentence >>>>>> >>>>>> It's easy enough to put that into the syntax. The semantics is an >>>>>> entirely different matter. >>>>>> >>>>>> André >>>>>> >>>>> >>>>> It is an assertion that a proof exists. >>>> >>>> That isn't a semantics. I know what the symbol stands for. I want to >>>> know the semantics you actually assign to this given that your >>>> grammar incorporates this directly into the language rather than >>>> simply leaving it in the metalanguage. That means it needs to have >>>> its semantics specified as part of your MTT. >>>> >>> >>> It is the same thing as saying Provable(X). >> >> Wow! That certainly clarifies things! Naming a predicate and defining >> one are not the same things. You have a habit of inventing new names >> for predicates without defining them, as if somehow giving them a name >> was sufficient. >> >>> The semantics the decides whether or it is satisfied is beyond the >>> scope of investigation. >> >> It can't be since your entire argument rests on provability. If you >> don't explain what you mean by this, then your MTT can't be used to >> say anything whatsoever about provability. >> > > The first page answers this question: > https://www.researchgate.net/publication/332864362_Deductively_Sound_Formal_Proofs No it doesn't. The definitions you give there don't rise to the level of a formal semantics. > >> The scope of this investigation (since 2004) has only >>> been the pathological self-reference cases where it cannot be satisfied. >>> >>> People seem to have an emotional attachment to the opinion that >>> things such as the liar paradox are well formed. >>> >>> You already admitted that the truth teller paradox is vacuous, why >>> can't you see that all expressions that only make assertions about >>> their truth value or provability are equally vacuous? >> >> Vacuous and ill-formed are entirely different concepts. The sentence > > Not really not at all. An expression of language that has a vacuous > truth value is ill-formed because it has a vacuous truth value. Your use of 'ill-formed' doesn't correspond to the usage of anyone else. Normally, ill-formed means not conforming to the grammar, and thus not part of the language. > "vacuous truth value" is a type of ill-formed propostion. >> 'this sentence is true' may be vacuous, but there is nothing >> 'ill-formed' about it. It is simply an undecidable sentence. >> >> André >> > > I really really hate it when terms-of-the-art override and supersede the > conventional meaning of terms so that the term-of-the art can sneak > logical incoherence into the analysis and simply write-off this logical > incoherence as a stipulated definition. What you hate is having to actually learn what terms mean. There is no concept of 'vacuous truth' defined as a term of art for logics because such things occur in natural language, not in logic. If you want to talk about natural language, you are free to use this term if you wish, but it doesn't apply to any construction used in standard logic. > If we use the same reasoning as used in mathematics then I can cay the > the question: What time is it (yes or no)? is simply undecidable and not > an ill-formed question. > > It is a perfectly valid question and has a perfectly valid answer, it is > merely human limitations that prevent the correct answer from being > provided. The human system of reasoning is incomplete because humans > cannot provide the correct (yes or no) answer to the question: > What time is it? There are no interrogative expressions in logic so the above is entirely irrelevant. And 'decidable', if applied to natural language, would be applied to declarative sentences only. So the above is entirely irrelevant to natural language as well. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-01 16:29 -0500 |
| Message-ID | <DeedndQgDbjW1-vCnZ2dnUU7-fnNnZ2d@giganews.com> |
| In reply to | #23707 |
On 10/1/2020 3:32 PM, André G. Isaak wrote:
> On 2020-10-01 13:34, olcott wrote:
>> On 10/1/2020 1:15 PM, André G. Isaak wrote:
>>> On 2020-09-30 20:37, olcott wrote:
>>>> On 9/30/2020 9:06 PM, André G. Isaak wrote:
>>>>> On 2020-09-30 19:41, olcott wrote:
>>>>>> On 9/30/2020 8:10 PM, André G. Isaak wrote:
>>>>>>> On 2020-09-30 16:51, olcott wrote:
>>>>>>>> On 9/30/2020 5:22 PM, André G. Isaak wrote:
>>>>>>>>> On 2020-09-30 13:55, olcott wrote:
>>>>>
>>>>>>>>>> The fully operational grammar has some complexities that I
>>>>>>>>>> manually simplified. These simpifactions could not be tested
>>>>>>>>>> because I have to change the corresponding semantic actions.
>>>>>>>>>
>>>>>>>>> Why would you do this? Maybe if you provided the complete,
>>>>>>>>> unsimplified grammar along with a description of these
>>>>>>>>> 'semantic actions' it would become more clear what you mean.
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ
>>>>>>>>
>>>>>>>>
>>>>>>>> Maybe you can start with the above FOL YACC grammar, MTT grammar
>>>>>>>> is based on it. Although MTT is based on FOL grammar MTT
>>>>>>>> specfies HOL.
>>>>>>>
>>>>>>> How is looking at a FOL grammar by someone named Gene supposed to
>>>>>>> give me insight into the unsimplified version of your grammar? Or
>>>>>>> the 'semantic actions' to which you refer?
>>>>>>>
>>>>>>
>>>>>> This is the correct grammar for FOL from the comp.compilers
>>>>>> moderated group.
>>>>>>
>>>>>>> And note that if your MTT grammar is based on this grammar (which
>>>>>>> it appears to be), then you are guilty of plagiarism since you do
>>>>>>> not credit gene in your paper.
>>>>>>>
>>>>>>
>>>>>> It is the standard grammar specification for FOL.
>>>>>> IT IS FIRST ORDER LOGIC.
>>>>>> There is no copyright or patent on first order logic.
>>>>>
>>>>> No, but there might be on a particular bison implementation, and
>>>>> you appear to have based yours on this one.
>>>>>
>>>>> Plagiarism and copyright violation are entirely different things.
>>>>> Academic honesty demands you properly cite your sources regardless
>>>>> of whether they have copyrights or patents associated with them.
>>>>>
>>>>
>>>> https://www.analyzemath.com/algebra/rules_algebra.html
>>>>
>>>> Since there is only one way to do it correctly the grammar of first
>>>> order logic is like the commutative property of addition common
>>>> knowledge in the public domain.
>>>>
>>>>> And that doesn't address my question. How does giving me someone
>>>>> else's grammar of FOL
>>>>
>>>> It is NOT any an individual's mere opinion it is the only correct
>>>> way to specifiy the grammar of first order logic.
>>>
>>> Even if we agree on WHICH first order logic we are discussing (FOL is
>>> a class of logics, not a single thing), there are still multiple
>>> different ways in which the grammar of that language could
>>> implemented in bison. You appear to have based your MTT on one
>>> specific bison implementation by someone named 'gene' but have not
>>> credited him for it. That is plagiarism.
>>>
>>
>> Every other grammar specification for FOL that I found is identical. I
>> don't know how anyone could write it any other way and still be correct.
>> I can always add a reference to the link.
>
> Well, trivially one could have chosen different names, e.g.
> BICONDITIONAL rather than IFF. One could also have grouped ∨, →, etc.
> into a group called INFIX, and so forth. The point is, it is fairly
> apparent that you have used this as a starting point but have failed to
> acknowledge this point.
>
Okay you convinced me. I updated my paper to give Gene credit.
>>>>> explain what simplifications you made in your article or why you
>>>>> felt it was necessary to make them. Why not just post the
>>>>> unsimplified version? And what do you mean by 'semantic action'?
>>>>
>>>> If you start with the simpler grammar of first order logic and learn
>>>> to understand this completely then understandibg my grammar will be
>>>> much easier.
>>>
>>> I already understand the grammar of first order logics and how bison
>>> works. It is your 'unsimplified' grammar that I am asking about. Why
>>> keep it secret?
>>>
>>
>> My unsimplified grammar merely has several redundancies to account for
>> the limited look-ahead of YACC. Since I had to write the parser
>> actions myself I might be able to rewrite them to create a parse tree
>> without the redundancies.
>
> And I was asking you specifically about those actions (which you
> previously called 'semantic actions'. But instead you direct me to
> someone else's FOL grammar.
Semantic actions is merely a YACC term for building a Parse tree.
It really clutters up trying to understand the grammar.
| FOR_ALL IDENTIFIER SUBSET_OF IDENTIFIER sentence
{
AST.createTreeNode(yyn, IDENTIFIER, $4);
AST.createTreeNode(yyn, IDENTIFIER, $2);
AST.createTreeNodeAndAppendChildren(2, yyn, SUBSET_OF);
AST.createTreeNodeAndAppendChildren(2, yyn, FOR_ALL);
}
>
>>>>>
>>>>>>> But here's a small note for you. The following is quoted from
>>>>>>> your article:
>>>>>>>
>>>>>>> Here it is encoded using first order logic syntax and the
>>>>>>> definition operator:
>>>>>>> (a) S1 := ∀x (Px ∨ ¬Px)
>>>>>>> (b) ∀P(S1)
>>>>>>>
>>>>>>> In what sense is (b) 'first order logic syntax'? If P is a
>>>>>>> predicate, then ∀P(...) is not valid first order logic. Your
>>>>>>> 'macro substitution' doesn't change this.
>>>>>>>
>>>>>>
>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>
>>>>> You claim that your silly := allows you to express higher order
>>>>> logics using first order logic syntax. It does not. That was my point.
>>>>
>>>> You are wrong. I already proved that am right. You can't simply
>>>> ignore this proof in your rebuttal.
>>>>
>>>> ∀P∀x (Px ∨ ¬Px) // second order logic
>>>>
>>>> S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name
>>>> ∀P(S1) // S1 to be macro expanded
>>>
>>> So where do you have higher order logic expressed in FOL syntax
>>> above? You do not.
>>>
>>
>> // first order logic expression assigned to name
>> (a) S1 := ∀x (P(x) ∨ ¬P(x))
>>
>> // S1 to be macro expanded
>> (b) ∀P(S1)
>>
>> As soon as expression (b) is macro expanded it becomes the second
>> order logic expression: ∀P(∀x(P(x) ∨ ¬P(x)))
>
> Even before expansion, though, it isn't FOL, nor does it follow the
> syntax of FOL.
> Nowhere do you have an expression of second order logic
> expressed using first order syntax.
We only used FOL syntax: ∀x (P(x) ∨ ¬P(x))
and the three aspects of the definition operator
definition
S1 := ∀x (P(x) ∨ ¬P(x))
linking levels of logic
∀P(S1)
expansion
∀x (P(x) ∨ ¬P(x))
> And if := is really the same as
> macro expansion then what it looks before expansion isn't even relevant.
>
It the same way that structured programming breaks otherwise enormously
complex problems down in conceptual units that do not exceed the
capacity of the human mind, MTT breaks levels of logic down into their
simpler constituents.
>> I honestly don't see why you are having such a difficult time with this.
>
> Nor I why you are having such a time. If you figure this out, though, it
> might help you see why taking someone else's syntax for FOL and and
> adding a few things isn't going to work if you actually want to express
> HOL. There is a major flaw with your grammar as it stands if you purport
> that it can be used for HOL.
Anyone can make an empty assertion such as this.
>
>>> <snip irreleventia>
>>>
>>>>>>> And I'd *really* like to see the semantics you give to:
>>>>>>>
>>>>>>> | sentence PROVES sentence
>>>>>>>
>>>>>>> It's easy enough to put that into the syntax. The semantics is an
>>>>>>> entirely different matter.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> It is an assertion that a proof exists.
>>>>>
>>>>> That isn't a semantics. I know what the symbol stands for. I want
>>>>> to know the semantics you actually assign to this given that your
>>>>> grammar incorporates this directly into the language rather than
>>>>> simply leaving it in the metalanguage. That means it needs to have
>>>>> its semantics specified as part of your MTT.
>>>>>
>>>>
>>>> It is the same thing as saying Provable(X).
>>>
>>> Wow! That certainly clarifies things! Naming a predicate and defining
>>> one are not the same things. You have a habit of inventing new names
>>> for predicates without defining them, as if somehow giving them a
>>> name was sufficient.
>>>
>>>> The semantics the decides whether or it is satisfied is beyond the
>>>> scope of investigation.
>>>
>>> It can't be since your entire argument rests on provability. If you
>>> don't explain what you mean by this, then your MTT can't be used to
>>> say anything whatsoever about provability.
>>>
>>
>> The first page answers this question:
>> https://www.researchgate.net/publication/332864362_Deductively_Sound_Formal_Proofs
>
>
> No it doesn't. The definitions you give there don't rise to the level of
> a formal semantics.
On what basis have you concluded that Mendelson is an idiot?
>
>>
>>> The scope of this investigation (since 2004) has only
>>>> been the pathological self-reference cases where it cannot be
>>>> satisfied.
>>>>
>>>> People seem to have an emotional attachment to the opinion that
>>>> things such as the liar paradox are well formed.
>>>>
>>>> You already admitted that the truth teller paradox is vacuous, why
>>>> can't you see that all expressions that only make assertions about
>>>> their truth value or provability are equally vacuous?
>>>
>>> Vacuous and ill-formed are entirely different concepts. The sentence
>>
>> Not really not at all. An expression of language that has a vacuous
>> truth value is ill-formed because it has a vacuous truth value.
>
> Your use of 'ill-formed' doesn't correspond to the usage of anyone else.
> Normally, ill-formed means not conforming to the grammar, and thus not
> part of the language.
>
Infinite expressions are not part of any grammar.
>> "vacuous truth value" is a type of ill-formed propostion.
>
>>> 'this sentence is true' may be vacuous, but there is nothing
>>> 'ill-formed' about it. It is simply an undecidable sentence.
>>>
>>> André
>>>
>>
>> I really really hate it when terms-of-the-art override and supersede
>> the conventional meaning of terms so that the term-of-the art can
>> sneak logical incoherence into the analysis and simply write-off this
>> logical incoherence as a stipulated definition.
>
> What you hate is having to actually learn what terms mean.
They simply brush aside logical incoherence as a stipulated definition.
The correct way to do this rejects logical incoherence and does not
simply stipulate that logical incoherence is not incoherent.
> There is no concept of 'vacuous truth' defined as a term of art for
> logics because such things occur in natural language, not in logic.
It occurs in logic yet has been defined to not exist.
>If
> you want to talk about natural language, you are free to use this term
> if you wish, but it doesn't apply to any construction used in standard
> logic.
>
Only because standard logic has intentionally been specified to make
this error invisble.
>> If we use the same reasoning as used in mathematics then I can cay the
>> the question: What time is it (yes or no)? is simply undecidable and
>> not an ill-formed question.
>>
>> It is a perfectly valid question and has a perfectly valid answer, it
>> is merely human limitations that prevent the correct answer from being
>> provided. The human system of reasoning is incomplete because humans
>> cannot provide the correct (yes or no) answer to the question:
>> What time is it?
>
> There are no interrogative expressions in logic so the above is entirely
> irrelevant. And 'decidable', if applied to natural language, would be
> applied to declarative sentences only. So the above is entirely
> irrelevant to natural language as well.
>
> André
>
"This sentence is not true" is therefore decidable.
Try and show how it or its negation is satisfied.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-03 11:11 -0500 |
| Message-ID | <P-KdnVrlAJQ4P-XCnZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #23708 |
On 10/1/2020 4:29 PM, olcott wrote:
> On 10/1/2020 3:32 PM, André G. Isaak wrote:
>> On 2020-10-01 13:34, olcott wrote:
>>> On 10/1/2020 1:15 PM, André G. Isaak wrote:
>>>> On 2020-09-30 20:37, olcott wrote:
>>>>> On 9/30/2020 9:06 PM, André G. Isaak wrote:
>>>>>> On 2020-09-30 19:41, olcott wrote:
>>>>>>> On 9/30/2020 8:10 PM, André G. Isaak wrote:
>>>>>>>> On 2020-09-30 16:51, olcott wrote:
>>>>>>>>> On 9/30/2020 5:22 PM, André G. Isaak wrote:
>>>>>>>>>> On 2020-09-30 13:55, olcott wrote:
>>>>>>
>>>>>>>>>>> The fully operational grammar has some complexities that I
>>>>>>>>>>> manually simplified. These simpifactions could not be tested
>>>>>>>>>>> because I have to change the corresponding semantic actions.
>>>>>>>>>>
>>>>>>>>>> Why would you do this? Maybe if you provided the complete,
>>>>>>>>>> unsimplified grammar along with a description of these
>>>>>>>>>> 'semantic actions' it would become more clear what you mean.
>>>>>>>>>>
>>>>>>>>>> André
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Maybe you can start with the above FOL YACC grammar, MTT
>>>>>>>>> grammar is based on it. Although MTT is based on FOL grammar
>>>>>>>>> MTT specfies HOL.
>>>>>>>>
>>>>>>>> How is looking at a FOL grammar by someone named Gene supposed
>>>>>>>> to give me insight into the unsimplified version of your
>>>>>>>> grammar? Or the 'semantic actions' to which you refer?
>>>>>>>>
>>>>>>>
>>>>>>> This is the correct grammar for FOL from the comp.compilers
>>>>>>> moderated group.
>>>>>>>
>>>>>>>> And note that if your MTT grammar is based on this grammar
>>>>>>>> (which it appears to be), then you are guilty of plagiarism
>>>>>>>> since you do not credit gene in your paper.
>>>>>>>>
>>>>>>>
>>>>>>> It is the standard grammar specification for FOL.
>>>>>>> IT IS FIRST ORDER LOGIC.
>>>>>>> There is no copyright or patent on first order logic.
>>>>>>
>>>>>> No, but there might be on a particular bison implementation, and
>>>>>> you appear to have based yours on this one.
>>>>>>
>>>>>> Plagiarism and copyright violation are entirely different things.
>>>>>> Academic honesty demands you properly cite your sources regardless
>>>>>> of whether they have copyrights or patents associated with them.
>>>>>>
>>>>>
>>>>> https://www.analyzemath.com/algebra/rules_algebra.html
>>>>>
>>>>> Since there is only one way to do it correctly the grammar of first
>>>>> order logic is like the commutative property of addition common
>>>>> knowledge in the public domain.
>>>>>
>>>>>> And that doesn't address my question. How does giving me someone
>>>>>> else's grammar of FOL
>>>>>
>>>>> It is NOT any an individual's mere opinion it is the only correct
>>>>> way to specifiy the grammar of first order logic.
>>>>
>>>> Even if we agree on WHICH first order logic we are discussing (FOL
>>>> is a class of logics, not a single thing), there are still multiple
>>>> different ways in which the grammar of that language could
>>>> implemented in bison. You appear to have based your MTT on one
>>>> specific bison implementation by someone named 'gene' but have not
>>>> credited him for it. That is plagiarism.
>>>>
>>>
>>> Every other grammar specification for FOL that I found is identical.
>>> I don't know how anyone could write it any other way and still be
>>> correct.
>>> I can always add a reference to the link.
>>
>> Well, trivially one could have chosen different names, e.g.
>> BICONDITIONAL rather than IFF. One could also have grouped ∨, →, etc.
>> into a group called INFIX, and so forth. The point is, it is fairly
>> apparent that you have used this as a starting point but have failed
>> to acknowledge this point.
>>
>
> Okay you convinced me. I updated my paper to give Gene credit.
>
>>>>>> explain what simplifications you made in your article or why you
>>>>>> felt it was necessary to make them. Why not just post the
>>>>>> unsimplified version? And what do you mean by 'semantic action'?
>>>>>
>>>>> If you start with the simpler grammar of first order logic and
>>>>> learn to understand this completely then understandibg my grammar
>>>>> will be much easier.
>>>>
>>>> I already understand the grammar of first order logics and how bison
>>>> works. It is your 'unsimplified' grammar that I am asking about. Why
>>>> keep it secret?
>>>>
>>>
>>> My unsimplified grammar merely has several redundancies to account
>>> for the limited look-ahead of YACC. Since I had to write the parser
>>> actions myself I might be able to rewrite them to create a parse tree
>>> without the redundancies.
>>
>> And I was asking you specifically about those actions (which you
>> previously called 'semantic actions'. But instead you direct me to
>> someone else's FOL grammar.
>
> Semantic actions is merely a YACC term for building a Parse tree.
> It really clutters up trying to understand the grammar.
>
> | FOR_ALL IDENTIFIER SUBSET_OF IDENTIFIER sentence
> {
> AST.createTreeNode(yyn, IDENTIFIER, $4);
> AST.createTreeNode(yyn, IDENTIFIER, $2);
> AST.createTreeNodeAndAppendChildren(2, yyn, SUBSET_OF);
> AST.createTreeNodeAndAppendChildren(2, yyn, FOR_ALL);
> }
>
>
>>
>>>>>>
>>>>>>>> But here's a small note for you. The following is quoted from
>>>>>>>> your article:
>>>>>>>>
>>>>>>>> Here it is encoded using first order logic syntax and the
>>>>>>>> definition operator:
>>>>>>>> (a) S1 := ∀x (Px ∨ ¬Px)
>>>>>>>> (b) ∀P(S1)
>>>>>>>>
>>>>>>>> In what sense is (b) 'first order logic syntax'? If P is a
>>>>>>>> predicate, then ∀P(...) is not valid first order logic. Your
>>>>>>>> 'macro substitution' doesn't change this.
>>>>>>>>
>>>>>>>
>>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>>> HOW MANY TIMES DO I HAVE TO TELL YOU THAT MTT IS HIGHER ORDER LOGIC?
>>>>>>
>>>>>> You claim that your silly := allows you to express higher order
>>>>>> logics using first order logic syntax. It does not. That was my
>>>>>> point.
>>>>>
>>>>> You are wrong. I already proved that am right. You can't simply
>>>>> ignore this proof in your rebuttal.
>>>>>
>>>>> ∀P∀x (Px ∨ ¬Px) // second order logic
>>>>>
>>>>> S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name
>>>>> ∀P(S1) // S1 to be macro expanded
>>>>
>>>> So where do you have higher order logic expressed in FOL syntax
>>>> above? You do not.
>>>>
>>>
>>> // first order logic expression assigned to name
>>> (a) S1 := ∀x (P(x) ∨ ¬P(x))
>>>
>>> // S1 to be macro expanded
>>> (b) ∀P(S1)
>>>
>>> As soon as expression (b) is macro expanded it becomes the second
>>> order logic expression: ∀P(∀x(P(x) ∨ ¬P(x)))
>>
>> Even before expansion, though, it isn't FOL, nor does it follow the
>> syntax of FOL. Nowhere do you have an expression of second order logic
>> expressed using first order syntax.
>
> We only used FOL syntax: ∀x (P(x) ∨ ¬P(x))
> and the three aspects of the definition operator
>
> definition
> S1 := ∀x (P(x) ∨ ¬P(x))
>
> linking levels of logic
> ∀P(S1)
>
> expansion
> ∀x (P(x) ∨ ¬P(x))
>
>> And if := is really the same as macro expansion then what it looks
>> before expansion isn't even relevant.
>>
>
> It the same way that structured programming breaks otherwise enormously
> complex problems down in conceptual units that do not exceed the
> capacity of the human mind, MTT breaks levels of logic down into their
> simpler constituents.
>
>>> I honestly don't see why you are having such a difficult time with this.
>>
>> Nor I why you are having such a time. If you figure this out, though,
>> it might help you see why taking someone else's syntax for FOL and and
>> adding a few things isn't going to work if you actually want to
>> express HOL. There is a major flaw with your grammar as it stands if
>> you purport that it can be used for HOL.
>
> Anyone can make an empty assertion such as this.
I just proved how MTT can specify a second order logic expression on the
basis of
(1) Linking a first order logic expression to a name
(2) Qpplying quanltification to this name to link logic levels
(3) Macro expansion unfolds the whole 2nd order logic expression
The following shows that this same process can be done to an arbitray depth:
https://en.wikipedia.org/wiki/Higher-order_logic
First-order logic quantifies only variables that range over individuals;
second-order logic, in addition, also quantifies over sets; third-order
logic also quantifies over sets of sets, and so on.
Higher-order logic is the union of first-, second-, third-, …, nth-order
logic; i.e., higher-order logic admits quantification over sets that are
nested arbitrarily deeply.
Making an empty assertion that I am wrong counts as less than any
rebuttal at all.
>>
>>>> <snip irreleventia>
>>>>
>>>>>>>> And I'd *really* like to see the semantics you give to:
>>>>>>>>
>>>>>>>> | sentence PROVES sentence
>>>>>>>>
>>>>>>>> It's easy enough to put that into the syntax. The semantics is
>>>>>>>> an entirely different matter.
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> It is an assertion that a proof exists.
>>>>>>
>>>>>> That isn't a semantics. I know what the symbol stands for. I want
>>>>>> to know the semantics you actually assign to this given that your
>>>>>> grammar incorporates this directly into the language rather than
>>>>>> simply leaving it in the metalanguage. That means it needs to have
>>>>>> its semantics specified as part of your MTT.
>>>>>>
>>>>>
>>>>> It is the same thing as saying Provable(X).
>>>>
>>>> Wow! That certainly clarifies things! Naming a predicate and
>>>> defining one are not the same things. You have a habit of inventing
>>>> new names for predicates without defining them, as if somehow giving
>>>> them a name was sufficient.
>>>>
>>>>> The semantics the decides whether or it is satisfied is beyond the
>>>>> scope of investigation.
>>>>
>>>> It can't be since your entire argument rests on provability. If you
>>>> don't explain what you mean by this, then your MTT can't be used to
>>>> say anything whatsoever about provability.
>>>>
>>>
>>> The first page answers this question:
>>> https://www.researchgate.net/publication/332864362_Deductively_Sound_Formal_Proofs
>>
>>
>>
>> No it doesn't. The definitions you give there don't rise to the level
>> of a formal semantics.
>
No proof is ever semantic it is only syntactic:
I bet that you did not even glance at the words on that page before
making your empty assertion that I am wrong. Here at the quotes from
Elliott Mendelson that you missed:
Introduction to Mathematical logic Sixth edition
by Elliott Mendelson (2015) Page 28
A wf C is said to be a consequence in S of a set Γ of wfs
if and only if there is a sequence B1, …, Bk of wfs such
that C is Bk and, for each i, either Bi is an axiom or Bi
is in Γ, or Bi is a direct consequence by some rule of
inference of some of the preceding wfs in the sequence. Such
a sequence is called a proof (or deduction) of C from Γ. The
members of Γ are called the hypotheses or premisses of the proof.
We use Γ ⊢ C as an abbreviation for “C is a consequence of Γ”...
> On what basis have you concluded that Mendelson is an idiot?
>
>>
>>>
>>>> The scope of this investigation (since 2004) has only
>>>>> been the pathological self-reference cases where it cannot be
>>>>> satisfied.
>>>>>
>>>>> People seem to have an emotional attachment to the opinion that
>>>>> things such as the liar paradox are well formed.
>>>>>
>>>>> You already admitted that the truth teller paradox is vacuous, why
>>>>> can't you see that all expressions that only make assertions about
>>>>> their truth value or provability are equally vacuous?
>>>>
>>>> Vacuous and ill-formed are entirely different concepts. The sentence
>>>
>>> Not really not at all. An expression of language that has a vacuous
>>> truth value is ill-formed because it has a vacuous truth value.
>>
>> Your use of 'ill-formed' doesn't correspond to the usage of anyone
>> else. Normally, ill-formed means not conforming to the grammar, and
>> thus not part of the language.
>>
>
> Infinite expressions are not part of any grammar.
Only because grammar cannot recognize and reject infinite expression do
we have misconceptions like the incomplteness theorem. You are wrong
that they are not part of any grammar. They are pat of Prolog's grammar.
http://www.liarparadox.org
The Clocksin Mellish text on page two proves that Prolog can recognize
and reject infinite terms.
/Prolog_Detects_Pathological_Self_Reference.pdf
If you don't bother to even look at the before making an empty assertion
that I am incorrect, you are flat out being dishonest.
>
>>> "vacuous truth value" is a type of ill-formed propostion.
>>
>>>> 'this sentence is true' may be vacuous, but there is nothing
>>>> 'ill-formed' about it. It is simply an undecidable sentence.
>>>>
>>>> André
>>>>
>>>
>>> I really really hate it when terms-of-the-art override and supersede
>>> the conventional meaning of terms so that the term-of-the art can
>>> sneak logical incoherence into the analysis and simply write-off this
>>> logical incoherence as a stipulated definition.
>>
>> What you hate is having to actually learn what terms mean.
>
This term means that any expression of language that is neither provable
nor disprovable makes a formal system incomplete even if the only reason
that this expression is neither provable nor disprovable is that there
is something wrong with it.
A theory T is incomplete if and only if there is some sentence φ such
that (T ⊬ φ) and (T ⊬ ¬φ).
You continue to hold such a strong bias that I must be incorrect that
you do not bother to see that I am correct. That the bias is on your
side and not my side is proven by the fact that you cannot derive any
correct rebuttal. All that you can do is make empty assertions.
> They simply brush aside logical incoherence as a stipulated definition.
> The correct way to do this rejects logical incoherence and does not
> simply stipulate that logical incoherence is not incoherent.
>
>> There is no concept of 'vacuous truth' defined as a term of art for
>> logics because such things occur in natural language, not in logic.
>
> It occurs in logic yet has been defined to not exist.
>
>> If you want to talk about natural language, you are free to use this
>> term if you wish, but it doesn't apply to any construction used in
>> standard logic.
>>
>
> Only because standard logic has intentionally been specified to make
> this error invisble.
>
>>> If we use the same reasoning as used in mathematics then I can cay
>>> the the question: What time is it (yes or no)? is simply undecidable
>>> and not an ill-formed question.
>>>
>>> It is a perfectly valid question and has a perfectly valid answer, it
>>> is merely human limitations that prevent the correct answer from
>>> being provided. The human system of reasoning is incomplete because
>>> humans cannot provide the correct (yes or no) answer to the question:
>>> What time is it?
>>
>> There are no interrogative expressions in logic so the above is
>> entirely irrelevant. And 'decidable', if applied to natural language,
>> would be applied to declarative sentences only. So the above is
>> entirely irrelevant to natural language as well.
>>
>> André
>>
>
> "This sentence is not true" is therefore decidable.
> Try and show how it or its negation is satisfied.
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-05 08:04 -0600 |
| Message-ID | <rlf954$qp6$1@dont-email.me> |
| In reply to | #23708 |
On 2020-10-01 15:29, olcott wrote: > On 10/1/2020 3:32 PM, André G. Isaak wrote: >> On 2020-10-01 13:34, olcott wrote: >>> On 10/1/2020 1:15 PM, André G. Isaak wrote: >>>> On 2020-09-30 20:37, olcott wrote: >>>>> On 9/30/2020 9:06 PM, André G. Isaak wrote: >>>>>> You claim that your silly := allows you to express higher order >>>>>> logics using first order logic syntax. It does not. That was my >>>>>> point. >>>>> >>>>> You are wrong. I already proved that am right. You can't simply >>>>> ignore this proof in your rebuttal. >>>>> >>>>> ∀P∀x (Px ∨ ¬Px) // second order logic >>>>> >>>>> S1 := ∀x (Px ∨ ¬Px) // first order logic expression assigned to name >>>>> ∀P(S1) // S1 to be macro expanded >>>> >>>> So where do you have higher order logic expressed in FOL syntax >>>> above? You do not. >>>> >>> >>> // first order logic expression assigned to name >>> (a) S1 := ∀x (P(x) ∨ ¬P(x)) >>> >>> // S1 to be macro expanded >>> (b) ∀P(S1) >>> >>> As soon as expression (b) is macro expanded it becomes the second >>> order logic expression: ∀P(∀x(P(x) ∨ ¬P(x))) >> >> Even before expansion, though, it isn't FOL, nor does it follow the >> syntax of FOL. Nowhere do you have an expression of second order logic >> expressed using first order syntax. > > We only used FOL syntax: ∀x (P(x) ∨ ¬P(x)) So what exactly is P here? If it is a variable ranging over predicates, then the above is not valid FOL because FOL doesn't allow variables to range over predicates. If it is a predicate constant, which would be allowed in FOL, then your expansion is invalid because you can't quantify over a constant. You call your system 'minimal type theory', yet you pay no attention to actual types. If you want to capture HOL, you need to distinguish (at least) two types of variables (individual and predicate variables) which must be treated differently in the syntax rather than simply being lumped together as 'identifiers'. > and the three aspects of the definition operator > > definition > S1 := ∀x (P(x) ∨ ¬P(x)) > > linking levels of logic > ∀P(S1) > > expansion > ∀x (P(x) ∨ ¬P(x)) > >> And if := is really the same as macro expansion then what it looks >> before expansion isn't even relevant. >> > > It the same way that structured programming breaks otherwise enormously > complex problems down in conceptual units that do not exceed the > capacity of the human mind, MTT breaks levels of logic down into their > simpler constituents. > >>> I honestly don't see why you are having such a difficult time with this. >> >> Nor I why you are having such a time. If you figure this out, though, >> it might help you see why taking someone else's syntax for FOL and and >> adding a few things isn't going to work if you actually want to >> express HOL. There is a major flaw with your grammar as it stands if >> you purport that it can be used for HOL. > > Anyone can make an empty assertion such as this. > >> >>>> <snip irreleventia> >>>> >>>>>>>> And I'd *really* like to see the semantics you give to: >>>>>>>> >>>>>>>> | sentence PROVES sentence >>>>>>>> >>>>>>>> It's easy enough to put that into the syntax. The semantics is >>>>>>>> an entirely different matter. >>>>>>>> >>>>>>>> André >>>>>>>> >>>>>>> >>>>>>> It is an assertion that a proof exists. >>>>>> >>>>>> That isn't a semantics. I know what the symbol stands for. I want >>>>>> to know the semantics you actually assign to this given that your >>>>>> grammar incorporates this directly into the language rather than >>>>>> simply leaving it in the metalanguage. That means it needs to have >>>>>> its semantics specified as part of your MTT. >>>>>> >>>>> >>>>> It is the same thing as saying Provable(X). >>>> >>>> Wow! That certainly clarifies things! Naming a predicate and >>>> defining one are not the same things. You have a habit of inventing >>>> new names for predicates without defining them, as if somehow giving >>>> them a name was sufficient. >>>> >>>>> The semantics the decides whether or it is satisfied is beyond the >>>>> scope of investigation. >>>> >>>> It can't be since your entire argument rests on provability. If you >>>> don't explain what you mean by this, then your MTT can't be used to >>>> say anything whatsoever about provability. >>>> >>> >>> The first page answers this question: >>> https://www.researchgate.net/publication/332864362_Deductively_Sound_Formal_Proofs >> >> >> >> No it doesn't. The definitions you give there don't rise to the level >> of a formal semantics. > > On what basis have you concluded that Mendelson is an idiot? I never claimed Mendelson is an idiot. I claimed that the above doesn't rise to the level of a formal semantics. Mendelson never claimed that it did. Unlike you, Mendelson never treats ⊢ as a symbol of FOL (or HOL), but only as part of the metalanguage. You insist on not making this distinction, largely, I suspect, because you don't actually understand why such a distinction is made in the first place. Symbols of the metalanguage are frequently defined with less rigor than would be required for symbols of the actual language. If you want X ⊢ Y to be part of the language, you need to provide a semantics which actually shows how it is evaluated to true or false in any given case. >> >>> >>>> The scope of this investigation (since 2004) has only >>>>> been the pathological self-reference cases where it cannot be >>>>> satisfied. >>>>> >>>>> People seem to have an emotional attachment to the opinion that >>>>> things such as the liar paradox are well formed. >>>>> >>>>> You already admitted that the truth teller paradox is vacuous, why >>>>> can't you see that all expressions that only make assertions about >>>>> their truth value or provability are equally vacuous? >>>> >>>> Vacuous and ill-formed are entirely different concepts. The sentence >>> >>> Not really not at all. An expression of language that has a vacuous >>> truth value is ill-formed because it has a vacuous truth value. >> >> Your use of 'ill-formed' doesn't correspond to the usage of anyone >> else. Normally, ill-formed means not conforming to the grammar, and >> thus not part of the language. >> > > Infinite expressions are not part of any grammar. "This sentence is true" is not an infinite expression, and it is perfectly well-formed according to the rules of English grammar. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
Page 4 of 21 — ← Prev page 1 2 3 [4] 5 6 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web