Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
|---|---|
| Newsgroups | comp.theory, comp.lang.prolog, sci.math.symbolic, sci.math |
| References | (15 earlier) <20210413192857.667@kylheku.com> <e7-dnY3rquBTg-r9nZ2dnUU7-TlQAAAA@giganews.com> <s577ck$bd3$1@dont-email.me> <kqadnawYjpQjvOr9nZ2dnUU7-SOdnZ2d@giganews.com> <20210414172903.469@kylheku.com> |
| From | olcott <NoOne@NoWhere.com> |
| Date | 2021-04-15 10:00 -0500 |
| Message-ID | <PL2dndJe_c2PyOX9nZ2dnUU7-dGdnZ2d@giganews.com> (permalink) |
Cross-posted to 4 groups.
On 4/14/2021 7:32 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2021-04-14, olcott <NoOne@NoWhere.com> wrote: >> 14 Every epistemological antinomy can likewise be used for a similar >> undecidability proof. > > Except the liar-paradox and its ilk; those fall victim to Tarski's > undefinabiity, independently discovered by Gödel. > > "Every epistemological antinomy can likewise be used for a similar > undecidability proof." really means every *eligible* one. > > That rules out ones which try to model a system's semantic truth within > that system. > > Gödel's sentence models only a mechanical truth: derivation from axioms. > I.e. the notion of "provable", not "true". > > In any axiomatic system where you can represent formulas arithmetically, > you can set up an undecidability proof in relation to deriving from > axioms. Or something like that. > 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) In Prolog these two sentences are equivalent: G = not(provable(F, G)). LP = not(true(LP)). Because the Prolog Liar Paradox has an “uninstantiated subterm of itself” we can know that unification will fail because it specifies “some kind of infinite structure.” The quotes come from: (Clocksin and Mellish 2003:255) If we simply take Gödel at his word: “Every epistemological antinomy can likewise be used for a similar undecidability proof.” then the Liar Paradox is equivalent to his own undecidable sentence. Godel, Kurt 1931. On Formally Undecidable Propositions of Principia Mathematica And Related Systems I, page 39-41. Prolog detects pathological self reference in the Gödel sentence April 2021 PL Olcott https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
Back to sci.math | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-10 22:26 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Jeff Barnett <jbb@notatt.com> - 2021-04-10 22:27 -0600
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 00:12 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Jeff Barnett <jbb@notatt.com> - 2021-04-10 23:50 -0600
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 09:29 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Peter <peterxpercival@hotmail.com> - 2021-04-11 16:32 +0100
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 09:08 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 12:06 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 14:34 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Peter <peterxpercival@hotmail.com> - 2021-04-11 20:48 +0100
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <janburse@fastmail.fm> - 2021-04-11 22:00 +0200
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 15:31 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 15:38 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 15:49 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 16:09 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 18:57 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 10:10 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 07:03 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-13 00:29 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 01:02 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:46 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-15 00:25 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 14:30 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 17:02 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 19:52 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 06:57 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:29 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 23:45 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 19:04 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 01:15 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 09:45 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-12 01:27 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 09:56 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 08:21 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 08:24 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 11:15 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 12:56 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 13:04 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 16:41 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 16:56 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 15:22 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 22:35 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 06:38 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 18:00 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 18:02 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 06:27 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 12:03 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 10:29 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 12:45 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 10:54 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 13:13 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 11:20 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 11:32 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 13:43 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 11:49 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 02:25 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 14:30 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 15:00 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 02:28 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:56 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). André G. Isaak <agisaak@gm.invalid> - 2021-04-14 11:05 -0600
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 12:09 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Peter <peterxpercival@hotmail.com> - 2021-04-14 18:39 +0100
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-15 00:32 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-15 10:00 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-15 08:17 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-15 15:43 +0000
Pete Olcott, that b.s. spammer of 2 OR 1 = 3 with 2 AND 1 = 1, that failure of logic. Read AP's true Logic-- Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-12 15:12 -0700
Re: Archimedes "irrelevant" Plutonium flunked the math test of a lifetime-generation test Michael Moroney <moroney@world.std.spaamtrap.com> - 2021-04-12 19:51 -0400
What is Godel good for when you cannot even recognize that AND should be TTTF not TFFF, and so Godel was rinky dink Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-12 23:49 -0700
csiph-web