Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #29382 > unrolled thread
| Started by | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| First post | 2021-03-15 23:16 +0000 |
| Last post | 2021-03-15 19:49 -0500 |
| Articles | 20 on this page of 385 — 15 participants |
Back to article view | Back to comp.theory
olcott Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-15 23:16 +0000
Re: olcott "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 16:27 -0700
Re: olcott "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 16:33 -0700
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-15 18:49 -0500
Re: olcott Richard Damon <Richard@Damon-Family.org> - 2021-03-16 07:29 -0400
The key basis of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-03-16 08:30 -0500
Re: The key basis of the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-16 15:31 +0100
Re: The key basis of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-03-16 10:02 -0500
Re: The key basis of the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-16 16:23 +0100
Re: The key basis of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-03-16 10:44 -0500
Re: The key basis of the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-16 16:48 +0100
Re: olcott "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-16 11:40 -0700
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-15 18:45 -0500
Re: olcott Alan Mackenzie <acm@muc.de> - 2021-03-16 21:54 +0000
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-16 17:03 -0500
Re: olcott Alan Mackenzie <acm@muc.de> - 2021-03-16 22:21 +0000
Mistakes in evaluating my work olcott <NoOne@NoWhere.com> - 2021-03-16 17:35 -0500
Re: Mistakes in evaluating my work Alan Mackenzie <acm@muc.de> - 2021-03-16 22:56 +0000
Re: Mistakes in evaluating my work olcott <NoOne@NoWhere.com> - 2021-03-16 18:27 -0500
Re: Mistakes in evaluating my work "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-16 17:58 -0700
Re: Mistakes in evaluating my work olcott <NoOne@NoWhere.com> - 2021-03-16 20:09 -0500
Re: Mistakes in evaluating my work "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-16 18:44 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-16 20:48 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-17 15:00 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-17 17:10 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-17 17:20 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-17 15:22 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-17 17:36 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 15:43 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:34 -0400
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-18 22:39 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 00:03 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-18 23:14 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:08 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 10:39 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:09 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 16:18 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 15:27 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 16:42 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:54 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 17:03 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 22:29 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:51 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the G"odel sentence) R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 23:06 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 18:41 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 17:59 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 19:07 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 18:32 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 19:56 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 19:06 -0600
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 20:19 -0500
Re: Mistakes in evaluating my work (Wittgenstein) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 19:44 -0600
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:21 +0000
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 21:30 -0500
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:46 +0000
Re: Mistakes in evaluating my work (Wittgenstein) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 23:25 -0600
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:15 +0000
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 21:24 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:13 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 20:30 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 22:07 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 23:30 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 20:32 -0700
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:02 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 01:05 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 20:15 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:01 +0000
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 21:21 -0500
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:41 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-19 22:11 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 14:49 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:55 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 15:18 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 11:03 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 11:20 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 10:36 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 11:42 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 10:59 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 12:14 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 12:14 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 13:50 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 12:55 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 14:13 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 13:43 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 14:46 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 14:13 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 15:26 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 16:10 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 17:53 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 17:11 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 18:18 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 18:02 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:07 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 18:17 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:33 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 18:44 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:51 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 19:22 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 20:33 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 20:02 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 21:10 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 20:20 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 21:31 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 21:01 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 23:13 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 23:23 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 09:48 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-21 13:03 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-21 18:41 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 09:22 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 21:16 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-25 20:23 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 22:53 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-25 21:58 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:25 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-25 22:28 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:55 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-25 23:23 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 07:42 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 10:22 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) André G. Isaak <agisaak@gm.invalid> - 2021-03-26 17:14 -0600
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 19:59 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-26 09:44 -0700
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 12:52 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-26 19:10 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 14:34 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-26 23:21 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 18:53 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:14 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-27 13:21 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 09:05 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 13:38 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 14:52 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:02 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 04:48 -0700
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-27 12:37 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 08:53 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 08:34 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 10:44 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 18:33 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 18:46 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 18:45 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 13:51 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 23:30 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:00 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-21 07:47 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 10:19 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 16:43 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 11:56 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 11:17 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 12:27 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 11:53 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 13:10 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 13:12 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 12:49 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 14:25 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 13:36 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 15:07 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 16:51 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 18:03 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 18:23 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 19:37 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 18:51 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 20:07 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 19:24 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 20:37 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 03:41 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 09:48 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 14:58 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 10:12 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Alan Mackenzie <acm@muc.de> - 2021-03-23 15:58 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 11:04 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 10:30 -0600
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 11:43 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 11:46 -0600
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 12:58 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 22:03 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 21:58 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 16:41 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 12:10 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 17:36 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 12:53 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 23:14 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 18:36 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-24 00:56 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 20:22 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-23 18:28 -0700
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-24 17:17 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-24 12:25 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-24 13:45 -0700
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-23 18:30 -0700
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 19:35 -0600
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 22:00 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 23:37 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 21:53 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 16:00 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 11:24 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 16:42 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 21:48 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 16:10 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 19:50 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 14:49 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 19:32 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 14:51 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 17:22 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 12:31 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory)(V2) olcott <NoOne@NoWhere.com> - 2021-03-20 12:52 -0500
Re: Mistakes in evaluating my work (Wittgenstein) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 23:33 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:19 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:32 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 08:46 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:53 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 09:28 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Andy Walker <anw@cuboid.co.uk> - 2021-03-20 13:22 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Jeff Barnett <jbb@notatt.com> - 2021-03-20 11:11 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Andy Walker <anw@cuboid.co.uk> - 2021-03-20 17:57 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-20 13:02 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:00 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 18:05 -0600
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:54 +0000
Re: Mistakes in evaluating my work Richard Damon <Richard@Damon-Family.org> - 2021-03-18 07:27 -0400
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:53 +0000
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:52 +0000
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:43 +0000
Re: Mistakes in evaluating my work (Kaz mistake) olcott <NoOne@NoWhere.com> - 2021-03-16 20:58 -0500
Re: Mistakes in evaluating my work (Kaz mistake) Richard Damon <Richard@Damon-Family.org> - 2021-03-18 08:04 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] olcott <NoOne@NoWhere.com> - 2021-03-16 22:03 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 03:43 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] olcott <NoOne@NoWhere.com> - 2021-03-16 22:52 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 00:38 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-17 00:40 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 06:35 -0700
Re: Bob Andy Walker <anw@cuboid.co.uk> - 2021-03-17 20:10 +0000
Re: Bob Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 13:31 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-17 13:25 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 14:50 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 11:08 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 09:46 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 17:20 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 12:54 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 18:20 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 13:29 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 18:49 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 11:55 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 14:03 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 12:11 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 19:14 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 12:37 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 15:55 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 15:08 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 16:16 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 14:30 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 15:35 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 16:42 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 15:56 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 17:07 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 17:17 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 17:22 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 19:28 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 17:47 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-17 23:13 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 22:19 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 22:01 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 10:02 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-18 09:52 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 16:56 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 16:27 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 17:41 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:25 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:39 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 22:43 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 16:33 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 15:41 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 17:29 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-19 08:02 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 09:14 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 16:35 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 23:08 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 18:22 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 00:01 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 19:10 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 01:28 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 20:59 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:35 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 00:11 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 19:27 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 01:24 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 20:57 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 02:15 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 21:36 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:45 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:49 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 17:34 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 12:56 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 16:22 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:48 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 17:45 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 12:59 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 15:46 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 10:51 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 20:24 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 10:00 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 12:05 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 20:31 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 15:36 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:35 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 17:01 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 10:33 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 12:47 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 12:26 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 13:40 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 13:01 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 14:51 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 14:39 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:36 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 22:41 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:12 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 10:45 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 12:07 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 11:39 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 16:09 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 18:48 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 14:39 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 20:50 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 09:36 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 14:50 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 14:13 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 08:08 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 07:35 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-18 07:23 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 17:56 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 13:32 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 13:00 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [André is not too bright?] olcott <NoOne@NoWhere.com> - 2021-03-18 14:51 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:47 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 22:52 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 10:04 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 09:17 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:17 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 10:49 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 12:12 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 11:41 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 16:12 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-19 20:28 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 13:32 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 21:01 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:29 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 21:48 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-19 21:13 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 14:21 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 21:51 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-20 14:05 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-20 09:02 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:16 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-20 13:11 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 20:04 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 13:14 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 15:25 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:15 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 17:21 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:56 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 18:02 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:24 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 20:31 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 22:00 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 15:23 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:18 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:22 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-19 16:13 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:30 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-20 10:04 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-20 11:20 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-21 19:59 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-21 23:15 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-21 21:37 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-22 12:43 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-22 13:21 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-22 11:45 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-22 21:44 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-22 16:47 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-20 16:22 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-21 20:07 -0700
Re: Mistakes in evaluating my work Richard Damon <Richard@Damon-Family.org> - 2021-03-18 07:23 -0400
Re: olcott R Kym Horsell <kym@kymhorsell.com> - 2021-03-16 00:38 +0000
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-15 19:49 -0500
Page 8 of 20 — ← Prev page 1 … 6 7 [8] 9 10 … 20 Next page →
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-20 18:46 +0000 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <20210320114553.236@kylheku.com> |
| In reply to | #29787 |
On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: > Wittgenstein is based on the premise that the semantics specified by his > English sentence correspond to the logical sentence in Gödel's actual proof: I suspect your comprehension of written Austrian just isn't cutting it. Maybe there are some online courses you can take?
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-20 18:45 +0000 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <20210320114125.869@kylheku.com> |
| In reply to | #29786 |
On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: > Since I created how whole proof long before I ever heard of him I best > know what he means. Does that mean that in a parallel universe in which you will not learn about Wittgenstein until September 2022, you know even better what he means? In that universe, the time between your creation of whatever and learning about Wittgenstein is even longer, right? > it can be so interpreted that it says: > 'P is not provable in Russell's system'. That's literally what the sentence says about itself. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-20 13:51 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <cZmdnSiEqNWn2cv9nZ2dnUU7-LGdnZ2d@giganews.com> |
| In reply to | #29799 |
On 3/20/2021 1:45 PM, Kaz Kylheku wrote: > On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >> Since I created how whole proof long before I ever heard of him I best >> know what he means. > > Does that mean that in a parallel universe in which you will not learn > about Wittgenstein until September 2022, you know even better what he > means? In that universe, the time between your creation of whatever > and learning about Wittgenstein is even longer, right? > >> it can be so interpreted that it says: >> 'P is not provable in Russell's system'. > > That's literally what the sentence says about itself. > The self contradiction arise when the assertion of P contradicts the satisfaction of this same assertion. If P is satisfiable that means that P is unsatisfiable. If P is unsatisfiable that means that P is satisfiable. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-20 23:30 +0000 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <20210320162008.43@kylheku.com> |
| In reply to | #29802 |
On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: > On 3/20/2021 1:45 PM, Kaz Kylheku wrote: >> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >>> Since I created how whole proof long before I ever heard of him I best >>> know what he means. >> >> Does that mean that in a parallel universe in which you will not learn >> about Wittgenstein until September 2022, you know even better what he >> means? In that universe, the time between your creation of whatever >> and learning about Wittgenstein is even longer, right? >> >>> it can be so interpreted that it says: >>> 'P is not provable in Russell's system'. >> >> That's literally what the sentence says about itself. >> > > > The self contradiction arise when the assertion of P contradicts the > satisfaction of this same assertion. > > If P is satisfiable that means that P is unsatisfiable. > If P is unsatisfiable that means that P is satisfiable. No it isn't; the whole situation is satisfiable when P is taken as true. P says "P is unprovable". You have no inklink about how Gödel established this sentence; you should study how it actually works, rather than some second-rate misunderstandings by non-logician philosophers. You've studied how some halting proofs actually work, right? You might not understand or accept, but at least you have familiarity. Gödel actually showed a syntactically well-formed sentence which is actually not provably true, and which actually says that it is not true, without self-reference! The sentence has a copy of itself embedded inside, encoded as a number, and asserts that this number is not the number of a provable theorem. The pronoun "this" is not even available in the formal language in which that sentence is written. The sentence is completely well-formed. You can't argue with what was made. It's like arguing that a plastic Buddha with "made in China" stamped on the bottom doesn't exist, when it's before your very eyes. You should also study this section of the Wikipedia page on Gödel's Incompleteness Theorems, which talks about the relationship between that an the Liar Paradox: https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems#Relationship_with_the_liar_paradox Especially this: It is not possible to replace "not provable" with "false" in a Gödel sentence because the predicate "Q is the Gödel number of a false formula" cannot be represented as a formula of arithmetic. This result, known as Tarski's undefinability theorem, was discovered independently both by Gödel, when he was working on the proof of the incompleteness theorem, and by the theorem's namesake, Alfred Tarski. See? In Gödel's sentence P, "P is not provable" *cannot* be turned into "P is not true" (Liar Paradox). I.e. it is not the Liar Paradox, and *cannot* be. In a nutshell the Liar Paradox is ill-formed bunk, whereas the Gödel sentence isn't. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-20 19:00 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <E4GdncBVkogBEcv9nZ2dnUU7-SHNnZ2d@giganews.com> |
| In reply to | #29814 |
On 3/20/2021 6:30 PM, Kaz Kylheku wrote: > On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >> On 3/20/2021 1:45 PM, Kaz Kylheku wrote: >>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >>>> Since I created how whole proof long before I ever heard of him I best >>>> know what he means. >>> >>> Does that mean that in a parallel universe in which you will not learn >>> about Wittgenstein until September 2022, you know even better what he >>> means? In that universe, the time between your creation of whatever >>> and learning about Wittgenstein is even longer, right? >>> >>>> it can be so interpreted that it says: >>>> 'P is not provable in Russell's system'. >>> >>> That's literally what the sentence says about itself. >>> >> >> >> The self contradiction arise when the assertion of P contradicts the >> satisfaction of this same assertion. >> >> If P is satisfiable that means that P is unsatisfiable. >> If P is unsatisfiable that means that P is satisfiable. > > No it isn't; the whole situation is satisfiable when P is taken > as true. P says "P is unprovable". > > You have no inklink about how Gödel established this sentence; you > should study how it actually works, rather than some second-rate > misunderstandings by non-logician philosophers. We are not considering that. We are hypothesizing that Wittgenstein's and Gödel's English summation accurately represents Gödel's actual logic sentence. it can be so interpreted that it says: 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) We are therefore confronted with a proposition which asserts its own unprovability. (Gödel:1931:40). On this basis P contradicts its own satisfiability and ~P contradicts its own satisfiability in the same way that the Liar Paradox does. If the Liar Paradox it true that makes it false. If the Liar Paradox it false that makes it true. If P is false that means: suppose it were false; then it is true that it is provable. [negation is satisfied] And that surely cannot be! And if it is proved, then it is proved that it is not provable. Thus it can only be true, but unprovable. " (Wittgenstein: 1983) "it is proved that it is not provable": a contradiction If P is true then: If you assume that the proposition is provable in Russell's system, [sentence is satisfied] that means it' is true in the Russell sense, and the interpretation "P is not provable" again has to be given up (Wittgenstein: 1983) true and unprovable are another contradiction Wittgenstein, Ludwig 1983. Remarks on the Foundations of Mathematics (Appendix III), 118-119. Cambridge, Massachusetts and London, England: The MIT Press Godel, Kurt 1931. On Formally Undecidable Propositions of Principia Mathematica And Related Systems I, page 39-41. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-21 07:47 +0000 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <20210320190122.565@kylheku.com> |
| In reply to | #29815 |
On 2021-03-21, olcott <NoOne@NoWhere.com> wrote: > On 3/20/2021 6:30 PM, Kaz Kylheku wrote: >> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >>> On 3/20/2021 1:45 PM, Kaz Kylheku wrote: >>>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >>>>> Since I created how whole proof long before I ever heard of him I best >>>>> know what he means. >>>> >>>> Does that mean that in a parallel universe in which you will not learn >>>> about Wittgenstein until September 2022, you know even better what he >>>> means? In that universe, the time between your creation of whatever >>>> and learning about Wittgenstein is even longer, right? >>>> >>>>> it can be so interpreted that it says: >>>>> 'P is not provable in Russell's system'. >>>> >>>> That's literally what the sentence says about itself. >>>> >>> >>> >>> The self contradiction arise when the assertion of P contradicts the >>> satisfaction of this same assertion. >>> >>> If P is satisfiable that means that P is unsatisfiable. >>> If P is unsatisfiable that means that P is satisfiable. >> >> No it isn't; the whole situation is satisfiable when P is taken >> as true. P says "P is unprovable". >> >> You have no inklink about how Gödel established this sentence; you >> should study how it actually works, rather than some second-rate >> misunderstandings by non-logician philosophers. > We are not considering that. We are hypothesizing that Wittgenstein's > and Gödel's English summation accurately represents Gödel's actual logic > sentence. You are demonstrating that you 're not able to read Wittgenstein's sentences properly, /and/ you don't understand how the Gödel sentence is constructed. You might as well be a goose discussing lager versus ale. > it can be so interpreted that it says: > 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) Well, yes. > We are therefore confronted with a proposition which asserts its own > unprovability. (Gödel:1931:40). So, Gödel they precisely agree here; what's your point? The controversial thing that Wittgenstein said is a few paragraphs down from your quote. You did quote it earlier. He puts his foot squarely in his mouth by claiming that in Russel's system provable implies true, and that true implies provable. It was published posthumously. The dead don't get a chance to re-read their manuscript one last time prior to posthumous publication, don't get to publish errata or wipe eggs off their faces. > On this basis P contradicts its own satisfiability and ~P contradicts > its own satisfiability in the same way that the Liar Paradox does. > > If the Liar Paradox it true that makes it false. > If the Liar Paradox it false that makes it true. Absolutely not in the same way, and Gödel himself deterimined that a Liar paradox sentence could specifically not be constructed as he constructed the Gödel sentence. A statement which asserts that it is not provable is utterly in a different category from one which asserts its own falsehood. The existence of unprovable truths in the world is obvious. If you're the only witness to a murder which leaves no circumstantial evidence whatsoever, your identification of the perpetrator may be true, but is unprovable. > If P is false that means: > suppose it were false; then it is true that it is provable. [negation is > satisfied] And that surely cannot be! And if it is proved, then it is > proved that it is not provable. Thus it can only be true, but > unprovable. " (Wittgenstein: 1983) > > "it is proved that it is not provable": a contradiction But no such thing is being proved at all. What is being proved is the proposition "If Gödel's sentence is true, Russel's system is incomplete: there are truths it cannot prove; else Gödel's sentence is false, in which case a falsehood is provable in Russel's system, making it inconsistent". When Gödel's recipe is followed to construct a P which asserts "G is not the Gödel number of an provable proposition", such that the Gödel number of that proposition is G, it is not known whether G is true or not. All that is known is that it either must be true or not. Either possibilility has alarming consequences which shatter the belief that Russel's system is complete and consistent. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 10:19 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <9pudnVajQI3uKMX9nZ2dnUU7-cPNnZ2d@giganews.com> |
| In reply to | #29831 |
On 3/21/2021 2:47 AM, Kaz Kylheku wrote: > On 2021-03-21, olcott <NoOne@NoWhere.com> wrote: >> On 3/20/2021 6:30 PM, Kaz Kylheku wrote: >>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >>>> On 3/20/2021 1:45 PM, Kaz Kylheku wrote: >>>>> On 2021-03-20, olcott <NoOne@NoWhere.com> wrote: >>>>>> Since I created how whole proof long before I ever heard of him I best >>>>>> know what he means. >>>>> >>>>> Does that mean that in a parallel universe in which you will not learn >>>>> about Wittgenstein until September 2022, you know even better what he >>>>> means? In that universe, the time between your creation of whatever >>>>> and learning about Wittgenstein is even longer, right? >>>>> >>>>>> it can be so interpreted that it says: >>>>>> 'P is not provable in Russell's system'. >>>>> >>>>> That's literally what the sentence says about itself. >>>>> >>>> >>>> >>>> The self contradiction arise when the assertion of P contradicts the >>>> satisfaction of this same assertion. >>>> >>>> If P is satisfiable that means that P is unsatisfiable. >>>> If P is unsatisfiable that means that P is satisfiable. >>> >>> No it isn't; the whole situation is satisfiable when P is taken >>> as true. P says "P is unprovable". >>> >>> You have no inklink about how Gödel established this sentence; you >>> should study how it actually works, rather than some second-rate >>> misunderstandings by non-logician philosophers. >> We are not considering that. We are hypothesizing that Wittgenstein's >> and Gödel's English summation accurately represents Gödel's actual logic >> sentence. > > You are demonstrating that you 're not able to read Wittgenstein's > sentences properly, /and/ you don't understand how the Gödel sentence is > constructed. "I have constructed a proposition (I will use 'P' to designate it) in Russell's symbolism, and by means of certain definitions and transformations it can be so interpreted that it says: 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) Formalized in Minimal Type Theory as: P := (RS ⊬ P) Wittgenstein, Ludwig 1983. Remarks on the Foundations of Mathematics (Appendix III), 118-119. Cambridge, Massachusetts and London, England: The MIT Press https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF > > You might as well be a goose discussing lager versus ale. > >> it can be so interpreted that it says: >> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) > > Well, yes. > >> We are therefore confronted with a proposition which asserts its own >> unprovability. (Gödel:1931:40). > P := (RS ⊬ P) > So, Gödel they precisely agree here; what's your point? > > The controversial thing that Wittgenstein said is a few paragraphs down > from your quote. You did quote it earlier. He puts his foot squarely in > his mouth by claiming that in Russel's system provable implies true, > and that true implies provable. https://plato.stanford.edu/entries/tarski-truth/#StaTruDef a satisfies the formula F a satisfies the formula F if and only if taking each free variable in F as a name of the object assigned to it by a makes the formula F into a true sentence. A sentence with no free variables is either satisfied or unsatisfiable. > It was published posthumously. The dead don't get a chance to re-read > their manuscript one last time prior to posthumous publication, don't > get to publish errata or wipe eggs off their faces. > >> On this basis P contradicts its own satisfiability and ~P contradicts >> its own satisfiability in the same way that the Liar Paradox does. >> >> If the Liar Paradox it true that makes it false. >> If the Liar Paradox it false that makes it true. > > Absolutely not in the same way, and Gödel himself deterimined that a > Liar paradox sentence could specifically not be constructed as > he constructed the Gödel sentence. > > A statement which asserts that it is not provable is utterly in a > different category from one which asserts its own falsehood. Not when we use Taski's standard truth definition: a satisfies the formula F > The existence of unprovable truths in the world is obvious. If you're > the only witness to a murder which leaves no circumstantial evidence > whatsoever, your identification of the perpetrator may be true, but is > unprovable. The formal system that I am referring to is the body of knowledge that can be represented using language. If it is unknown then it is not knowledge. >> If P is false that means: >> suppose it were false; then it is true that it is provable. [negation is >> satisfied] And that surely cannot be! And if it is proved, then it is >> proved that it is not provable. Thus it can only be true, but >> unprovable. " (Wittgenstein: 1983) >> >> "it is proved that it is not provable": a contradiction > > But no such thing is being proved at all. What is being proved > is the proposition "If Gödel's sentence is true, Russel's system P := (RS ⊬ P) Then this formula is satisfied: (RS ⊢ (RS ⊬ P)) > is incomplete: there are truths it cannot prove; else Gödel's sentence > is false, in which case a falsehood is provable in Russel's system, > making it inconsistent". > > When Gödel's recipe is followed to construct a P which asserts "G is > not the Gödel number of an provable proposition", such that the > Gödel number of that proposition is G, it is not known whether G > is true or not. All that is known is that it either must be true or not. > Either possibilility has alarming consequences which shatter the > belief that Russel's system is complete and consistent. > <sarcasm> Yes of course when an expression of language asserts that it cannot be proved to be unprovable in Russell's System the self contradiction has nothing to do with its unsatisfiability, any formal system worth its salt can prove that contradictions are satisfiable therefore no formal system is worth its salt. </sarcasm> Alternatively we can correct this nonsense and reject self-contradictory senences as semantically ill-formed propositions having no truth value because they are not truth bearers. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-22 16:43 +0000 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <20210322093720.44@kylheku.com> |
| In reply to | #29849 |
On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: > Not when we use Taski's standard truth definition: > a satisfies the formula F Why would we use some naive truth definition from a time before knowledge of Gödel's work? > Alternatively we can correct this nonsense and reject self-contradictory > senences as semantically ill-formed propositions having no truth value > because they are not truth bearers. Firstly, you are infatuated with those sentences; you keep bringing them up. Secondly, this is not one of those sentences, no matter how much you want it to be. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 11:56 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <XrOdnaw8-b2xUcX9nZ2dnUU7-YfNnZ2d@giganews.com> |
| In reply to | #29850 |
On 3/22/2021 11:43 AM, Kaz Kylheku wrote: > On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >> Not when we use Taski's standard truth definition: >> a satisfies the formula F > > Why would we use some naive truth definition from a time before > knowledge of Gödel's work? > >> Alternatively we can correct this nonsense and reject self-contradictory >> senences as semantically ill-formed propositions having no truth value >> because they are not truth bearers. > > Firstly, you are infatuated with those sentences; you keep bringing > them up. > > Secondly, this is not one of those sentences, no matter how much you > want it to be. > Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is based on the premise that the semantics specified by his English sentence correspond to the logic sentence in Gödel's actual proof: "I have constructed a proposition (I will use 'P' to designate it) in Russell's symbolism, and by means of certain definitions and transformations it can be so interpreted that it says: 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) Since Gödel himself says the same thing this is a reasonable position to take: We are therefore confronted with a proposition which asserts its own unprovability. (Gödel:1931:40). P says of itself that it is not provable in Russell's System The only reason why the self-contradictory nature of this sentence cannot be evaluated in symbolic logic is that the actual sentence is inexpressible in symbolic logic. (Formalized in Minimal Type Theory) P := (RS ⊬ P) https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF Wittgenstein, Ludwig 1983. Remarks on the Foundations of Mathematics (Appendix III), 118-119. Cambridge, Massachusetts and London, England: The MIT Press Godel, Kurt 1931. On Formally Undecidable Propositions of Principia Mathematica And Related Systems I, page 39-41. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-22 11:17 -0600 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <s3ajfv$6s6$1@dont-email.me> |
| In reply to | #29851 |
On 2021-03-22 10:56, olcott wrote: > On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>> Not when we use Taski's standard truth definition: >>> a satisfies the formula F >> >> Why would we use some naive truth definition from a time before >> knowledge of Gödel's work? >> >>> Alternatively we can correct this nonsense and reject self-contradictory >>> senences as semantically ill-formed propositions having no truth value >>> because they are not truth bearers. >> >> Firstly, you are infatuated with those sentences; you keep bringing >> them up. >> >> Secondly, this is not one of those sentences, no matter how much you >> want it to be. >> > > Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is based > on the premise that the semantics specified by his English sentence > correspond to the logic sentence in Gödel's actual proof: Which it doesn't. That's an informal analogy used in explaining the proof to those who can't follow the actual math. People who can't follow the actual math should learn to do so before trying to argue about it. > "I have constructed a proposition (I will use 'P' to designate it) in > Russell's symbolism, and by means of certain definitions and > transformations it can be so interpreted that it says: > 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) > > Since Gödel himself says the same thing this is a reasonable position to > take: > > We are therefore confronted with a proposition which asserts its own > unprovability. (Gödel:1931:40). Except you fail to understand exactly *how* it asserts this. HINT: It doesn't do it directly; the actual content of Gödel's G is a statement about arithmetic. It doesn't assert anything about itself. > P says of itself that it is not provable in Russell's System > > The only reason why the self-contradictory nature of this sentence > cannot be evaluated in symbolic logic is that the actual sentence is > inexpressible in symbolic logic. > > (Formalized in Minimal Type Theory) P := (RS ⊬ P) Which isn't Gödel's G. It isn't anything at all since that's not a valid proposition. You fail to grasp that definitions are not sentences of logic and do not represent propositions. If they were, then things like the following would make sense. They do not: A → (B := C) André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 12:27 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <xo2dnV-SFOUTTsX9nZ2dnUU7-N3NnZ2d@giganews.com> |
| In reply to | #29852 |
On 3/22/2021 12:17 PM, André G. Isaak wrote: > On 2021-03-22 10:56, olcott wrote: >> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>> Not when we use Taski's standard truth definition: >>>> a satisfies the formula F >>> >>> Why would we use some naive truth definition from a time before >>> knowledge of Gödel's work? >>> >>>> Alternatively we can correct this nonsense and reject >>>> self-contradictory >>>> senences as semantically ill-formed propositions having no truth value >>>> because they are not truth bearers. >>> >>> Firstly, you are infatuated with those sentences; you keep bringing >>> them up. >>> >>> Secondly, this is not one of those sentences, no matter how much you >>> want it to be. >>> >> >> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >> based on the premise that the semantics specified by his English >> sentence correspond to the logic sentence in Gödel's actual proof: > > Which it doesn't. That's an informal analogy used in explaining the > proof to those who can't follow the actual math. People who can't follow > the actual math should learn to do so before trying to argue about it. > >> "I have constructed a proposition (I will use 'P' to designate it) in >> Russell's symbolism, and by means of certain definitions and >> transformations it can be so interpreted that it says: >> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >> >> Since Gödel himself says the same thing this is a reasonable position >> to take: >> >> We are therefore confronted with a proposition which asserts its own >> unprovability. (Gödel:1931:40). > > Except you fail to understand exactly *how* it asserts this. HINT: It > doesn't do it directly; the actual content of Gödel's G is a statement > about arithmetic. It doesn't assert anything about itself. > (1) The next sentence is true. (2) The prior sentence is not true. is equivalent to This sentence is not true. >> P says of itself that it is not provable in Russell's System >> >> The only reason why the self-contradictory nature of this sentence >> cannot be evaluated in symbolic logic is that the actual sentence is >> inexpressible in symbolic logic. >> >> (Formalized in Minimal Type Theory) P := (RS ⊬ P) > > Which isn't Gödel's G. It isn't anything at all since that's not a valid > proposition. > > You fail to grasp that definitions are not sentences of logic and do not > represent propositions. The closest thing that was available in symboloc logic to a self-reference operator was the definition symbol so MTT uses the definition symbol as its self-reference operator. LP := ~True(LP) > If they were, then things like the following > would make sense. They do not: > > A → (B := C) > > André > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-22 11:53 -0600 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <s3alj1$n86$1@dont-email.me> |
| In reply to | #29854 |
On 2021-03-22 11:27, olcott wrote: > On 3/22/2021 12:17 PM, André G. Isaak wrote: >> On 2021-03-22 10:56, olcott wrote: >>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>> Not when we use Taski's standard truth definition: >>>>> a satisfies the formula F >>>> >>>> Why would we use some naive truth definition from a time before >>>> knowledge of Gödel's work? >>>> >>>>> Alternatively we can correct this nonsense and reject >>>>> self-contradictory >>>>> senences as semantically ill-formed propositions having no truth value >>>>> because they are not truth bearers. >>>> >>>> Firstly, you are infatuated with those sentences; you keep bringing >>>> them up. >>>> >>>> Secondly, this is not one of those sentences, no matter how much you >>>> want it to be. >>>> >>> >>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >>> based on the premise that the semantics specified by his English >>> sentence correspond to the logic sentence in Gödel's actual proof: >> >> Which it doesn't. That's an informal analogy used in explaining the >> proof to those who can't follow the actual math. People who can't >> follow the actual math should learn to do so before trying to argue >> about it. >> >>> "I have constructed a proposition (I will use 'P' to designate it) in >>> Russell's symbolism, and by means of certain definitions and >>> transformations it can be so interpreted that it says: >>> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >>> >>> Since Gödel himself says the same thing this is a reasonable position >>> to take: >>> >>> We are therefore confronted with a proposition which asserts its own >>> unprovability. (Gödel:1931:40). >> >> Except you fail to understand exactly *how* it asserts this. HINT: It >> doesn't do it directly; the actual content of Gödel's G is a statement >> about arithmetic. It doesn't assert anything about itself. >> > > (1) The next sentence is true. > (2) The prior sentence is not true. > is equivalent to > This sentence is not true. And neither of those resemble Gödel's G. As I said, Gödel's G is a statement of arithmetic. Why don't you go find it in the actual proof rather than make stuff up about what it may or may not say? >>> P says of itself that it is not provable in Russell's System >>> >>> The only reason why the self-contradictory nature of this sentence >>> cannot be evaluated in symbolic logic is that the actual sentence is >>> inexpressible in symbolic logic. >>> >>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >> >> Which isn't Gödel's G. It isn't anything at all since that's not a >> valid proposition. >> >> You fail to grasp that definitions are not sentences of logic and do >> not represent propositions. > > The closest thing that was available in symboloc logic to a > self-reference operator was the definition symbol so MTT uses the > definition symbol as its self-reference operator. > > LP := ~True(LP) The above doesn't express self-reference at all. There is no 'this' in that 'equation'. Even if you did find some way of incorporating self-reference into the above, it would still bear no resemblance to Gödel's G. This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He was working in standard logic which lacks any such 'operator'. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 13:10 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <XpmdnTxMkogoQMX9nZ2dnUU7-N_NnZ2d@giganews.com> |
| In reply to | #29857 |
On 3/22/2021 12:53 PM, André G. Isaak wrote: > On 2021-03-22 11:27, olcott wrote: >> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>> On 2021-03-22 10:56, olcott wrote: >>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>> Not when we use Taski's standard truth definition: >>>>>> a satisfies the formula F >>>>> >>>>> Why would we use some naive truth definition from a time before >>>>> knowledge of Gödel's work? >>>>> >>>>>> Alternatively we can correct this nonsense and reject >>>>>> self-contradictory >>>>>> senences as semantically ill-formed propositions having no truth >>>>>> value >>>>>> because they are not truth bearers. >>>>> >>>>> Firstly, you are infatuated with those sentences; you keep bringing >>>>> them up. >>>>> >>>>> Secondly, this is not one of those sentences, no matter how much you >>>>> want it to be. >>>>> >>>> >>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >>>> based on the premise that the semantics specified by his English >>>> sentence correspond to the logic sentence in Gödel's actual proof: >>> >>> Which it doesn't. That's an informal analogy used in explaining the >>> proof to those who can't follow the actual math. People who can't >>> follow the actual math should learn to do so before trying to argue >>> about it. >>> >>>> "I have constructed a proposition (I will use 'P' to designate it) >>>> in Russell's symbolism, and by means of certain definitions and >>>> transformations it can be so interpreted that it says: >>>> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >>>> >>>> Since Gödel himself says the same thing this is a reasonable >>>> position to take: >>>> >>>> We are therefore confronted with a proposition which asserts its own >>>> unprovability. (Gödel:1931:40). >>> >>> Except you fail to understand exactly *how* it asserts this. HINT: It >>> doesn't do it directly; the actual content of Gödel's G is a >>> statement about arithmetic. It doesn't assert anything about itself. >>> >> >> (1) The next sentence is true. >> (2) The prior sentence is not true. >> is equivalent to >> This sentence is not true. > > And neither of those resemble Gödel's G. As I said, Gödel's G is a > statement of arithmetic. Why don't you go find it in the actual proof > rather than make stuff up about what it may or may not say? > a proposition... begins by asserting the unprovability of a wholly determinate formula... this formula is precisely that by which the proposition was itself expressed. (Gödel:1931:41). >>>> P says of itself that it is not provable in Russell's System >>>> >>>> The only reason why the self-contradictory nature of this sentence >>>> cannot be evaluated in symbolic logic is that the actual sentence is >>>> inexpressible in symbolic logic. >>>> >>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>> >>> Which isn't Gödel's G. It isn't anything at all since that's not a >>> valid proposition. >>> >>> You fail to grasp that definitions are not sentences of logic and do >>> not represent propositions. >> >> The closest thing that was available in symboloc logic to a >> self-reference operator was the definition symbol so MTT uses the >> definition symbol as its self-reference operator. >> >> LP := ~True(LP) > > The above doesn't express self-reference at all. There is no 'this' in > that 'equation'. Even if you did find some way of incorporating > self-reference into the above, it would still bear no resemblance to > Gödel's G. > This sentence is not true says: ~True(L~True(L~True(L~True(L~True(...))))) This sentence is not provable in RS P := (RS ⊬ P) (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ ...))))) > This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He was > working in standard logic which lacks any such 'operator'. When you make the semantics of actual self-reference inexpressible in the formal system that makes the formal system incapable of correctly evalating the actual expression. > > André > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 13:12 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <D92dnQkk3OONQ8X9nZ2dnUU7-amdnZ2d@giganews.com> |
| In reply to | #29858 |
On 3/22/2021 1:10 PM, olcott wrote: > On 3/22/2021 12:53 PM, André G. Isaak wrote: >> On 2021-03-22 11:27, olcott wrote: >>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>> On 2021-03-22 10:56, olcott wrote: >>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>> Not when we use Taski's standard truth definition: >>>>>>> a satisfies the formula F >>>>>> >>>>>> Why would we use some naive truth definition from a time before >>>>>> knowledge of Gödel's work? >>>>>> >>>>>>> Alternatively we can correct this nonsense and reject >>>>>>> self-contradictory >>>>>>> senences as semantically ill-formed propositions having no truth >>>>>>> value >>>>>>> because they are not truth bearers. >>>>>> >>>>>> Firstly, you are infatuated with those sentences; you keep bringing >>>>>> them up. >>>>>> >>>>>> Secondly, this is not one of those sentences, no matter how much you >>>>>> want it to be. >>>>>> >>>>> >>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >>>>> based on the premise that the semantics specified by his English >>>>> sentence correspond to the logic sentence in Gödel's actual proof: >>>> >>>> Which it doesn't. That's an informal analogy used in explaining the >>>> proof to those who can't follow the actual math. People who can't >>>> follow the actual math should learn to do so before trying to argue >>>> about it. >>>> >>>>> "I have constructed a proposition (I will use 'P' to designate it) >>>>> in Russell's symbolism, and by means of certain definitions and >>>>> transformations it can be so interpreted that it says: >>>>> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >>>>> >>>>> Since Gödel himself says the same thing this is a reasonable >>>>> position to take: >>>>> >>>>> We are therefore confronted with a proposition which asserts its >>>>> own unprovability. (Gödel:1931:40). >>>> >>>> Except you fail to understand exactly *how* it asserts this. HINT: >>>> It doesn't do it directly; the actual content of Gödel's G is a >>>> statement about arithmetic. It doesn't assert anything about itself. >>>> >>> >>> (1) The next sentence is true. >>> (2) The prior sentence is not true. >>> is equivalent to >>> This sentence is not true. >> >> And neither of those resemble Gödel's G. As I said, Gödel's G is a >> statement of arithmetic. Why don't you go find it in the actual proof >> rather than make stuff up about what it may or may not say? >> > > a proposition... > begins by asserting the unprovability of a wholly determinate formula... > this formula is precisely that by which the proposition was itself > expressed. (Gödel:1931:41). > > >>>>> P says of itself that it is not provable in Russell's System >>>>> >>>>> The only reason why the self-contradictory nature of this sentence >>>>> cannot be evaluated in symbolic logic is that the actual sentence >>>>> is inexpressible in symbolic logic. >>>>> >>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>> >>>> Which isn't Gödel's G. It isn't anything at all since that's not a >>>> valid proposition. >>>> >>>> You fail to grasp that definitions are not sentences of logic and do >>>> not represent propositions. >>> >>> The closest thing that was available in symboloc logic to a >>> self-reference operator was the definition symbol so MTT uses the >>> definition symbol as its self-reference operator. >>> >>> LP := ~True(LP) >> >> The above doesn't express self-reference at all. There is no 'this' in >> that 'equation'. Even if you did find some way of incorporating >> self-reference into the above, it would still bear no resemblance to >> Gödel's G. >> > > This sentence is not true says: > ~True(L~True(L~True(L~True(L~True(...))))) Correction: ~True(~True(~True(~True(~True(...))))) > > This sentence is not provable in RS > P := (RS ⊬ P) > (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ ...))))) > >> This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He >> was working in standard logic which lacks any such 'operator'. > > When you make the semantics of actual self-reference inexpressible in > the formal system that makes the formal system incapable of correctly > evalating the actual expression. > >> >> André >> > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-22 12:49 -0600 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <s3aorp$geh$1@dont-email.me> |
| In reply to | #29858 |
On 2021-03-22 12:10, olcott wrote: > On 3/22/2021 12:53 PM, André G. Isaak wrote: >> On 2021-03-22 11:27, olcott wrote: >>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>> On 2021-03-22 10:56, olcott wrote: >>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>> Not when we use Taski's standard truth definition: >>>>>>> a satisfies the formula F >>>>>> >>>>>> Why would we use some naive truth definition from a time before >>>>>> knowledge of Gödel's work? >>>>>> >>>>>>> Alternatively we can correct this nonsense and reject >>>>>>> self-contradictory >>>>>>> senences as semantically ill-formed propositions having no truth >>>>>>> value >>>>>>> because they are not truth bearers. >>>>>> >>>>>> Firstly, you are infatuated with those sentences; you keep bringing >>>>>> them up. >>>>>> >>>>>> Secondly, this is not one of those sentences, no matter how much you >>>>>> want it to be. >>>>>> >>>>> >>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >>>>> based on the premise that the semantics specified by his English >>>>> sentence correspond to the logic sentence in Gödel's actual proof: >>>> >>>> Which it doesn't. That's an informal analogy used in explaining the >>>> proof to those who can't follow the actual math. People who can't >>>> follow the actual math should learn to do so before trying to argue >>>> about it. >>>> >>>>> "I have constructed a proposition (I will use 'P' to designate it) >>>>> in Russell's symbolism, and by means of certain definitions and >>>>> transformations it can be so interpreted that it says: >>>>> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >>>>> >>>>> Since Gödel himself says the same thing this is a reasonable >>>>> position to take: >>>>> >>>>> We are therefore confronted with a proposition which asserts its >>>>> own unprovability. (Gödel:1931:40). >>>> >>>> Except you fail to understand exactly *how* it asserts this. HINT: >>>> It doesn't do it directly; the actual content of Gödel's G is a >>>> statement about arithmetic. It doesn't assert anything about itself. >>>> >>> >>> (1) The next sentence is true. >>> (2) The prior sentence is not true. >>> is equivalent to >>> This sentence is not true. >> >> And neither of those resemble Gödel's G. As I said, Gödel's G is a >> statement of arithmetic. Why don't you go find it in the actual proof >> rather than make stuff up about what it may or may not say? >> > > a proposition... > begins by asserting the unprovability of a wholly determinate formula... > this formula is precisely that by which the proposition was itself > expressed. (Gödel:1931:41). > > >>>>> P says of itself that it is not provable in Russell's System >>>>> >>>>> The only reason why the self-contradictory nature of this sentence >>>>> cannot be evaluated in symbolic logic is that the actual sentence >>>>> is inexpressible in symbolic logic. >>>>> >>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>> >>>> Which isn't Gödel's G. It isn't anything at all since that's not a >>>> valid proposition. >>>> >>>> You fail to grasp that definitions are not sentences of logic and do >>>> not represent propositions. >>> >>> The closest thing that was available in symboloc logic to a >>> self-reference operator was the definition symbol so MTT uses the >>> definition symbol as its self-reference operator. >>> >>> LP := ~True(LP) >> >> The above doesn't express self-reference at all. There is no 'this' in >> that 'equation'. Even if you did find some way of incorporating >> self-reference into the above, it would still bear no resemblance to >> Gödel's G. >> > > This sentence is not true says: > ~True(L~True(L~True(L~True(L~True(...))))) No. It doesn't. Does "This sentence contains five words" say "This sentence contains five words contains five words contains five words...". If it did, it would be false. But it isn't false. It is true. Self-reference is more complex than you make it out to be. Your 'macro expansion' might work like you claim, but that's because it doesn't actually capture self-reference. Self-reference of the type you keep raising is a property of *natural* language. You can't use natural language examples to make points about the syntax or semantics of formal languages. > This sentence is not provable in RS > P := (RS ⊬ P) > (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ ...))))) > >> This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He >> was working in standard logic which lacks any such 'operator'. > > When you make the semantics of actual self-reference inexpressible in > the formal system that makes the formal system incapable of correctly > evalating the actual expression. > Correctly evaluating which actual expression? Gödel's G doesn't involve self-reference, so why would you need the semantics of self-reference to be expressible to evaluate it? André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 14:25 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <Q5qdnSi9OfCJcsX9nZ2dnUU7-LPNnZ2d@giganews.com> |
| In reply to | #29860 |
On 3/22/2021 1:49 PM, André G. Isaak wrote: > On 2021-03-22 12:10, olcott wrote: >> On 3/22/2021 12:53 PM, André G. Isaak wrote: >>> On 2021-03-22 11:27, olcott wrote: >>>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>>> On 2021-03-22 10:56, olcott wrote: >>>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> Not when we use Taski's standard truth definition: >>>>>>>> a satisfies the formula F >>>>>>> >>>>>>> Why would we use some naive truth definition from a time before >>>>>>> knowledge of Gödel's work? >>>>>>> >>>>>>>> Alternatively we can correct this nonsense and reject >>>>>>>> self-contradictory >>>>>>>> senences as semantically ill-formed propositions having no truth >>>>>>>> value >>>>>>>> because they are not truth bearers. >>>>>>> >>>>>>> Firstly, you are infatuated with those sentences; you keep bringing >>>>>>> them up. >>>>>>> >>>>>>> Secondly, this is not one of those sentences, no matter how much you >>>>>>> want it to be. >>>>>>> >>>>>> >>>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >>>>>> based on the premise that the semantics specified by his English >>>>>> sentence correspond to the logic sentence in Gödel's actual proof: >>>>> >>>>> Which it doesn't. That's an informal analogy used in explaining the >>>>> proof to those who can't follow the actual math. People who can't >>>>> follow the actual math should learn to do so before trying to argue >>>>> about it. >>>>> >>>>>> "I have constructed a proposition (I will use 'P' to designate it) >>>>>> in Russell's symbolism, and by means of certain definitions and >>>>>> transformations it can be so interpreted that it says: >>>>>> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >>>>>> >>>>>> Since Gödel himself says the same thing this is a reasonable >>>>>> position to take: >>>>>> >>>>>> We are therefore confronted with a proposition which asserts its >>>>>> own unprovability. (Gödel:1931:40). >>>>> >>>>> Except you fail to understand exactly *how* it asserts this. HINT: >>>>> It doesn't do it directly; the actual content of Gödel's G is a >>>>> statement about arithmetic. It doesn't assert anything about itself. >>>>> >>>> >>>> (1) The next sentence is true. >>>> (2) The prior sentence is not true. >>>> is equivalent to >>>> This sentence is not true. >>> >>> And neither of those resemble Gödel's G. As I said, Gödel's G is a >>> statement of arithmetic. Why don't you go find it in the actual proof >>> rather than make stuff up about what it may or may not say? >>> >> >> a proposition... >> begins by asserting the unprovability of a wholly determinate formula... >> this formula is precisely that by which the proposition was itself >> expressed. (Gödel:1931:41). >> >> >>>>>> P says of itself that it is not provable in Russell's System >>>>>> >>>>>> The only reason why the self-contradictory nature of this sentence >>>>>> cannot be evaluated in symbolic logic is that the actual sentence >>>>>> is inexpressible in symbolic logic. >>>>>> >>>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>>> >>>>> Which isn't Gödel's G. It isn't anything at all since that's not a >>>>> valid proposition. >>>>> >>>>> You fail to grasp that definitions are not sentences of logic and >>>>> do not represent propositions. >>>> >>>> The closest thing that was available in symboloc logic to a >>>> self-reference operator was the definition symbol so MTT uses the >>>> definition symbol as its self-reference operator. >>>> >>>> LP := ~True(LP) >>> >>> The above doesn't express self-reference at all. There is no 'this' >>> in that 'equation'. Even if you did find some way of incorporating >>> self-reference into the above, it would still bear no resemblance to >>> Gödel's G. >>> >> >> This sentence is not true says: >> ~True(L~True(L~True(L~True(L~True(...))))) > > No. It doesn't. > > Does "This sentence contains five words" say "This sentence contains > five words contains five words contains five words...". If it did, it > would be false. But it isn't false. It is true. That is not actually referring to itself it is referring to its textual encoding. P := Contains_Five_Words(P) would still be infinitely recursive. > Self-reference is more complex than you make it out to be. Your 'macro > expansion' might work like you claim, but that's because it doesn't > actually capture self-reference. Self-reference of the type you keep > raising is a property of *natural* language. You can't use natural > language examples to make points about the syntax or semantics of formal > languages. So basically you are saying that: LiarParadox := ~True(LiarParadox) is "This sentence is not true" correctly formalized in MTT but since it is unconventional to examine formalized self-reference it is safe to ignore it. >> This sentence is not provable in RS >> P := (RS ⊬ P) >> (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ ...))))) >> >>> This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He >>> was working in standard logic which lacks any such 'operator'. >> >> When you make the semantics of actual self-reference inexpressible in >> the formal system that makes the formal system incapable of correctly >> evalating the actual expression. >> > > Correctly evaluating which actual expression? Gödel's G doesn't involve > self-reference, so why would you need the semantics of self-reference to > be expressible to evaluate it? > > André > An expression that is equivalent to the liar paradox can be defined as applying to provability instead of truth: "This sentence cannot be proven in RS." P := (RS ⊬ P) With the exact same infinitely recursive effect. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-22 13:36 -0600 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <s3arjc$5kc$1@dont-email.me> |
| In reply to | #29861 |
On 2021-03-22 13:25, olcott wrote: > On 3/22/2021 1:49 PM, André G. Isaak wrote: >> On 2021-03-22 12:10, olcott wrote: >>> On 3/22/2021 12:53 PM, André G. Isaak wrote: >>>> On 2021-03-22 11:27, olcott wrote: >>>>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>>>> On 2021-03-22 10:56, olcott wrote: >>>>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>> Not when we use Taski's standard truth definition: >>>>>>>>> a satisfies the formula F >>>>>>>> >>>>>>>> Why would we use some naive truth definition from a time before >>>>>>>> knowledge of Gödel's work? >>>>>>>> >>>>>>>>> Alternatively we can correct this nonsense and reject >>>>>>>>> self-contradictory >>>>>>>>> senences as semantically ill-formed propositions having no >>>>>>>>> truth value >>>>>>>>> because they are not truth bearers. >>>>>>>> >>>>>>>> Firstly, you are infatuated with those sentences; you keep bringing >>>>>>>> them up. >>>>>>>> >>>>>>>> Secondly, this is not one of those sentences, no matter how much >>>>>>>> you >>>>>>>> want it to be. >>>>>>>> >>>>>>> >>>>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem is >>>>>>> based on the premise that the semantics specified by his English >>>>>>> sentence correspond to the logic sentence in Gödel's actual proof: >>>>>> >>>>>> Which it doesn't. That's an informal analogy used in explaining >>>>>> the proof to those who can't follow the actual math. People who >>>>>> can't follow the actual math should learn to do so before trying >>>>>> to argue about it. >>>>>> >>>>>>> "I have constructed a proposition (I will use 'P' to designate >>>>>>> it) in Russell's symbolism, and by means of certain definitions >>>>>>> and transformations it can be so interpreted that it says: >>>>>>> 'P is not provable in Russell's system'. (Wittgenstein:1983:118-119) >>>>>>> >>>>>>> Since Gödel himself says the same thing this is a reasonable >>>>>>> position to take: >>>>>>> >>>>>>> We are therefore confronted with a proposition which asserts its >>>>>>> own unprovability. (Gödel:1931:40). >>>>>> >>>>>> Except you fail to understand exactly *how* it asserts this. HINT: >>>>>> It doesn't do it directly; the actual content of Gödel's G is a >>>>>> statement about arithmetic. It doesn't assert anything about itself. >>>>>> >>>>> >>>>> (1) The next sentence is true. >>>>> (2) The prior sentence is not true. >>>>> is equivalent to >>>>> This sentence is not true. >>>> >>>> And neither of those resemble Gödel's G. As I said, Gödel's G is a >>>> statement of arithmetic. Why don't you go find it in the actual >>>> proof rather than make stuff up about what it may or may not say? >>>> >>> >>> a proposition... >>> begins by asserting the unprovability of a wholly determinate formula... >>> this formula is precisely that by which the proposition was itself >>> expressed. (Gödel:1931:41). >>> >>> >>>>>>> P says of itself that it is not provable in Russell's System >>>>>>> >>>>>>> The only reason why the self-contradictory nature of this >>>>>>> sentence cannot be evaluated in symbolic logic is that the actual >>>>>>> sentence is inexpressible in symbolic logic. >>>>>>> >>>>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>>>> >>>>>> Which isn't Gödel's G. It isn't anything at all since that's not a >>>>>> valid proposition. >>>>>> >>>>>> You fail to grasp that definitions are not sentences of logic and >>>>>> do not represent propositions. >>>>> >>>>> The closest thing that was available in symboloc logic to a >>>>> self-reference operator was the definition symbol so MTT uses the >>>>> definition symbol as its self-reference operator. >>>>> >>>>> LP := ~True(LP) >>>> >>>> The above doesn't express self-reference at all. There is no 'this' >>>> in that 'equation'. Even if you did find some way of incorporating >>>> self-reference into the above, it would still bear no resemblance to >>>> Gödel's G. >>>> >>> >>> This sentence is not true says: >>> ~True(L~True(L~True(L~True(L~True(...))))) >> >> No. It doesn't. >> >> Does "This sentence contains five words" say "This sentence contains >> five words contains five words contains five words...". If it did, it >> would be false. But it isn't false. It is true. > > That is not actually referring to itself it is referring to its textual > encoding. Of course it is referring to itself. > P := Contains_Five_Words(P) would still be infinitely recursive. > >> Self-reference is more complex than you make it out to be. Your 'macro >> expansion' might work like you claim, but that's because it doesn't >> actually capture self-reference. Self-reference of the type you keep >> raising is a property of *natural* language. You can't use natural >> language examples to make points about the syntax or semantics of >> formal languages. > > So basically you are saying that: LiarParadox := ~True(LiarParadox) > is "This sentence is not true" correctly formalized in MTT No. I am saying that that does *not* encode the Liar Paradox. > but since it is unconventional to examine formalized self-reference it > is safe to ignore it. > >>> This sentence is not provable in RS >>> P := (RS ⊬ P) >>> (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ ...))))) >>> >>>> This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He >>>> was working in standard logic which lacks any such 'operator'. >>> >>> When you make the semantics of actual self-reference inexpressible in >>> the formal system that makes the formal system incapable of correctly >>> evalating the actual expression. >>> >> >> Correctly evaluating which actual expression? Gödel's G doesn't >> involve self-reference, so why would you need the semantics of >> self-reference to be expressible to evaluate it? >> >> André >> > > An expression that is equivalent to the liar paradox can be defined as > applying to provability instead of truth: > > "This sentence cannot be proven in RS." P := (RS ⊬ P) > With the exact same infinitely recursive effect. But G *isn't* equivalent to the liar paradox. Is it that hard for you to grasp the fact that there is a difference between 'there is a close relationship between X & Y' and 'X is equivalent to Y'? 'There is a close relationship between birds and crocodiles' is true. 'Birds are crocodiles' is false. The 'close relationship' of which Gödel speaks is one that you will never actually understand until you actually grasp the underlying math. -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 15:07 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <BrGdnQ2Sy5pnZcX9nZ2dnUU7-TPNnZ2d@giganews.com> |
| In reply to | #29863 |
On 3/22/2021 2:36 PM, André G. Isaak wrote: > On 2021-03-22 13:25, olcott wrote: >> On 3/22/2021 1:49 PM, André G. Isaak wrote: >>> On 2021-03-22 12:10, olcott wrote: >>>> On 3/22/2021 12:53 PM, André G. Isaak wrote: >>>>> On 2021-03-22 11:27, olcott wrote: >>>>>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>>>>> On 2021-03-22 10:56, olcott wrote: >>>>>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>> Not when we use Taski's standard truth definition: >>>>>>>>>> a satisfies the formula F >>>>>>>>> >>>>>>>>> Why would we use some naive truth definition from a time before >>>>>>>>> knowledge of Gödel's work? >>>>>>>>> >>>>>>>>>> Alternatively we can correct this nonsense and reject >>>>>>>>>> self-contradictory >>>>>>>>>> senences as semantically ill-formed propositions having no >>>>>>>>>> truth value >>>>>>>>>> because they are not truth bearers. >>>>>>>>> >>>>>>>>> Firstly, you are infatuated with those sentences; you keep >>>>>>>>> bringing >>>>>>>>> them up. >>>>>>>>> >>>>>>>>> Secondly, this is not one of those sentences, no matter how >>>>>>>>> much you >>>>>>>>> want it to be. >>>>>>>>> >>>>>>>> >>>>>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem >>>>>>>> is based on the premise that the semantics specified by his >>>>>>>> English sentence correspond to the logic sentence in Gödel's >>>>>>>> actual proof: >>>>>>> >>>>>>> Which it doesn't. That's an informal analogy used in explaining >>>>>>> the proof to those who can't follow the actual math. People who >>>>>>> can't follow the actual math should learn to do so before trying >>>>>>> to argue about it. >>>>>>> >>>>>>>> "I have constructed a proposition (I will use 'P' to designate >>>>>>>> it) in Russell's symbolism, and by means of certain definitions >>>>>>>> and transformations it can be so interpreted that it says: >>>>>>>> 'P is not provable in Russell's system'. >>>>>>>> (Wittgenstein:1983:118-119) >>>>>>>> >>>>>>>> Since Gödel himself says the same thing this is a reasonable >>>>>>>> position to take: >>>>>>>> >>>>>>>> We are therefore confronted with a proposition which asserts its >>>>>>>> own unprovability. (Gödel:1931:40). >>>>>>> >>>>>>> Except you fail to understand exactly *how* it asserts this. >>>>>>> HINT: It doesn't do it directly; the actual content of Gödel's G >>>>>>> is a statement about arithmetic. It doesn't assert anything about >>>>>>> itself. >>>>>>> >>>>>> >>>>>> (1) The next sentence is true. >>>>>> (2) The prior sentence is not true. >>>>>> is equivalent to >>>>>> This sentence is not true. >>>>> >>>>> And neither of those resemble Gödel's G. As I said, Gödel's G is a >>>>> statement of arithmetic. Why don't you go find it in the actual >>>>> proof rather than make stuff up about what it may or may not say? >>>>> >>>> >>>> a proposition... >>>> begins by asserting the unprovability of a wholly determinate >>>> formula... >>>> this formula is precisely that by which the proposition was itself >>>> expressed. (Gödel:1931:41). >>>> >>>> >>>>>>>> P says of itself that it is not provable in Russell's System >>>>>>>> >>>>>>>> The only reason why the self-contradictory nature of this >>>>>>>> sentence cannot be evaluated in symbolic logic is that the >>>>>>>> actual sentence is inexpressible in symbolic logic. >>>>>>>> >>>>>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>>>>> >>>>>>> Which isn't Gödel's G. It isn't anything at all since that's not >>>>>>> a valid proposition. >>>>>>> >>>>>>> You fail to grasp that definitions are not sentences of logic and >>>>>>> do not represent propositions. >>>>>> >>>>>> The closest thing that was available in symboloc logic to a >>>>>> self-reference operator was the definition symbol so MTT uses the >>>>>> definition symbol as its self-reference operator. >>>>>> >>>>>> LP := ~True(LP) >>>>> >>>>> The above doesn't express self-reference at all. There is no 'this' >>>>> in that 'equation'. Even if you did find some way of incorporating >>>>> self-reference into the above, it would still bear no resemblance >>>>> to Gödel's G. >>>>> >>>> >>>> This sentence is not true says: >>>> ~True(L~True(L~True(L~True(L~True(...))))) >>> >>> No. It doesn't. >>> >>> Does "This sentence contains five words" say "This sentence contains >>> five words contains five words contains five words...". If it did, it >>> would be false. But it isn't false. It is true. >> >> That is not actually referring to itself it is referring to its >> textual encoding. > > Of course it is referring to itself. Even if you assume that, it has a recursion termination condition and the other one does not. >> P := Contains_Five_Words(P) would still be infinitely recursive. >> >>> Self-reference is more complex than you make it out to be. Your >>> 'macro expansion' might work like you claim, but that's because it >>> doesn't actually capture self-reference. Self-reference of the type >>> you keep raising is a property of *natural* language. You can't use >>> natural language examples to make points about the syntax or >>> semantics of formal languages. >> >> So basically you are saying that: LiarParadox := ~True(LiarParadox) >> is "This sentence is not true" correctly formalized in MTT > > No. I am saying that that does *not* encode the Liar Paradox. You are saying that it does not encode the Liar Paradox because conventional wisdom says that the Liar Paradox cannot be formalized. >> but since it is unconventional to examine formalized self-reference it >> is safe to ignore it. >> >>>> This sentence is not provable in RS >>>> P := (RS ⊬ P) >>>> (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ (RS ⊬ ...))))) >>>> >>>>> This, though, is irrelevant. Gödel wasn't working in your 'MTT'. He >>>>> was working in standard logic which lacks any such 'operator'. >>>> >>>> When you make the semantics of actual self-reference inexpressible >>>> in the formal system that makes the formal system incapable of >>>> correctly evalating the actual expression. >>>> >>> >>> Correctly evaluating which actual expression? Gödel's G doesn't >>> involve self-reference, so why would you need the semantics of >>> self-reference to be expressible to evaluate it? >>> >>> André >>> >> >> An expression that is equivalent to the liar paradox can be defined as >> applying to provability instead of truth: > > >> "This sentence cannot be proven in RS." P := (RS ⊬ P) >> With the exact same infinitely recursive effect. > > But G *isn't* equivalent to the liar paradox. That you do not believe the above formal sentence accurately represents the Gödel sentence is for the moment beside the point. The current point is whether or not the above formalization accurately represents the English. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-22 16:51 -0600 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <s3b71r$o8m$1@dont-email.me> |
| In reply to | #29868 |
On 2021-03-22 14:07, olcott wrote: > On 3/22/2021 2:36 PM, André G. Isaak wrote: >> On 2021-03-22 13:25, olcott wrote: >>> On 3/22/2021 1:49 PM, André G. Isaak wrote: >>>> On 2021-03-22 12:10, olcott wrote: >>>>> On 3/22/2021 12:53 PM, André G. Isaak wrote: >>>>>> On 2021-03-22 11:27, olcott wrote: >>>>>>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>>>>>> On 2021-03-22 10:56, olcott wrote: >>>>>>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>> Not when we use Taski's standard truth definition: >>>>>>>>>>> a satisfies the formula F >>>>>>>>>> >>>>>>>>>> Why would we use some naive truth definition from a time before >>>>>>>>>> knowledge of Gödel's work? >>>>>>>>>> >>>>>>>>>>> Alternatively we can correct this nonsense and reject >>>>>>>>>>> self-contradictory >>>>>>>>>>> senences as semantically ill-formed propositions having no >>>>>>>>>>> truth value >>>>>>>>>>> because they are not truth bearers. >>>>>>>>>> >>>>>>>>>> Firstly, you are infatuated with those sentences; you keep >>>>>>>>>> bringing >>>>>>>>>> them up. >>>>>>>>>> >>>>>>>>>> Secondly, this is not one of those sentences, no matter how >>>>>>>>>> much you >>>>>>>>>> want it to be. >>>>>>>>>> >>>>>>>>> >>>>>>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem >>>>>>>>> is based on the premise that the semantics specified by his >>>>>>>>> English sentence correspond to the logic sentence in Gödel's >>>>>>>>> actual proof: >>>>>>>> >>>>>>>> Which it doesn't. That's an informal analogy used in explaining >>>>>>>> the proof to those who can't follow the actual math. People who >>>>>>>> can't follow the actual math should learn to do so before trying >>>>>>>> to argue about it. >>>>>>>> >>>>>>>>> "I have constructed a proposition (I will use 'P' to designate >>>>>>>>> it) in Russell's symbolism, and by means of certain definitions >>>>>>>>> and transformations it can be so interpreted that it says: >>>>>>>>> 'P is not provable in Russell's system'. >>>>>>>>> (Wittgenstein:1983:118-119) >>>>>>>>> >>>>>>>>> Since Gödel himself says the same thing this is a reasonable >>>>>>>>> position to take: >>>>>>>>> >>>>>>>>> We are therefore confronted with a proposition which asserts >>>>>>>>> its own unprovability. (Gödel:1931:40). >>>>>>>> >>>>>>>> Except you fail to understand exactly *how* it asserts this. >>>>>>>> HINT: It doesn't do it directly; the actual content of Gödel's G >>>>>>>> is a statement about arithmetic. It doesn't assert anything >>>>>>>> about itself. >>>>>>>> >>>>>>> >>>>>>> (1) The next sentence is true. >>>>>>> (2) The prior sentence is not true. >>>>>>> is equivalent to >>>>>>> This sentence is not true. >>>>>> >>>>>> And neither of those resemble Gödel's G. As I said, Gödel's G is a >>>>>> statement of arithmetic. Why don't you go find it in the actual >>>>>> proof rather than make stuff up about what it may or may not say? >>>>>> >>>>> >>>>> a proposition... >>>>> begins by asserting the unprovability of a wholly determinate >>>>> formula... >>>>> this formula is precisely that by which the proposition was itself >>>>> expressed. (Gödel:1931:41). >>>>> >>>>> >>>>>>>>> P says of itself that it is not provable in Russell's System >>>>>>>>> >>>>>>>>> The only reason why the self-contradictory nature of this >>>>>>>>> sentence cannot be evaluated in symbolic logic is that the >>>>>>>>> actual sentence is inexpressible in symbolic logic. >>>>>>>>> >>>>>>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>>>>>> >>>>>>>> Which isn't Gödel's G. It isn't anything at all since that's not >>>>>>>> a valid proposition. >>>>>>>> >>>>>>>> You fail to grasp that definitions are not sentences of logic >>>>>>>> and do not represent propositions. >>>>>>> >>>>>>> The closest thing that was available in symboloc logic to a >>>>>>> self-reference operator was the definition symbol so MTT uses the >>>>>>> definition symbol as its self-reference operator. >>>>>>> >>>>>>> LP := ~True(LP) >>>>>> >>>>>> The above doesn't express self-reference at all. There is no >>>>>> 'this' in that 'equation'. Even if you did find some way of >>>>>> incorporating self-reference into the above, it would still bear >>>>>> no resemblance to Gödel's G. >>>>>> >>>>> >>>>> This sentence is not true says: >>>>> ~True(L~True(L~True(L~True(L~True(...))))) >>>> >>>> No. It doesn't. >>>> >>>> Does "This sentence contains five words" say "This sentence contains >>>> five words contains five words contains five words...". If it did, >>>> it would be false. But it isn't false. It is true. >>> >>> That is not actually referring to itself it is referring to its >>> textual encoding. >> >> Of course it is referring to itself. > > Even if you assume that, it has a recursion termination condition and > the other one does not. > >>> P := Contains_Five_Words(P) would still be infinitely recursive. >>> >>>> Self-reference is more complex than you make it out to be. Your >>>> 'macro expansion' might work like you claim, but that's because it >>>> doesn't actually capture self-reference. Self-reference of the type >>>> you keep raising is a property of *natural* language. You can't use >>>> natural language examples to make points about the syntax or >>>> semantics of formal languages. >>> >>> So basically you are saying that: LiarParadox := ~True(LiarParadox) >>> is "This sentence is not true" correctly formalized in MTT >> >> No. I am saying that that does *not* encode the Liar Paradox. > > You are saying that it does not encode the Liar Paradox because > conventional wisdom says that the Liar Paradox cannot be formalized. It doesn't encode anything. Your 'MTT' provides no interpretation for this symbol. You've borrowed a symbol from another context which *does not* denote a proposition, but a definition, and are tacking it into your syntax as if it did denote a proposition, but without providing any semantics or rules of inference for dealing with this. I'd asked this before, but you'd failed to respond. How exactly is the following interpreted? A → (B := C) Even in cases where B := C doesn't involve what you call 'pathological self-reference' it has no truth value. That's because it doesn't denote a statement of logic on its standard interpretation, so it cannot be used as one. If you intend it to represent something else, you have to actually describe its semantics. You don't. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-22 18:03 -0500 |
| Subject | Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) |
| Message-ID | <btydnaKUCtzQv8T9nZ2dnUU7-d3NnZ2d@giganews.com> |
| In reply to | #29873 |
On 3/22/2021 5:51 PM, André G. Isaak wrote: > On 2021-03-22 14:07, olcott wrote: >> On 3/22/2021 2:36 PM, André G. Isaak wrote: >>> On 2021-03-22 13:25, olcott wrote: >>>> On 3/22/2021 1:49 PM, André G. Isaak wrote: >>>>> On 2021-03-22 12:10, olcott wrote: >>>>>> On 3/22/2021 12:53 PM, André G. Isaak wrote: >>>>>>> On 2021-03-22 11:27, olcott wrote: >>>>>>>> On 3/22/2021 12:17 PM, André G. Isaak wrote: >>>>>>>>> On 2021-03-22 10:56, olcott wrote: >>>>>>>>>> On 3/22/2021 11:43 AM, Kaz Kylheku wrote: >>>>>>>>>>> On 2021-03-22, olcott <NoOne@NoWhere.com> wrote: >>>>>>>>>>>> Not when we use Taski's standard truth definition: >>>>>>>>>>>> a satisfies the formula F >>>>>>>>>>> >>>>>>>>>>> Why would we use some naive truth definition from a time before >>>>>>>>>>> knowledge of Gödel's work? >>>>>>>>>>> >>>>>>>>>>>> Alternatively we can correct this nonsense and reject >>>>>>>>>>>> self-contradictory >>>>>>>>>>>> senences as semantically ill-formed propositions having no >>>>>>>>>>>> truth value >>>>>>>>>>>> because they are not truth bearers. >>>>>>>>>>> >>>>>>>>>>> Firstly, you are infatuated with those sentences; you keep >>>>>>>>>>> bringing >>>>>>>>>>> them up. >>>>>>>>>>> >>>>>>>>>>> Secondly, this is not one of those sentences, no matter how >>>>>>>>>>> much you >>>>>>>>>>> want it to be. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Wittgenstein's analysis of Gödel's 1931 incompleteness theorem >>>>>>>>>> is based on the premise that the semantics specified by his >>>>>>>>>> English sentence correspond to the logic sentence in Gödel's >>>>>>>>>> actual proof: >>>>>>>>> >>>>>>>>> Which it doesn't. That's an informal analogy used in explaining >>>>>>>>> the proof to those who can't follow the actual math. People who >>>>>>>>> can't follow the actual math should learn to do so before >>>>>>>>> trying to argue about it. >>>>>>>>> >>>>>>>>>> "I have constructed a proposition (I will use 'P' to designate >>>>>>>>>> it) in Russell's symbolism, and by means of certain >>>>>>>>>> definitions and transformations it can be so interpreted that >>>>>>>>>> it says: >>>>>>>>>> 'P is not provable in Russell's system'. >>>>>>>>>> (Wittgenstein:1983:118-119) >>>>>>>>>> >>>>>>>>>> Since Gödel himself says the same thing this is a reasonable >>>>>>>>>> position to take: >>>>>>>>>> >>>>>>>>>> We are therefore confronted with a proposition which asserts >>>>>>>>>> its own unprovability. (Gödel:1931:40). >>>>>>>>> >>>>>>>>> Except you fail to understand exactly *how* it asserts this. >>>>>>>>> HINT: It doesn't do it directly; the actual content of Gödel's >>>>>>>>> G is a statement about arithmetic. It doesn't assert anything >>>>>>>>> about itself. >>>>>>>>> >>>>>>>> >>>>>>>> (1) The next sentence is true. >>>>>>>> (2) The prior sentence is not true. >>>>>>>> is equivalent to >>>>>>>> This sentence is not true. >>>>>>> >>>>>>> And neither of those resemble Gödel's G. As I said, Gödel's G is >>>>>>> a statement of arithmetic. Why don't you go find it in the actual >>>>>>> proof rather than make stuff up about what it may or may not say? >>>>>>> >>>>>> >>>>>> a proposition... >>>>>> begins by asserting the unprovability of a wholly determinate >>>>>> formula... >>>>>> this formula is precisely that by which the proposition was itself >>>>>> expressed. (Gödel:1931:41). >>>>>> >>>>>> >>>>>>>>>> P says of itself that it is not provable in Russell's System >>>>>>>>>> >>>>>>>>>> The only reason why the self-contradictory nature of this >>>>>>>>>> sentence cannot be evaluated in symbolic logic is that the >>>>>>>>>> actual sentence is inexpressible in symbolic logic. >>>>>>>>>> >>>>>>>>>> (Formalized in Minimal Type Theory) P := (RS ⊬ P) >>>>>>>>> >>>>>>>>> Which isn't Gödel's G. It isn't anything at all since that's >>>>>>>>> not a valid proposition. >>>>>>>>> >>>>>>>>> You fail to grasp that definitions are not sentences of logic >>>>>>>>> and do not represent propositions. >>>>>>>> >>>>>>>> The closest thing that was available in symboloc logic to a >>>>>>>> self-reference operator was the definition symbol so MTT uses >>>>>>>> the definition symbol as its self-reference operator. >>>>>>>> >>>>>>>> LP := ~True(LP) >>>>>>> >>>>>>> The above doesn't express self-reference at all. There is no >>>>>>> 'this' in that 'equation'. Even if you did find some way of >>>>>>> incorporating self-reference into the above, it would still bear >>>>>>> no resemblance to Gödel's G. >>>>>>> >>>>>> >>>>>> This sentence is not true says: >>>>>> ~True(L~True(L~True(L~True(L~True(...))))) >>>>> >>>>> No. It doesn't. >>>>> >>>>> Does "This sentence contains five words" say "This sentence >>>>> contains five words contains five words contains five words...". If >>>>> it did, it would be false. But it isn't false. It is true. >>>> >>>> That is not actually referring to itself it is referring to its >>>> textual encoding. >>> >>> Of course it is referring to itself. >> >> Even if you assume that, it has a recursion termination condition and >> the other one does not. >> >>>> P := Contains_Five_Words(P) would still be infinitely recursive. >>>> >>>>> Self-reference is more complex than you make it out to be. Your >>>>> 'macro expansion' might work like you claim, but that's because it >>>>> doesn't actually capture self-reference. Self-reference of the type >>>>> you keep raising is a property of *natural* language. You can't use >>>>> natural language examples to make points about the syntax or >>>>> semantics of formal languages. >>>> >>>> So basically you are saying that: LiarParadox := ~True(LiarParadox) >>>> is "This sentence is not true" correctly formalized in MTT >>> >>> No. I am saying that that does *not* encode the Liar Paradox. >> >> You are saying that it does not encode the Liar Paradox because >> conventional wisdom says that the Liar Paradox cannot be formalized. > > It doesn't encode anything. > > Your 'MTT' provides no interpretation for this symbol. You've borrowed a > symbol from another context which *does not* denote a proposition, but a > definition, and are tacking it into your syntax as if it did denote a > proposition, but without providing any semantics or rules of inference > for dealing with this. %left ASSIGN_ALIAS // := (definition operator) x := y means x is defined to be another name for y // LHS is assigned as an alias name for the RHS (macro substitution) // An alias named expression is treated syntactically as a propositional // variable in the next higher level of logic specifying HOL using FOL syntax. // This alias name is then treated semantically as if it was macro expanded. (PDF) Minimal Type Theory (YACC BNF). Available from: https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF [accessed Mar 22 2021]. https://www.researchgate.net/publication/331859461_Minimal_Type_Theory_YACC_BNF > I'd asked this before, but you'd failed to respond. How exactly is the > following interpreted? > > A → (B := C) A → C > > Even in cases where B := C doesn't involve what you call 'pathological > self-reference' it has no truth value. That's because it doesn't denote > a statement of logic on its standard interpretation, so it cannot be > used as one. If you intend it to represent something else, you have to > actually describe its semantics. You don't. > > André > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 8 of 20 — ← Prev page 1 … 6 7 [8] 9 10 … 20 Next page →
Back to top | Article view | comp.theory
csiph-web