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 13 of 21 — ← Prev page 1 … 11 12 [13] 14 15 … 21 Next page →
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-21 14:05 -0700 |
| Message-ID | <9ae3a2ba-9fbe-4754-a54e-e656e98d2322o@googlegroups.com> |
| In reply to | #24073 |
On Wednesday, October 21, 2020 at 12:59:33 PM UTC-7, olcott wrote: > Because of your concrete example of modulo-12 arithmetic I finally > understand that model theory actually has a genuinely useful purpose. > I can't understand anything without a specific concrete example. > Modulo-12 arithmetic was that example. Are you aware of what mathematicians call groups?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 19:41 -0500 |
| Message-ID | <HKSdne-OrKPbSA3CnZ2dnUU7-IOdnZ2d@giganews.com> |
| In reply to | #24078 |
On 10/21/2020 4:05 PM, David Kleinecke wrote: > On Wednesday, October 21, 2020 at 12:59:33 PM UTC-7, olcott wrote: > >> Because of your concrete example of modulo-12 arithmetic I finally >> understand that model theory actually has a genuinely useful purpose. >> I can't understand anything without a specific concrete example. >> Modulo-12 arithmetic was that example. > > Are you aware of what mathematicians call groups? > No. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-21 20:57 -0700 |
| Message-ID | <b255554b-56e2-4b1d-a4f8-bdb5a8c2f927o@googlegroups.com> |
| In reply to | #24088 |
On Wednesday, October 21, 2020 at 5:41:50 PM UTC-7, olcott wrote: > On 10/21/2020 4:05 PM, David Kleinecke wrote: > > On Wednesday, October 21, 2020 at 12:59:33 PM UTC-7, olcott wrote: > > > >> Because of your concrete example of modulo-12 arithmetic I finally > >> understand that model theory actually has a genuinely useful purpose. > >> I can't understand anything without a specific concrete example. > >> Modulo-12 arithmetic was that example. > > > > Are you aware of what mathematicians call groups? > > > > No. You would have been aware of other + operators. The axioms of a group are: EeAx x+e=e+x AxEy x+y=y+x=e AxAyAz (x+y)+z=x+(y+z) One example is permutations. The permuation group generated by three things has six elements and does not commute. Groups are everywhere. Far more common than mod n arithmetic. And a better example of non-commutivity.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 23:12 -0500 |
| Message-ID | <WOidndxC8MdcmwzCnZ2dnUU7-KOdnZ2d@giganews.com> |
| In reply to | #24097 |
On 10/21/2020 10:57 PM, David Kleinecke wrote: > On Wednesday, October 21, 2020 at 5:41:50 PM UTC-7, olcott wrote: >> On 10/21/2020 4:05 PM, David Kleinecke wrote: >>> On Wednesday, October 21, 2020 at 12:59:33 PM UTC-7, olcott wrote: >>> >>>> Because of your concrete example of modulo-12 arithmetic I finally >>>> understand that model theory actually has a genuinely useful purpose. >>>> I can't understand anything without a specific concrete example. >>>> Modulo-12 arithmetic was that example. >>> >>> Are you aware of what mathematicians call groups? >>> >> >> No. > > You would have been aware of other + operators. > The axioms of a group are: > EeAx x+e=e+x > AxEy x+y=y+x=e > AxAyAz (x+y)+z=x+(y+z) > One example is permutations. The permuation group > generated by three things has six elements and does > not commute. > > Groups are everywhere. Far more common than mod n > arithmetic. And a better example of non-commutivity. > All that I am prepared to accept presently is that I should eventually get to know model theory very well. I am focused now on my halting problem proof refutation. I finally got my x86 based universal Turing machine (equivalent) fully operational. It took me about one man-year. I also published what I am pretty sure are the final versions of the Peter Linz H() and H_Hat() templates written in C with a tiny bit of embedded x86 assembly language. See this thread: The key aspects of x86utm are now finally complete (Refuting the HP proofs) [ HP proof refutation ] -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-21 17:29 +0100 |
| Message-ID | <87mu0fee54.fsf@bsb.me.uk> |
| In reply to | #24057 |
André G. Isaak <agisaak@gm.invalid> writes:
> On 2020-10-21 07:25, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>> <cut>
>>>>>>> The only way that an expression of language is neither provable nor
>>>>>>> disprovable in any formal system of Q or greater is if the expression
>>>>>>> of language is incorrect.
>>>>>>
>>>>>> This is very badly worded, but it seems to say that you still claim that
>>>>>> x+y=y+x is incorrect. If so, then answer the question you've tried so
>>>>>> hard to dodge: in what way is it incorrect?
>>>>>
>>>>> The formal system of the set of all knowledge currently known and can
>>>>> ever possibly be known includes Q. In other words Gödel's proof
>>>>> applies to an omniscient formal system.
>>>>
>>>> No answer. What is incorrect about Q's x+y=y+x?
>>>
>>> Your dishonest dodge is noted. Apparently if your goal is to "win an
>>> argument" and when you know that you are incorrect then the only
>>> tactic available is dishonest dodges.
>>
>> My goal is to get you to answer the question. What is incorrect about
>> Q's x+y=y+x? Either explain what is incorrect about this perfectly
>> sensible "expression of the language of Q" or confirm that you no longer
>> stand by the definition you gave:
>>
>> | An expression φ of the language of theory T is incorrect if and only
>> | if (T ⊬ φ) and (T ⊬ ¬φ).
>>
>> You could not have been clearer: Q's x+y=y+x is incorrect.
>>
>>> The commutative property of addition is provable in some formal
>>> systems therefore it is not erroneous.
>>
>> You are trying to wriggle out of what you said. x+y=y+x is an
>> expression of the language of Q. According to you, it is incorrect if
>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case.
>>
>> Answer the question or retract the definition.
>>
>> As always, you have said some new incorrect things that, were I to
>> address them, could derail the discussion. I'd like clear one simple
>> point once and for all. You should approve, after all, of what you call
>> a laser-like focus on a topic.
>
> Rereading some of his posts and trying to get through his convoluted
> grammar, it actually appears he did provide an answer, but, as you
> suspected it was some entirely new wrong thing.
>
> Propositions which are not provable or disprovable in "any system
> what-so-ever" are incorrect.
Yes, and in at least one post said he was refining his claim.
But he is still changing the claim without withdrawing the previous one.
The specific formal system was explicit in that original claim. He
needs to repudiate it or defend it, not just change it without
acknowledgement.
He does this all the time. He once argued for days that if {A,B,C} ⊦ X
then {A, B, C, ¬A} ⊬ X. But he has never explicated stated that he was
wrong about that so for all I know he still has his own nonsense version
of what ⊦ means.
> Propositions which are not provable or disprovable in system F but
> which are provable or disprovable in *some* system, aren't incorrect,
> they're just not propositions of F.
This is what I meant by "you have said some new incorrect things". This
is so silly that getting into it would almost certainly prevent any
chance of resolving the original claim.
> So apparently, to determine whether some proposition is 'incorrect' as
> opposed to simply being 'not a proposition', you must not only
> determine whether it is provable in the system under consideration,
> but also in every other possible system. So if Q is able to somehow
> determine that x + y = y + x is provable in PA (don't ask how it does
> this), then it gets to be a not-a-proposition of Q. But if Q can't
> identify any system in the whole universe in which it is provable,
> then it gets to be an 'incorrect' proposition.
Well, that's one interpretation. I think it's very generous of you to
try to give it a meaning at all. Formulas in different systems may not
even share a common language and when they do the symbols may not "mean"
the same thing. For example, one in which x+y=y+x is provable might not
have all the other axioms that ensure that + is the function we all know
a love. And then there's the formal systems with just one axiom -- the
formula we are considering.
In he defence, he tried to tackle this by talking about formal systems
"Q or better" but that really does not hack it.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 12:10 -0500 |
| Message-ID | <ysqdnRxI1uvu9g3CnZ2dnUU7-a_NnZ2d@giganews.com> |
| In reply to | #24062 |
On 10/21/2020 11:29 AM, Ben Bacarisse wrote:
> André G. Isaak <agisaak@gm.invalid> writes:
>
>> On 2020-10-21 07:25, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 10/20/2020 8:04 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 10/19/2020 8:56 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>> <cut>
>>>>>>>> The only way that an expression of language is neither provable nor
>>>>>>>> disprovable in any formal system of Q or greater is if the expression
>>>>>>>> of language is incorrect.
>>>>>>>
>>>>>>> This is very badly worded, but it seems to say that you still claim that
>>>>>>> x+y=y+x is incorrect. If so, then answer the question you've tried so
>>>>>>> hard to dodge: in what way is it incorrect?
>>>>>>
>>>>>> The formal system of the set of all knowledge currently known and can
>>>>>> ever possibly be known includes Q. In other words Gödel's proof
>>>>>> applies to an omniscient formal system.
>>>>>
>>>>> No answer. What is incorrect about Q's x+y=y+x?
>>>>
>>>> Your dishonest dodge is noted. Apparently if your goal is to "win an
>>>> argument" and when you know that you are incorrect then the only
>>>> tactic available is dishonest dodges.
>>>
>>> My goal is to get you to answer the question. What is incorrect about
>>> Q's x+y=y+x? Either explain what is incorrect about this perfectly
>>> sensible "expression of the language of Q" or confirm that you no longer
>>> stand by the definition you gave:
>>>
>>> | An expression φ of the language of theory T is incorrect if and only
>>> | if (T ⊬ φ) and (T ⊬ ¬φ).
>>>
>>> You could not have been clearer: Q's x+y=y+x is incorrect.
>>>
>>>> The commutative property of addition is provable in some formal
>>>> systems therefore it is not erroneous.
>>>
>>> You are trying to wriggle out of what you said. x+y=y+x is an
>>> expression of the language of Q. According to you, it is incorrect if
>>> (and only if) Q ⊬ x+y=y+x and Q ⊬ ¬(x+y=y+x) which is indeed the case.
>>>
>>> Answer the question or retract the definition.
>>>
>>> As always, you have said some new incorrect things that, were I to
>>> address them, could derail the discussion. I'd like clear one simple
>>> point once and for all. You should approve, after all, of what you call
>>> a laser-like focus on a topic.
>>
>> Rereading some of his posts and trying to get through his convoluted
>> grammar, it actually appears he did provide an answer, but, as you
>> suspected it was some entirely new wrong thing.
>>
>> Propositions which are not provable or disprovable in "any system
>> what-so-ever" are incorrect.
>
> Yes, and in at least one post said he was refining his claim.
>
> But he is still changing the claim without withdrawing the previous one.
What do you think that narrowing the scope of a claim means?
> The specific formal system was explicit in that original claim. He
> needs to repudiate it or defend it, not just change it without
> acknowledgement.
>
> He does this all the time. He once argued for days that if {A,B,C} ⊦ X
> then {A, B, C, ¬A} ⊬ X. But he has never explicated stated that he was
> wrong about that so for all I know he still has his own nonsense version
> of what ⊦ means.
>
Within the sound deductive inference model {A, B, C, ¬A}
never proves jack shit. Thus the principle of explosion diverges from
the sound deductive inference model.
>> Propositions which are not provable or disprovable in system F but
>> which are provable or disprovable in *some* system, aren't incorrect,
>> they're just not propositions of F.
>
> This is what I meant by "you have said some new incorrect things". This
> is so silly that getting into it would almost certainly prevent any
> chance of resolving the original claim.
>
>> So apparently, to determine whether some proposition is 'incorrect' as
>> opposed to simply being 'not a proposition', you must not only
>> determine whether it is provable in the system under consideration,
>> but also in every other possible system. So if Q is able to somehow
>> determine that x + y = y + x is provable in PA (don't ask how it does
>> this), then it gets to be a not-a-proposition of Q. But if Q can't
>> identify any system in the whole universe in which it is provable,
>> then it gets to be an 'incorrect' proposition.
>
> Well, that's one interpretation. I think it's very generous of you to
> try to give it a meaning at all. Formulas in different systems may not
> even share a common language and when they do the symbols may not "mean"
> the same thing. For example, one in which x+y=y+x is provable might not
> have all the other axioms that ensure that + is the function we all know
> a love. And then there's the formal systems with just one axiom -- the
> formula we are considering.
>
A most fundamental premise is that all of the logic / math symbols
retain their conventional semantic meaning.
If we use your screwy reasoning we could consider the possibility that
none of any of our conversations have ever been in English. Instead of
English we construe that every word that anyone has every said in these
forums is German gibberish.
> In he defence, he tried to tackle this by talking about formal systems
> "Q or better" but that really does not hack it.
>
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 11:41 -0600 |
| Message-ID | <rmprsc$lc7$1@dont-email.me> |
| In reply to | #24065 |
On 2020-10-21 11:10, olcott wrote: > On 10/21/2020 11:29 AM, Ben Bacarisse wrote: >> Well, that's one interpretation. I think it's very generous of you to >> try to give it a meaning at all. Formulas in different systems may not >> even share a common language and when they do the symbols may not "mean" >> the same thing. For example, one in which x+y=y+x is provable might not >> have all the other axioms that ensure that + is the function we all know >> a love. And then there's the formal systems with just one axiom -- the >> formula we are considering. >> > > A most fundamental premise is that all of the logic / math symbols > retain their conventional semantic meaning. 5 + 8 = 1 Is false for integer arithmetic. It is true for modulo-12 arithmetic. Neither is the 'correct' arithmetic. Each is appropriate for a different set of problems. A string of symbols which is provable in one may not be provable in the other. The semantics of ∧ in propositional calculus are governed by a truth-table, whereas in probabilistic logic this behaves essentially as a multiplication operator. Again, neither is the correct logic. Each is appropriate for a different set of problems. There is no unique set of conventional meanings for the majority of symbols. 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-21 13:16 -0500 |
| Message-ID | <F-6dnT7m2oxt5w3CnZ2dnUU7-I_NnZ2d@giganews.com> |
| In reply to | #24067 |
On 10/21/2020 12:41 PM, André G. Isaak wrote: > On 2020-10-21 11:10, olcott wrote: >> On 10/21/2020 11:29 AM, Ben Bacarisse wrote: > >>> Well, that's one interpretation. I think it's very generous of you to >>> try to give it a meaning at all. Formulas in different systems may not >>> even share a common language and when they do the symbols may not "mean" >>> the same thing. For example, one in which x+y=y+x is provable might not >>> have all the other axioms that ensure that + is the function we all know >>> a love. And then there's the formal systems with just one axiom -- the >>> formula we are considering. >>> >> >> A most fundamental premise is that all of the logic / math symbols >> retain their conventional semantic meaning. > > 5 + 8 = 1 > > Is false for integer arithmetic. It is true for modulo-12 arithmetic. > http://openmusictheory.com/mod12.html That is yet another very excellent point on top of your other very excellent point about the provability of the commutative property of addition in Q and PA. These very excellent additional points are key to increasing the precision of my initial intuitions to increase their accuracy. My process of categorically exhaustive reasoning proceeds on the basis of a general gist of an idea that has some truth to it and is progressively refined to increase the precision and accuracy of the original assertion by narrowing its scope. Good job !!! > Neither is the 'correct' arithmetic. Each is appropriate for a different > set of problems. A string of symbols which is provable in one may not be > provable in the other. > Yes this has been fully established. > The semantics of ∧ in propositional calculus are governed by a > truth-table, whereas in probabilistic logic this behaves essentially as > a multiplication operator. Again, neither is the correct logic. Each is > appropriate for a different set of problems. > When anything besides deductive logical inference is referred to as logic I consider this use of the term to be a misnomer. A more accurate characterization of logical induction would be reasonably plausible estimations. When we call them reasonably plausible estimations we are making explicit the fact that these estimations can fail. > There is no unique set of conventional meanings for the majority of > symbols. > > André > Apparently there is a unique set of sets of conventional meanings that depend on the context. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-21 12:49 -0600 |
| Message-ID | <rmpvsd$jr3$1@dont-email.me> |
| In reply to | #24069 |
On 2020-10-21 12:16, olcott wrote: > On 10/21/2020 12:41 PM, André G. Isaak wrote: >> On 2020-10-21 11:10, olcott wrote: >>> On 10/21/2020 11:29 AM, Ben Bacarisse wrote: >> >>>> Well, that's one interpretation. I think it's very generous of you to >>>> try to give it a meaning at all. Formulas in different systems may not >>>> even share a common language and when they do the symbols may not >>>> "mean" >>>> the same thing. For example, one in which x+y=y+x is provable might >>>> not >>>> have all the other axioms that ensure that + is the function we all >>>> know >>>> a love. And then there's the formal systems with just one axiom -- the >>>> formula we are considering. >>>> >>> >>> A most fundamental premise is that all of the logic / math symbols >>> retain their conventional semantic meaning. >> >> 5 + 8 = 1 >> >> Is false for integer arithmetic. It is true for modulo-12 arithmetic. >> > > http://openmusictheory.com/mod12.html > > That is yet another very excellent point on top of your other very > excellent point about the provability of the commutative property of > addition in Q and PA. These very excellent additional points are key to > increasing the precision of my initial intuitions to increase their > accuracy. > > My process of categorically exhaustive reasoning proceeds on the basis > of a general gist of an idea that has some truth to it and is > progressively refined to increase the precision and accuracy of the > original assertion by narrowing its scope. > > Good job !!! > >> Neither is the 'correct' arithmetic. Each is appropriate for a >> different set of problems. A string of symbols which is provable in >> one may not be provable in the other. >> > > Yes this has been fully established. Great. Now you should go and take a course on algebraic structures. You will learn that most of the common mathematical symbols like +, × etc. can all mean a wide variety of different things depending on what structures you are talking about. Your middle school math might give each of these things a unique interpretation but don't let that fool you. >> The semantics of ∧ in propositional calculus are governed by a >> truth-table, whereas in probabilistic logic this behaves essentially >> as a multiplication operator. Again, neither is the correct logic. >> Each is appropriate for a different set of problems. >> > > When anything besides deductive logical inference is referred to as > logic I consider this use of the term to be a misnomer. A more accurate What you consider to be a misnomer is irrelevant. Probabilistic logic is very clearly a type of logic which employs the same principle as propositional logic but with probabilities rather than truth values as its domain. > Apparently there is a unique set of sets of conventional meanings that > depend on the context. if the conventional interpretation depends on the context then there is no unique conventional interpretation. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-21 21:13 +0100 |
| Message-ID | <875z73e3sh.fsf@bsb.me.uk> |
| In reply to | #24065 |
olcott <NoOne@NoWhere.com> writes:
> On 10/21/2020 11:29 AM, Ben Bacarisse wrote:
>> André G. Isaak <agisaak@gm.invalid> writes:
<cut>
>>> Rereading some of his posts and trying to get through his convoluted
>>> grammar, it actually appears he did provide an answer, but, as you
>>> suspected it was some entirely new wrong thing.
>>>
>>> Propositions which are not provable or disprovable in "any system
>>> what-so-ever" are incorrect.
>>
>> Yes, and in at least one post said he was refining his claim.
>>
>> But he is still changing the claim without withdrawing the previous one.
>
> What do you think that narrowing the scope of a claim means?
When you say it, I think it means "yes I was wrong but I literally can't
type those words". Here is the claim you kept on about for so long:
| An expression φ of the language of theory T is incorrect if and only
| if (T ⊬ φ) and (T ⊬ ¬φ).
Generally, honest researchers want to make clear when they have been
wrong, and they may even feel the need to apologise if they wasted
people's time with a claim they later repudiate. A straight answer
would be the minimum.
Note that this was not some trivial point. It was, right up until
whenever you "narrowed" it, the cornerstone that "removes incompleteness
as a roadblock to fulfilling Hilbert's program". No small matter!
Anyway, I now know you no longer think that Q's x+y=y+x is incorrect.
And I know you no longer think that a formula of T that is undecidable
is necessarily incorrect. Not only that that, I now know you no longer
think the /only/ way a formula of T can be incorrect is if it is
undecidable in T. All were silly claims, and it'd good that you don't
stand by them anymore.
>> He does this all the time. He once argued for days that if {A,B,C} ⊦ X
>> then {A, B, C, ¬A} ⊬ X. But he has never explicated stated that he was
>> wrong about that so for all I know he still has his own nonsense version
>> of what ⊦ means.
>
> Within the sound deductive inference model {A, B, C, ¬A} never proves
> jack shit.
Dodged again! Could it be that you still think that if {A, B, C} ⊦ X
then {A, B, C, ¬A} ⊬ X? We may never know because you seem determined
to avoid a straight answer. I think "I was wrong" is not a WFF in your
formal system.
>>> So apparently, to determine whether some proposition is 'incorrect' as
>>> opposed to simply being 'not a proposition', you must not only
>>> determine whether it is provable in the system under consideration,
>>> but also in every other possible system. So if Q is able to somehow
>>> determine that x + y = y + x is provable in PA (don't ask how it does
>>> this), then it gets to be a not-a-proposition of Q. But if Q can't
>>> identify any system in the whole universe in which it is provable,
>>> then it gets to be an 'incorrect' proposition.
>>
>> Well, that's one interpretation. I think it's very generous of you to
>> try to give it a meaning at all. Formulas in different systems may not
>> even share a common language and when they do the symbols may not "mean"
>> the same thing. For example, one in which x+y=y+x is provable might not
>> have all the other axioms that ensure that + is the function we all know
>> a love. And then there's the formal systems with just one axiom -- the
>> formula we are considering.
>
> A most fundamental premise is that all of the logic / math symbols
> retain their conventional semantic meaning.
That's funny! You think symbols like + have one conventional meaning?
If you were a student, willing to learn, I'd ask you what the
conventional meaning of + is, and how you would specify it. The answer
would then determine the direction of the discussion. But I am hopeful
you won't try to answer this question, so I need not be prepared to
explain.
> If we use your screwy reasoning we could consider the possibility that
> none of any of our conversations have ever been in English. Instead of
> English we construe that every word that anyone has every said in
> these forums is German gibberish.
The trouble is you backed out of trying to understand what
mathematicians mean be the semantics of formulas. As a result, you
literally don't know what you are talking about. I'll take that up with
you again if you ever want to learn what you are criticising.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-21 20:13 -0500 |
| Message-ID | <KtOdnYT66skxQQ3CnZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #24074 |
On 10/21/2020 3:13 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 10/21/2020 11:29 AM, Ben Bacarisse wrote:
>>> André G. Isaak <agisaak@gm.invalid> writes:
> <cut>
>>>> Rereading some of his posts and trying to get through his convoluted
>>>> grammar, it actually appears he did provide an answer, but, as you
>>>> suspected it was some entirely new wrong thing.
>>>>
>>>> Propositions which are not provable or disprovable in "any system
>>>> what-so-ever" are incorrect.
>>>
>>> Yes, and in at least one post said he was refining his claim.
>>>
>>> But he is still changing the claim without withdrawing the previous one.
>>
>> What do you think that narrowing the scope of a claim means?
>
> When you say it, I think it means "yes I was wrong but I literally can't
> type those words". Here is the claim you kept on about for so long:
>
> | An expression φ of the language of theory T is incorrect if and only
> | if (T ⊬ φ) and (T ⊬ ¬φ).
>
> Generally, honest researchers want to make clear when they have been
> wrong, and they may even feel the need to apologise if they wasted
> people's time with a claim they later repudiate. A straight answer
> would be the minimum.
>
The way that my process of categorically exhaustive reasoning works is
the I progressively refine the gist of an intuition until this intuition
has been accurately translated into words.
An expression φ of the language of theory T is not a proposition of
theory T if and only if (T ⊬ φ) and (T ⊬ ¬φ).
> Note that this was not some trivial point. It was, right up until
> whenever you "narrowed" it, the cornerstone that "removes incompleteness
> as a roadblock to fulfilling Hilbert's program". No small matter!
>
> Anyway, I now know you no longer think that Q's x+y=y+x is incorrect.
x+y=y+x is not a proposition of Q.
> And I know you no longer think that a formula of T that is undecidable
> is necessarily incorrect.
An undecidable formula of theory T is not a proposition of theory T.
> Not only that that, I now know you no longer
> think the /only/ way a formula of T can be incorrect is if it is
> undecidable in T. All were silly claims, and it'd good that you don't
> stand by them anymore.
>
I don't recall ever saying that a formula is only incorrect if it is
undecidable. Certainly a syntactially ill-formed formula is incorrect.
>>> He does this all the time. He once argued for days that if {A,B,C} ⊦ X
>>> then {A, B, C, ¬A} ⊬ X.
if {A,B,C} ⊦ X then (within the sound deductive inference model)
{A, B, C, ¬A} ⊬ X because every premise must be true and both {A, ¬A}
cannot possisbly be true.
>> But he has never explicated stated that he was
>>> wrong about that so for all I know he still has his own nonsense version
>>> of what ⊦ means.
>>
>> Within the sound deductive inference model {A, B, C, ¬A} never proves
>> jack shit.
>
> Dodged again! Could it be that you still think that if {A, B, C} ⊦ X
> then {A, B, C, ¬A} ⊬ X? We may never know because you seem determined
> to avoid a straight answer. I think "I was wrong" is not a WFF in your
> formal system.
>
I didn't dodge. I explained it perfectly well for someone not suffering
from attention deficit disorder. I explained it again so that even
somoone with ADD could understand.
>>>> So apparently, to determine whether some proposition is 'incorrect' as
>>>> opposed to simply being 'not a proposition', you must not only
>>>> determine whether it is provable in the system under consideration,
>>>> but also in every other possible system. So if Q is able to somehow
>>>> determine that x + y = y + x is provable in PA (don't ask how it does
>>>> this), then it gets to be a not-a-proposition of Q. But if Q can't
>>>> identify any system in the whole universe in which it is provable,
>>>> then it gets to be an 'incorrect' proposition.
>>>
>>> Well, that's one interpretation. I think it's very generous of you to
>>> try to give it a meaning at all. Formulas in different systems may not
>>> even share a common language and when they do the symbols may not "mean"
>>> the same thing. For example, one in which x+y=y+x is provable might not
>>> have all the other axioms that ensure that + is the function we all know
>>> a love. And then there's the formal systems with just one axiom -- the
>>> formula we are considering.
>>
>> A most fundamental premise is that all of the logic / math symbols
>> retain their conventional semantic meaning.
>
> That's funny! You think symbols like + have one conventional meaning?
> If you were a student, willing to learn, I'd ask you what the
> conventional meaning of + is, and how you would specify it. The answer
> would then determine the direction of the discussion. But I am hopeful
> you won't try to answer this question, so I need not be prepared to
> explain.
>
I already provided the complete alogorithm for the conventional meaning
of "+". modulo-12 arithmetic is very clearly very unconventional.
>> If we use your screwy reasoning we could consider the possibility that
>> none of any of our conversations have ever been in English. Instead of
>> English we construe that every word that anyone has every said in
>> these forums is German gibberish.
>
> The trouble is you backed out of trying to understand what
> mathematicians mean be the semantics of formulas. As a result, you
> literally don't know what you are talking about. I'll take that up with
> you again if you ever want to learn what you are criticising.
>
On the basis of the modulo-12 arithmetic example of the unconventional
meaning of "+" I can finally see that model theory is not utterly useless.
--
Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-22 03:00 +0100 |
| Message-ID | <871rhrc95p.fsf@bsb.me.uk> |
| In reply to | #24089 |
olcott <NoOne@NoWhere.com> writes:
> On 10/21/2020 3:13 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 10/21/2020 11:29 AM, Ben Bacarisse wrote:
>>>> André G. Isaak <agisaak@gm.invalid> writes:
>> <cut>
>>>>> Rereading some of his posts and trying to get through his convoluted
>>>>> grammar, it actually appears he did provide an answer, but, as you
>>>>> suspected it was some entirely new wrong thing.
>>>>>
>>>>> Propositions which are not provable or disprovable in "any system
>>>>> what-so-ever" are incorrect.
>>>>
>>>> Yes, and in at least one post said he was refining his claim.
>>>>
>>>> But he is still changing the claim without withdrawing the previous one.
>>>
>>> What do you think that narrowing the scope of a claim means?
>>
>> When you say it, I think it means "yes I was wrong but I literally can't
>> type those words". Here is the claim you kept on about for so long:
>>
>> | An expression φ of the language of theory T is incorrect if and only
>> | if (T ⊬ φ) and (T ⊬ ¬φ).
>>
>> Generally, honest researchers want to make clear when they have been
>> wrong, and they may even feel the need to apologise if they wasted
>> people's time with a claim they later repudiate. A straight answer
>> would be the minimum.
>
> The way that my process of categorically exhaustive reasoning works is
> the I progressively refine the gist of an intuition until this
> intuition has been accurately translated into words.
>
> An expression φ of the language of theory T is not a proposition of
> theory T if and only if (T ⊬ φ) and (T ⊬ ¬φ).
It already has a name (undecidable) but you can add your own as well.
It will confuse people because "proposition" has a general meaning
already, but you don't care about that, and I don't mind much as no one
else will want to use it (other than when talking to you about why you
shouldn't use it this way).
>> Note that this was not some trivial point. It was, right up until
>> whenever you "narrowed" it, the cornerstone that "removes incompleteness
>> as a roadblock to fulfilling Hilbert's program". No small matter!
>>
>> Anyway, I now know you no longer think that Q's x+y=y+x is incorrect.
> x+y=y+x is not a proposition of Q.
It's a sentence of Q and people, not aware of your edict, will think of
it as a proposition (because that's a rather general word). But your
new and confusing term does not really matter. No one but you will be
using it.
>> And I know you no longer think that a formula of T that is undecidable
>> is necessarily incorrect.
>
> An undecidable formula of theory T is not a proposition of theory T.
It's a sentence of T. There's no point in giving it another name. No
one is going to be interested in your made-up terms.
>> Not only that that, I now know you no longer
>> think the /only/ way a formula of T can be incorrect is if it is
>> undecidable in T. All were silly claims, and it'd good that you don't
>> stand by them anymore.
>
> I don't recall ever saying that a formula is only incorrect if it is
> undecidable. Certainly a syntactially ill-formed formula is incorrect.
It's right there in front of you. You said "if and only if". You've
said the same thing about your made-up term "proposition". The /only/
way a formula can not be a proposition of T is if T ⊬ φ and T ⊬ ¬φ. Did
you mean that?
>>>> He does this all the time. He once argued for days that if {A,B,C} ⊦ X
>>>> then {A, B, C, ¬A} ⊬ X.
>
> if {A,B,C} ⊦ X then (within the sound deductive inference model)
> {A, B, C, ¬A} ⊬ X because every premise must be true and both {A, ¬A}
> cannot possisbly be true.
So you do have your own made-up meaning for the ⊦ symbol. This is
important. Everyone commenting on what you write should know that they
can't assume they know what you mean by ⊦. It means, for example, that
I can't be sure what you really meant by T ⊬ φ and T ⊬ ¬φ above.
>>> But he has never explicated stated that he was
>>>> wrong about that so for all I know he still has his own nonsense version
>>>> of what ⊦ means.
>>>
>>> Within the sound deductive inference model {A, B, C, ¬A} never proves
>>> jack shit.
>>
>> Dodged again! Could it be that you still think that if {A, B, C} ⊦ X
>> then {A, B, C, ¬A} ⊬ X? We may never know because you seem determined
>> to avoid a straight answer. I think "I was wrong" is not a WFF in your
>> formal system.
>
> I didn't dodge.
Not this time, no. This time you have actually confirmed that you don't
mean the same thing that other people do when you write ⊦. You may
sometimes mean the same thing, but sometimes you don't. (You really
don't like to be understood do you?)
>>> A most fundamental premise is that all of the logic / math symbols
>>> retain their conventional semantic meaning.
>>
>> That's funny! You think symbols like + have one conventional meaning?
>> If you were a student, willing to learn, I'd ask you what the
>> conventional meaning of + is, and how you would specify it. The answer
>> would then determine the direction of the discussion. But I am hopeful
>> you won't try to answer this question, so I need not be prepared to
>> explain.
>
> I already provided the complete alogorithm for the conventional
> meaning of "+".
Ah, so the conventional meaning of addition does not apply to negative
numbers, fractions, reals, complex numbers, vectors, matrices and so on.
And since your code has some bugs, it's not really a good reference.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | David Kleinecke <dkleinecke@gmail.com> |
|---|---|
| Date | 2020-10-18 18:54 -0700 |
| Message-ID | <4ebb0446-3ea7-43bd-9912-28352d01c8ddo@googlegroups.com> |
| In reply to | #23973 |
On Sunday, October 18, 2020 at 4:05:39 PM UTC-7, olcott wrote: > On 10/18/2020 5:55 PM, David Kleinecke wrote: > > On Sunday, October 18, 2020 at 11:04:23 AM UTC-7, olcott wrote: > >> On 10/18/2020 12:44 PM, David Kleinecke wrote: > >>> On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: > >>>> On 10/18/2020 11:05 AM, David Kleinecke wrote: > >>>> > >>>>> Changing the name of something does not > >>>>> change its nature in any way. > >>>>> > >>>> > >>>> By changing its name we also change its category. > >>> > >>> OK. What do you mean here by "category"? > >>> > >> > >> When an undecidable sentence ceases to be construed as a valid sentence > > > > Aha. I see that you are associating the set of all things with > > a particular name with that name so that by changing the name > > you change the set membership. That is an especially primitive > > fallacy and probably has a name that I don't know. > > > > "When A ceases to be construed as B and is placed into C, D shifts > > from E to F." asserts that a change in name causes further changes. > > This is an error unless "construed as B" is not about the name but > > about the set membership. Names and set membership do not interact. > > Yes I an correcting its incorrect set membership. > > If a call a cat a dog yet the cat retains all the properties of a cat I > err. Calling a cat a dog changes nothing but its name. So you indeed err. > If I call a cat a dog because the cat has all the properties of a dog > and none of the properties of a cat then I have corrected a > classification error. > > Undecidable propositions are only undecidable because they are incorrect. > > > > >> that that a formal system can't prove and is placed into the category of > >> an incorrect expression of language the "blame" shifts from the formal > >> system to the expression of language. > >> > >> (T ⊬ φ) and (T ⊬ ¬φ). > >> Incomplete(T) and Correct(φ) has their categories changed to > >> ~Incomplete(T) and ~Correct(φ) > >> > >>> No theory I am aware of has a principal like the one > >>> you have just annunciated. > >>> > >> > >> Like I keep saying over and over and over: > >> I am talking about the steps required to verify that an expression of > >> language is true on the basis of the philosophical subject of > >> foundationalism. https://plato.stanford.edu/entries/justep-foundational/ > >> > >> Math really is not free to stipulate how the notion of Truth actually > >> works. This whole subject is even outside the realm of meta-math. > >> > >> -- > >> Copyright 2020 Pete Olcott > > > > > -- > Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 21:33 -0500 |
| Message-ID | <Y9idndQksa-NZhHCnZ2dnUU7-evNnZ2d@giganews.com> |
| In reply to | #23976 |
On 10/18/2020 8:54 PM, David Kleinecke wrote: > On Sunday, October 18, 2020 at 4:05:39 PM UTC-7, olcott wrote: >> On 10/18/2020 5:55 PM, David Kleinecke wrote: >>> On Sunday, October 18, 2020 at 11:04:23 AM UTC-7, olcott wrote: >>>> On 10/18/2020 12:44 PM, David Kleinecke wrote: >>>>> On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: >>>>>> On 10/18/2020 11:05 AM, David Kleinecke wrote: >>>>>> >>>>>>> Changing the name of something does not >>>>>>> change its nature in any way. >>>>>>> >>>>>> >>>>>> By changing its name we also change its category. >>>>> >>>>> OK. What do you mean here by "category"? >>>>> >>>> >>>> When an undecidable sentence ceases to be construed as a valid sentence >>> >>> Aha. I see that you are associating the set of all things with >>> a particular name with that name so that by changing the name >>> you change the set membership. That is an especially primitive >>> fallacy and probably has a name that I don't know. >>> >>> "When A ceases to be construed as B and is placed into C, D shifts >>> from E to F." asserts that a change in name causes further changes. >>> This is an error unless "construed as B" is not about the name but >>> about the set membership. Names and set membership do not interact. >> >> Yes I an correcting its incorrect set membership. >> >> If a call a cat a dog yet the cat retains all the properties of a cat I >> err. > > Calling a cat a dog changes nothing but its name. So you indeed err. Tarski's undefinability theorem is based on the unprovability of the Liar Paradox. The pathological self-reference of the Liar Paradox makes it erroneous. The definition of incpmpleteness ignores errors: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). > >> If I call a cat a dog because the cat has all the properties of a dog >> and none of the properties of a cat then I have corrected a >> classification error. >> >> Undecidable propositions are only undecidable because they are incorrect. >> >>> >>>> that that a formal system can't prove and is placed into the category of >>>> an incorrect expression of language the "blame" shifts from the formal >>>> system to the expression of language. >>>> >>>> (T ⊬ φ) and (T ⊬ ¬φ). >>>> Incomplete(T) and Correct(φ) has their categories changed to >>>> ~Incomplete(T) and ~Correct(φ) >>>> >>>>> No theory I am aware of has a principal like the one >>>>> you have just annunciated. >>>>> >>>> >>>> Like I keep saying over and over and over: >>>> I am talking about the steps required to verify that an expression of >>>> language is true on the basis of the philosophical subject of >>>> foundationalism. https://plato.stanford.edu/entries/justep-foundational/ >>>> >>>> Math really is not free to stipulate how the notion of Truth actually >>>> works. This whole subject is even outside the realm of meta-math. >>>> >>>> -- >>>> Copyright 2020 Pete Olcott >>> >> >> >> -- >> Copyright 2020 Pete Olcott > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2020-10-19 09:39 -0600 |
| Message-ID | <rmkc03$onb$2@dont-email.me> |
| In reply to | #23980 |
On 2020-10-18 20:33, olcott wrote: > On 10/18/2020 8:54 PM, David Kleinecke wrote: >> On Sunday, October 18, 2020 at 4:05:39 PM UTC-7, olcott wrote: >>> On 10/18/2020 5:55 PM, David Kleinecke wrote: >>>> On Sunday, October 18, 2020 at 11:04:23 AM UTC-7, olcott wrote: >>>>> On 10/18/2020 12:44 PM, David Kleinecke wrote: >>>>>> On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: >>>>>>> On 10/18/2020 11:05 AM, David Kleinecke wrote: >>>>>>> >>>>>>>> Changing the name of something does not >>>>>>>> change its nature in any way. >>>>>>>> >>>>>>> >>>>>>> By changing its name we also change its category. >>>>>> OK. What do you mean here by "category"? >>>>>> >>>>> >>>>> When an undecidable sentence ceases to be construed as a valid >>>>> sentence >>>> >>>> Aha. I see that you are associating the set of all things with >>>> a particular name with that name so that by changing the name >>>> you change the set membership. That is an especially primitive >>>> fallacy and probably has a name that I don't know. >>>> >>>> "When A ceases to be construed as B and is placed into C, D shifts >>>> from E to F." asserts that a change in name causes further changes. >>>> This is an error unless "construed as B" is not about the name but >>>> about the set membership. Names and set membership do not interact. >>> >>> Yes I an correcting its incorrect set membership. >>> >>> If a call a cat a dog yet the cat retains all the properties of a cat I >>> err. >> >> Calling a cat a dog changes nothing but its name. So you indeed err. > > Tarski's undefinability theorem is based on the unprovability of the > Liar Paradox. The pathological self-reference of the Liar Paradox makes > it erroneous. > > The definition of incpmpleteness ignores errors: > A theory T is incomplete if and only if there is some sentence φ such > that (T ⊬ φ) and (T ⊬ ¬φ). And why would that be an 'error'? Your calling it an error doesn't actually make it one. 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-19 11:41 -0500 |
| Message-ID | <ptWdnfh6ZJU3XBDCnZ2dnUU7-V-dnZ2d@giganews.com> |
| In reply to | #23982 |
On 10/19/2020 10:39 AM, André G. Isaak wrote: > On 2020-10-18 20:33, olcott wrote: >> On 10/18/2020 8:54 PM, David Kleinecke wrote: >>> On Sunday, October 18, 2020 at 4:05:39 PM UTC-7, olcott wrote: >>>> On 10/18/2020 5:55 PM, David Kleinecke wrote: >>>>> On Sunday, October 18, 2020 at 11:04:23 AM UTC-7, olcott wrote: >>>>>> On 10/18/2020 12:44 PM, David Kleinecke wrote: >>>>>>> On Sunday, October 18, 2020 at 9:17:05 AM UTC-7, olcott wrote: >>>>>>>> On 10/18/2020 11:05 AM, David Kleinecke wrote: >>>>>>>> >>>>>>>>> Changing the name of something does not >>>>>>>>> change its nature in any way. >>>>>>>>> >>>>>>>> >>>>>>>> By changing its name we also change its category. >>>>>>> OK. What do you mean here by "category"? >>>>>>> >>>>>> >>>>>> When an undecidable sentence ceases to be construed as a valid >>>>>> sentence >>>>> >>>>> Aha. I see that you are associating the set of all things with >>>>> a particular name with that name so that by changing the name >>>>> you change the set membership. That is an especially primitive >>>>> fallacy and probably has a name that I don't know. >>>>> >>>>> "When A ceases to be construed as B and is placed into C, D shifts >>>>> from E to F." asserts that a change in name causes further changes. >>>>> This is an error unless "construed as B" is not about the name but >>>>> about the set membership. Names and set membership do not interact. >>>> >>>> Yes I an correcting its incorrect set membership. >>>> >>>> If a call a cat a dog yet the cat retains all the properties of a cat I >>>> err. >>> >>> Calling a cat a dog changes nothing but its name. So you indeed err. >> >> Tarski's undefinability theorem is based on the unprovability of the >> Liar Paradox. The pathological self-reference of the Liar Paradox >> makes it erroneous. >> >> The definition of incpmpleteness ignores errors: >> A theory T is incomplete if and only if there is some sentence φ such >> that (T ⊬ φ) and (T ⊬ ¬φ). > > And why would that be an 'error'? Your calling it an error doesn't > actually make it one. > > André > Every expression of language that is neither provable nor refutable in any formal system what-so-ever because of the structure of the expression of language is not a truth bearer and thus not a part of any formal logical system. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-10-18 09:44 -0700 |
| Message-ID | <70bde453-b193-4924-b901-cc628a060f59n@googlegroups.com> |
| In reply to | #23946 |
On Sunday, 18 October 2020 at 17:05:10 UTC+1, dklei...@gmail.com wrote: > > That is: The error is: Changing the name of something does not > change its nature in any way. > That's not really true. Perception is not a passive process of registering sensory inputs. It's an active process of creating a mental model. And the words you use affect that model.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 13:47 -0500 |
| Message-ID | <UoydnTkX7JkwEBHCnZ2dnUU7-a3NnZ2d@giganews.com> |
| In reply to | #23957 |
On 10/18/2020 11:44 AM, Malcolm McLean wrote: > On Sunday, 18 October 2020 at 17:05:10 UTC+1, dklei...@gmail.com wrote: >> >> That is: The error is: Changing the name of something does not >> change its nature in any way. >> > That's not really true. Perception is not a passive process of registering > sensory inputs. It's an active process of creating a mental model. And > the words you use affect that model. > Yes exactly. If a formal system can neither prove nor disprove a closed WFF of its own language and there is no error in this closed WFF, then the formal system would be incomplete on the basis of not being able to prove or disprove a totally correct closed WFF. Everything changes when this closed WFF is known to be incorrect. -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-10-18 11:12 -0500 |
| Message-ID | <nIOdnXpOlcz_9BHCnZ2dnUU7-N2dnZ2d@giganews.com> |
| In reply to | #23938 |
On 10/18/2020 2:21 AM, André G. Isaak wrote: > On 2020-10-17 20:23, olcott wrote: >> On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>>> means Incorrect(φ) and not Incomplete(T) then we know that the >>>> existance of undecidable propositions does not ever never decide >>>> incomplete formal systems. >>> >>> You have nothing but this word game? Really? You are free to say that >>> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >>> Incomplete(T) (because that's just your own made-up predicate with a >>> deliberately confusing name), but you don't get to say that it does not >>> mean that T is incomplete (because that's not your word to redefine). >>> >> >> Heh at least we are finally on the same page of what I have been saying. >> Ultimately it is not up to any living being to stipulate the >> fundamental nature of truth itself, Truth totally speaks for itself on >> this. + >> >>> Some formal system have sentences that can't be proved or refuted from >>> the axioms and the rest of the world will continue to investigate these >>> systems, and to talk about their undecidable sentences, no matter what >>> name you give them. >>> >> Yes they will do this right on up to the point where they realize that >> they have been fooled the whole time. As soon as they realize that the >> only reason that some expressions of language are undecidable is that >> they are incorrect they will quit studying this. >> >>> And since there is no effective procedure to determine if Incorrect(φ), >> >> If there is no effective procedure to decide a sentence is incorrect >> then there is no effective procedure to decide that a formal system is >> incomplete because it is the exact same procedure. (Nitwit) > > Of course it isn't. There are some propositions which can be shown to be > undecidable. There is no general procedure for determining if a > proposition is undecidable. > > To show that a system is incomplete, one need only identify a single > proposition that can be shown to be undecidable. > > To exclude *every* undecidable proposition from a system, you actually > need a way of identifying every undecidable proposition which is > undecidable, and no such method exists. (1) A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). (2) An expression φ of the language of theory T is incorrect if and only if (T ⊬ φ) and (T ⊬ ¬φ). When we change (1) to (2) undecidable expressions of language φ never ever prove that theory T is incomplete. > > Since you cannot do this, you are effectively saying that you have a > system which generates all sorts of 'incorrect' propositions, but that, > except for a few special cases, you have no way of identifying which > propositions are 'correct' and which are 'incorrect'. > > André > > -- Copyright 2020 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-10-18 21:25 +0100 |
| Message-ID | <87o8kzi8mw.fsf@bsb.me.uk> |
| In reply to | #23934 |
olcott <NoOne@NoWhere.com> writes: > On 10/17/2020 8:25 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> If in every single case this (T ⊬ φ) and (T ⊬ ¬φ) >>> means Incorrect(φ) and not Incomplete(T) then we know that the >>> existance of undecidable propositions does not ever never decide >>> incomplete formal systems. >> >> You have nothing but this word game? Really? You are free to say that >> the existence of φ such that T ⊬ φ and T ⊬ ¬φ does not mean >> Incomplete(T) (because that's just your own made-up predicate with a >> deliberately confusing name), but you don't get to say that it does not >> mean that T is incomplete (because that's not your word to redefine). > > Heh at least we are finally on the same page of what I have been > saying. On the same page, eh? You agree that you were wrong to say that the existence of "undecidable propositions does not ever never decide incomplete formal systems"? Or is the page we are both on some other page? And you agree that you have nothing but a word game? Or is the page we are both on some other page? Or maybe you agree that Incomplete(T) is just your own made-up predicate with a deliberately confusing name? Or is the page we are both on some other page? > Ultimately it is not up to any living being to stipulate the > fundamental nature of truth itself, Truth totally speaks for itself on > this. + Ah. You are on some other page altogether. <cut> >> And since there is no effective procedure to determine if Incorrect(φ), > > If there is no effective procedure to decide a sentence is incorrect > then there is no effective procedure to decide that a formal system is > incomplete because it is the exact same procedure. (Nitwit) Let this piece of non-logic be you epitaph. Really, what needs to be said now? How can there be any logical discussion if this is how your mind works? -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 13 of 21 — ← Prev page 1 … 11 12 [13] 14 15 … 21 Next page →
Back to top | Article view | comp.theory
csiph-web