Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.prolog > #11795 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-04-09 18:16 -0500 |
| Last post | 2021-04-14 02:25 +0000 |
| Articles | 11 on this page of 71 — 6 participants |
Back to article view | Back to comp.lang.prolog
Does this fail an occurs check: ?- equal(foo(X,Y), Y). olcott <NoOne@NoWhere.com> - 2021-04-09 18:16 -0500
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)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 09:10 -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)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 12:54 -0700
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:39 -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:08 -0700
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:16 -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)). 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)). 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-15 09:58 -0500
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)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 15:23 -0700
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)). 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:12 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 12:57 -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:56 -0500
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 14:36 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 14:59 -0700
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:03 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 21:26 -0500
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 11:15 -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: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 <janburse@fastmail.fm> - 2021-04-13 19:27 +0200
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:21 -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 14:30 -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 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)). 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:18 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-15 10:39 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-15 08:54 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-15 11:20 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-15 12:14 -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
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:50 -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
Page 4 of 4 — ← Prev page 1 2 3 [4]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-15 00:32 +0000 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <20210414172903.469@kylheku.com> |
| In reply to | #11876 |
["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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 10:00 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <PL2dndJe_c2PyOX9nZ2dnUU7-dGdnZ2d@giganews.com> |
| In reply to | #11882 |
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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-15 08:18 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <1b15131b-d7f7-4b7a-a387-492d7ee7b64cn@googlegroups.com> |
| In reply to | #11884 |
No, it doesn't. olcott schrieb am Donnerstag, 15. April 2021 um 17:00:41 UTC+2: > On 4/14/2021 7:32 PM, Kaz Kylheku wrote: > > ["Followup-To:" header set to comp.theory.] > > On 2021-04-14, olcott <No...@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
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 10:39 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <6vOdnaB3gOiIw-X9nZ2dnUU7-b2dnZ2d@giganews.com> |
| In reply to | #11885 |
On 4/15/2021 10:18 AM, Mostowski Collapse wrote: > No, it doesn't. > > olcott schrieb am Donnerstag, 15. April 2021 um 17:00:41 UTC+2: >> On 4/14/2021 7:32 PM, Kaz Kylheku wrote: >>> ["Followup-To:" header set to comp.theory.] >>> On 2021-04-14, olcott <No...@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 I am not going to respond to top posts any more because it screws up the correct dialogue order. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-15 08:54 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <8abc63ee-545a-47a9-98f6-bffe29ae37f1n@googlegroups.com> |
| In reply to | #11886 |
No it doesn't. olcott schrieb am Donnerstag, 15. April 2021 um 17:39:07 UTC+2: > On 4/15/2021 10:18 AM, Mostowski Collapse wrote: > > No, it doesn't. > > > > olcott schrieb am Donnerstag, 15. April 2021 um 17:00:41 UTC+2: > >> On 4/14/2021 7:32 PM, Kaz Kylheku wrote: > >>> ["Followup-To:" header set to comp.theory.] > >>> On 2021-04-14, olcott <No...@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 > I am not going to respond to top posts any more because it screws up the > correct dialogue order. > -- > 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-04-15 11:20 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <3LmdnZBMcJgu-uX9nZ2dnUU7-YudnZ2d@giganews.com> |
| In reply to | #11888 |
On 4/15/2021 10:54 AM, Mostowski Collapse wrote: > No it doesn't. > I am not going to respond to top posts any more because it screws up the correct dialogue order. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-15 12:14 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <40127074-2b90-407a-a017-974a50e96567n@googlegroups.com> |
| In reply to | #11889 |
LoL olcott schrieb am Donnerstag, 15. April 2021 um 18:20:09 UTC+2: > On 4/15/2021 10:54 AM, Mostowski Collapse wrote: > > No it doesn't. > > > > I am not going to respond to top posts any more because it screws up the > correct dialogue order. > > -- > 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-04-15 15:43 +0000 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <20210415083340.550@kylheku.com> |
| In reply to | #11884 |
["Followup-To:" header set to comp.theory.]
On 2021-04-15, olcott <NoOne@NoWhere.com> wrote:
> On 4/14/2021 7:32 PM, Kaz Kylheku wrote:
>> 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)
We know for a fact that Gödel tried, and was not able to encode the liar
paradox into arithmetic, which is required for his undecidability proof,
and that he knew about this in 1930.
"The undefinability theorem is conventionally attributed to Alfred
Tarski. Gödel also discovered the undefinability theorem in 1930, while
proving his incompleteness theorems published in 1931, and well before
the 1933 publication of Tarski's work (Murawski 1998)."
[https://en.wikipedia.org/wiki/Tarski%27s_undefinability_theorem]
It must be that Gödel didn't regard the liar paradox as being an
"epistemological antinomy".
You're trying to milk everything out of the only sentences in Gödel
which you can understand at all. Or think you can understand, at any rate.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-13 13:43 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <8bmdnTPmW4j8e-j9nZ2dnUU7-d3NnZ2d@giganews.com> |
| In reply to | #11854 |
On 4/13/2021 1:21 PM, Mostowski Collapse wrote:
> You are confusing the term level with the formula level,
> in a formal system. (=)/2 or unify_with_occurs_check/2
> is only for terms, not for formulas. But here:
>
>>> I am only referring to Gödel's work indirectly through the definition
>>> of Incompleteness that it is based on: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧
>>> (T ⊬ ¬φ))
>
> φ is a formula. Did you even ever hear of Gödelization?
Gödelization is a dishonest dodge that very effectively obscures what is
otherwise very clear:
We are therefore confronted with a proposition which asserts its
own unprovability.15
Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
Mathematica And Related Systems I, page 39-41.
Each and every proposition that asserts its own unprovability <is>
attempting to match an uninstantiated subterm of itself.
// The Liar Paradox in C:
int main()
{
bool LP = (LP != true);
}
We are assigning a value to LP on the basis of testing the value of LP
before any value has been assigned to LP.
matching an uninstantiated subterm of itself.
matching an uninstantiated subterm of itself.
matching an uninstantiated subterm of itself.
https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence
> olcott schrieb am Dienstag, 13. April 2021 um 20:13:36 UTC+2:
>> On 4/13/2021 12:54 PM, Mostowski Collapse wrote:
>>> Its not a self reference by way of (=)/2 or unify_with_occurs_check/2.
>>> from Prolog. Forget it. You are a complete crazy nut head.
>>>
>> In other words you believe that Clocksin and Mellish get it wrong:
>>
>> According to the formal definition of Unification, this kind of
>> “infinite term” should never come to exist. Thus Prolog systems that
>> allow a term to match an uninstantiated subterm of itself do not act
>> correctly as Resolution theorem provers.
>>
>> match an uninstantiated subterm of itself
>> match an uninstantiated subterm of itself
>> match an uninstantiated subterm of itself
>>> olcott schrieb am Dienstag, 13. April 2021 um 19:45:51 UTC+2:
>>>> On 4/13/2021 12:27 PM, Mostowski Collapse wrote:
>>>>> but (=)/2 or unify_with_occurs_check/2 cannot be used to equate
>>>>> "by which the proposition was itself expressed". Since the Prolog
>>>>> (=)/2 or unify_with_occurs_check/2 is not a propositional biconditional.
>>>>>
>>>> It does not need to do this. The semantics of this is already included
>>>> in ?- unify_with_occurs_check(G, not(provable(F, G))).
>>>>
>>>> The Gödel sentence has the same pathological self reference that ?-
>>>> unify_with_occurs_check(G, not(provable(F, G))). detects.
>>>>> If it were a biconditonal you could ask:
>>>>>
>>>>> ?- not(not(A))=A.
>>>>>
>>>>> And it would say "true". But it says "false" when occurs_check=true.
>>>>> Whats wrong with you olcott. What kind of drugs do you consume,
>>>>> that you can come up with utter crank nonsense?
>>>>>
>>>>>
>>>>> olcott schrieb:
>>>>>> Only Gödel's own words:
>>>>>>
>>>>>> We are therefore confronted with a proposition which asserts its
>>>>>> own unprovability.15
>>>>>>
>>>>>> 15 In spite of appearances, there is nothing circular about such
>>>>>> a proposition, since it begins by asserting the unprovability of a
>>>>>> wholly determinate formula (namely the q-th in the alphabetical
>>>>>> arrangement with a definite substitution), and only subsequently
>>>>>> (and in some way by accident) does it emerge that this formula
>>>>>> is precisely that by which the proposition was itself expressed.
>>>>>>
>>>>>> AKA the same pathological self-reference as this Prolog expression:
>>>>>> G = not(provable(F, G)).
>>>>>>
>>>>>> Prolog detects and report pathological self-reference:
>>>>>> ?- unify_with_occurs_check(G, not(provable(F, G))).
>>>>>> false.
>>>> --
>>>> Copyright 2021 Pete Olcott
>>>>
>>>> "Great spirits have always encountered violent opposition from mediocre
>>>> minds." Einstein
>>
>>
>> --
>> Copyright 2021 Pete Olcott
>>
>> "Great spirits have always encountered violent opposition from mediocre
>> minds." Einstein
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-13 11:50 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <72f1dcf5-9242-45ba-a29a-b81e01e72a4fn@googlegroups.com> |
| In reply to | #11856 |
Your confusion towards Prolog is extremly sad since
Gödels incompletness paper is an exercise in formalizing
a formal system. So in essence the paper should make
clear a lot of notions such as term, formula, proof, etc..
Nevertheless you are just mindlessly jumping between
a Prolog book, the Gödel paper, some Liar stuff
etc.. having no clue what you are doing.
LMAO!
olcott schrieb am Dienstag, 13. April 2021 um 20:43:51 UTC+2:
> On 4/13/2021 1:21 PM, Mostowski Collapse wrote:
> > You are confusing the term level with the formula level,
> > in a formal system. (=)/2 or unify_with_occurs_check/2
> > is only for terms, not for formulas. But here:
> >
> >>> I am only referring to Gödel's work indirectly through the definition
> >>> of Incompleteness that it is based on: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧
> >>> (T ⊬ ¬φ))
> >
> > φ is a formula. Did you even ever hear of Gödelization?
> Gödelization is a dishonest dodge that very effectively obscures what is
> otherwise very clear:
> We are therefore confronted with a proposition which asserts its
> own unprovability.15
> Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
> Mathematica And Related Systems I, page 39-41.
> Each and every proposition that asserts its own unprovability <is>
> attempting to match an uninstantiated subterm of itself.
>
> // The Liar Paradox in C:
> int main()
> {
> bool LP = (LP != true);
> }
>
> We are assigning a value to LP on the basis of testing the value of LP
> before any value has been assigned to LP.
>
> matching an uninstantiated subterm of itself.
> matching an uninstantiated subterm of itself.
> matching an uninstantiated subterm of itself.
>
> https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence
> > olcott schrieb am Dienstag, 13. April 2021 um 20:13:36 UTC+2:
> >> On 4/13/2021 12:54 PM, Mostowski Collapse wrote:
> >>> Its not a self reference by way of (=)/2 or unify_with_occurs_check/2.
> >>> from Prolog. Forget it. You are a complete crazy nut head.
> >>>
> >> In other words you believe that Clocksin and Mellish get it wrong:
> >>
> >> According to the formal definition of Unification, this kind of
> >> “infinite term” should never come to exist. Thus Prolog systems that
> >> allow a term to match an uninstantiated subterm of itself do not act
> >> correctly as Resolution theorem provers.
> >>
> >> match an uninstantiated subterm of itself
> >> match an uninstantiated subterm of itself
> >> match an uninstantiated subterm of itself
> >>> olcott schrieb am Dienstag, 13. April 2021 um 19:45:51 UTC+2:
> >>>> On 4/13/2021 12:27 PM, Mostowski Collapse wrote:
> >>>>> but (=)/2 or unify_with_occurs_check/2 cannot be used to equate
> >>>>> "by which the proposition was itself expressed". Since the Prolog
> >>>>> (=)/2 or unify_with_occurs_check/2 is not a propositional biconditional.
> >>>>>
> >>>> It does not need to do this. The semantics of this is already included
> >>>> in ?- unify_with_occurs_check(G, not(provable(F, G))).
> >>>>
> >>>> The Gödel sentence has the same pathological self reference that ?-
> >>>> unify_with_occurs_check(G, not(provable(F, G))). detects.
> >>>>> If it were a biconditonal you could ask:
> >>>>>
> >>>>> ?- not(not(A))=A.
> >>>>>
> >>>>> And it would say "true". But it says "false" when occurs_check=true.
> >>>>> Whats wrong with you olcott. What kind of drugs do you consume,
> >>>>> that you can come up with utter crank nonsense?
> >>>>>
> >>>>>
> >>>>> olcott schrieb:
> >>>>>> Only Gödel's own words:
> >>>>>>
> >>>>>> We are therefore confronted with a proposition which asserts its
> >>>>>> own unprovability.15
> >>>>>>
> >>>>>> 15 In spite of appearances, there is nothing circular about such
> >>>>>> a proposition, since it begins by asserting the unprovability of a
> >>>>>> wholly determinate formula (namely the q-th in the alphabetical
> >>>>>> arrangement with a definite substitution), and only subsequently
> >>>>>> (and in some way by accident) does it emerge that this formula
> >>>>>> is precisely that by which the proposition was itself expressed.
> >>>>>>
> >>>>>> AKA the same pathological self-reference as this Prolog expression:
> >>>>>> G = not(provable(F, G)).
> >>>>>>
> >>>>>> Prolog detects and report pathological self-reference:
> >>>>>> ?- unify_with_occurs_check(G, not(provable(F, G))).
> >>>>>> false.
> >>>> --
> >>>> Copyright 2021 Pete Olcott
> >>>>
> >>>> "Great spirits have always encountered violent opposition from mediocre
> >>>> minds." Einstein
> >>
> >>
> >> --
> >> Copyright 2021 Pete Olcott
> >>
> >> "Great spirits have always encountered violent opposition from mediocre
> >> minds." Einstein
>
>
> --
> 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-04-14 02:25 +0000 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <20210413191927.217@kylheku.com> |
| In reply to | #11856 |
["Followup-To:" header set to comp.theory.] On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: > On 4/13/2021 1:21 PM, Mostowski Collapse wrote: >> You are confusing the term level with the formula level, >> in a formal system. (=)/2 or unify_with_occurs_check/2 >> is only for terms, not for formulas. But here: >> >>>> I am only referring to Gödel's work indirectly through the definition >>>> of Incompleteness that it is based on: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ >>>> (T ⊬ ¬φ)) >> >> φ is a formula. Did you even ever hear of Gödelization? > > Gödelization is a dishonest dodge that very effectively obscures what is > otherwise very clear: That's just words you typically use when you don't understand something. Can you specifically pinpoint the dodgery and dishonesty? > We are therefore confronted with a proposition which asserts its > own unprovability.15 > > Godel, Kurt 1931. On Formally Undecidable Propositions of Principia > Mathematica And Related Systems I, page 39-41. > > Each and every proposition that asserts its own unprovability <is> > attempting to match an uninstantiated subterm of itself. That is false. Thanks to Gödel numbering, the Gödel sentence contains no unexpanded terms; it makes no symbolic reference to itself through a circular definition or anything of the sort.
[toc] | [prev] | [standalone]
Page 4 of 4 — ← Prev page 1 2 3 [4]
Back to top | Article view | comp.lang.prolog
csiph-web