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 | 20 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 3 of 4 — ← Prev page 1 2 [3] 4 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-13 14:36 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <GrOdnabLzMVOb-j9nZ2dnUU7-THNnZ2d@giganews.com> |
| In reply to | #11835 |
On 4/13/2021 1:38 AM, Kaz Kylheku wrote:
> On 2021-04-13, olcott <NoOne@NoWhere.com> wrote:
>> On 4/12/2021 5:08 PM, André G. Isaak wrote:
>>> Even if we were to accept your view that sentences can be 'erroneous',
>>> Gödel's sentence doesn't exhibit any of the properties which you have
>>> thus far discussed as being 'erroneous'. You really need to learn what
>>> Gödel's sentence actually *is* as opposed to what you imagine it to be.
>>>
>>> André
>>>
>>
>> He acknowledges that his sentence "asserts its own unprovability"
>> and then attempts to deny this in a particularly dodgy way that really
>> only reaffirms the pathological self-reference of his sentence.
>
> Kindly shut up about Gödel, until you're willing to grapple with the
> details of the actual sentence, rather than an explanation of it for
> imbeciles.
>
>> 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
>
> ... but my crystal ball tells me that in the next century, there will be
> a crank on some forum called Usenet who will insist that the proposition
> is circular.
>
>> 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.
>>
>> If you remove the dodgy words then these words reaffirm that a
>
> No, "dodgy" is not a good synonym for "shit I don't fucking understand".
>
>> proposition asserts the unprovability of a formula that expresses this
>> same proposition: AKA pathological self-reference.
>>
>> 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).
>>
>> Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
>> Mathematica And Related Systems I, page 39-41.
>>
>> This expression is not provable because its pathological self-reference
>> makes it a Clocksin and Mellish: "some kind of infinite structure."
>> ?- G = not(provable(F, G)).
>
> There is no self-reference. See the text "In spite of appearances, there
> is nothing circular ...".
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.
Removing the dodgy words from the above.
a proposition...begins by asserting the unprovability of a wholly
determinate formula...this formula is precisely that by which the
proposition was itself expressed.
Paraphrasing the above using less clumsy words:
a proposition asserts the unprovability of a formula that expresses
this same proposition:
Gödel's footnote 15 is dodgy in that although it denies the circularity
of his proposition he affirms its circularity in the same paragraph that
he denies it:
a proposition asserts the unprovability of a formula that expresses
this same proposition:
AKA the same pathological self-reference as this Prolog expression:
G = not(provable(F, G)).
--
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 14:59 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <e3007900-c9a5-4126-85d9-e4d2d31dcddan@googlegroups.com> |
| In reply to | #11859 |
You can only relate to what is tangible in your little
hemisphere of toys, i.e. a Prolog interpreter or a
C-Program. The later even does not have a boolean
type, when you write (LiarParadox != true) this is even
not possible in C-Program. What is true in C? It is
non-zero. So you would need to write:
(LiarParadox == 0)
and the result is an integer again. How on earth would
somebody think that this has anything to do with what
Gödel writes? In Gödels incompletness theorem
provable is not an integer function from C, its a
predication in some logic. You are comparing apples
with oranges. In FOL with equality, you cannot use
equality for formulas, it is only among terms.
olcott schrieb am Dienstag, 13. April 2021 um 21:36:57 UTC+2:
> On 4/13/2021 1:38 AM, Kaz Kylheku wrote:
> > On 2021-04-13, olcott <No...@NoWhere.com> wrote:
> >> On 4/12/2021 5:08 PM, André G. Isaak wrote:
> >>> Even if we were to accept your view that sentences can be 'erroneous',
> >>> Gödel's sentence doesn't exhibit any of the properties which you have
> >>> thus far discussed as being 'erroneous'. You really need to learn what
> >>> Gödel's sentence actually *is* as opposed to what you imagine it to be.
> >>>
> >>> André
> >>>
> >>
> >> He acknowledges that his sentence "asserts its own unprovability"
> >> and then attempts to deny this in a particularly dodgy way that really
> >> only reaffirms the pathological self-reference of his sentence.
> >
> > Kindly shut up about Gödel, until you're willing to grapple with the
> > details of the actual sentence, rather than an explanation of it for
> > imbeciles.
> >
> >> 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
> >
> > ... but my crystal ball tells me that in the next century, there will be
> > a crank on some forum called Usenet who will insist that the proposition
> > is circular.
> >
> >> 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.
> >>
> >> If you remove the dodgy words then these words reaffirm that a
> >
> > No, "dodgy" is not a good synonym for "shit I don't fucking understand".
> >
> >> proposition asserts the unprovability of a formula that expresses this
> >> same proposition: AKA pathological self-reference.
> >>
> >> 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).
> >>
> >> Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
> >> Mathematica And Related Systems I, page 39-41.
> >>
> >> This expression is not provable because its pathological self-reference
> >> makes it a Clocksin and Mellish: "some kind of infinite structure."
> >> ?- G = not(provable(F, G)).
> >
> > There is no self-reference. See the text "In spite of appearances, there
> > is nothing circular ...".
>
> 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.
> Removing the dodgy words from the above.
> a proposition...begins by asserting the unprovability of a wholly
> determinate formula...this formula is precisely that by which the
> proposition was itself expressed.
> Paraphrasing the above using less clumsy words:
> a proposition asserts the unprovability of a formula that expresses
> this same proposition:
> Gödel's footnote 15 is dodgy in that although it denies the circularity
> of his proposition he affirms its circularity in the same paragraph that
> he denies it:
> a proposition asserts the unprovability of a formula that expresses
> this same proposition:
> AKA the same pathological self-reference as this Prolog expression:
> G = not(provable(F, G)).
>
> --
> 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-13 18:00 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <O7WdnS1JKsIav-v9nZ2dnUU7-YXNnZ2d@giganews.com> |
| In reply to | #11860 |
On 4/13/2021 4:59 PM, Mostowski Collapse wrote:
> You can only relate to what is tangible in your little
> hemisphere of toys, i.e. a Prolog interpreter or a
> C-Program. The later even does not have a boolean
>
> type, when you write (LiarParadox != true) this is even
> not possible in C-Program. What is true in C? It is
> non-zero. So you would need to write:
>
> (LiarParadox == 0)
>
THIS IS THE ACTUAL ERROR OF THE ACTUAL LIAR PARADOX.
void main()
{
bool LP = (LP != true);
}
d:\liarparadox.cpp(3) : warning C4700: uninitialized local variable 'LP'
used
The error as I said before is that a variable is assigned a value on the
basis of testing this variable before it has been initialized with a value.
Formalizing the logical (self-reference) error of the Liar Paradox
August 2016 PL Olcott
https://www.researchgate.net/publication/307442489_Formalizing_the_logical_self-reference_error_of_the_Liar_Paradox
"This sentence cannot be proven."
or in Gödel's own words:
"a proposition which asserts its own unprovability."
Has the exact same problem.
> and the result is an integer again. How on earth would
> somebody think that this has anything to do with what
> Gödel writes? In Gödels incompletness theorem
>
> provable is not an integer function from C, its a
> predication in some logic. You are comparing apples
> with oranges. In FOL with equality, you cannot use
>
> equality for formulas, it is only among terms.
>
> olcott schrieb am Dienstag, 13. April 2021 um 21:36:57 UTC+2:
>> On 4/13/2021 1:38 AM, Kaz Kylheku wrote:
>>> On 2021-04-13, olcott <No...@NoWhere.com> wrote:
>>>> On 4/12/2021 5:08 PM, André G. Isaak wrote:
>>>>> Even if we were to accept your view that sentences can be 'erroneous',
>>>>> Gödel's sentence doesn't exhibit any of the properties which you have
>>>>> thus far discussed as being 'erroneous'. You really need to learn what
>>>>> Gödel's sentence actually *is* as opposed to what you imagine it to be.
>>>>>
>>>>> André
>>>>>
>>>>
>>>> He acknowledges that his sentence "asserts its own unprovability"
>>>> and then attempts to deny this in a particularly dodgy way that really
>>>> only reaffirms the pathological self-reference of his sentence.
>>>
>>> Kindly shut up about Gödel, until you're willing to grapple with the
>>> details of the actual sentence, rather than an explanation of it for
>>> imbeciles.
>>>
>>>> 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
>>>
>>> ... but my crystal ball tells me that in the next century, there will be
>>> a crank on some forum called Usenet who will insist that the proposition
>>> is circular.
>>>
>>>> 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.
>>>>
>>>> If you remove the dodgy words then these words reaffirm that a
>>>
>>> No, "dodgy" is not a good synonym for "shit I don't fucking understand".
>>>
>>>> proposition asserts the unprovability of a formula that expresses this
>>>> same proposition: AKA pathological self-reference.
>>>>
>>>> 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).
>>>>
>>>> Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
>>>> Mathematica And Related Systems I, page 39-41.
>>>>
>>>> This expression is not provable because its pathological self-reference
>>>> makes it a Clocksin and Mellish: "some kind of infinite structure."
>>>> ?- G = not(provable(F, G)).
>>>
>>> There is no self-reference. See the text "In spite of appearances, there
>>> is nothing circular ...".
>>
>> 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.
>> Removing the dodgy words from the above.
>> a proposition...begins by asserting the unprovability of a wholly
>> determinate formula...this formula is precisely that by which the
>> proposition was itself expressed.
>> Paraphrasing the above using less clumsy words:
>> a proposition asserts the unprovability of a formula that expresses
>> this same proposition:
>> Gödel's footnote 15 is dodgy in that although it denies the circularity
>> of his proposition he affirms its circularity in the same paragraph that
>> he denies it:
>> a proposition asserts the unprovability of a formula that expresses
>> this same proposition:
>> AKA the same pathological self-reference as this Prolog expression:
>> G = not(provable(F, G)).
>>
>> --
>> 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 18:03 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <0a455b76-79a1-4eac-a73a-ff40f5ce244bn@googlegroups.com> |
| In reply to | #11861 |
I dont think there was a C compiler in 1930's when Gödel
had his paper. You are confusing the halting problem
with Gödels incompletness result. They might have the
same proof idea, but they nevertheless live in different spheres.
That they both rely on Liar ideas, doesn't mean they rely on
occurs check. Since the occurs check has nothing whatever
to do with the Liar paradox. Thats some hallucination of yours.
olcott schrieb am Mittwoch, 14. April 2021 um 01:00:29 UTC+2:
> On 4/13/2021 4:59 PM, Mostowski Collapse wrote:
> > You can only relate to what is tangible in your little
> > hemisphere of toys, i.e. a Prolog interpreter or a
> > C-Program. The later even does not have a boolean
> >
> > type, when you write (LiarParadox != true) this is even
> > not possible in C-Program. What is true in C? It is
> > non-zero. So you would need to write:
> >
> > (LiarParadox == 0)
> >
> THIS IS THE ACTUAL ERROR OF THE ACTUAL LIAR PARADOX.
>
> void main()
> {
> bool LP = (LP != true);
> }
> d:\liarparadox.cpp(3) : warning C4700: uninitialized local variable 'LP'
> used
>
> The error as I said before is that a variable is assigned a value on the
> basis of testing this variable before it has been initialized with a value.
>
>
> Formalizing the logical (self-reference) error of the Liar Paradox
> August 2016 PL Olcott
>
> https://www.researchgate.net/publication/307442489_Formalizing_the_logical_self-reference_error_of_the_Liar_Paradox
>
> "This sentence cannot be proven."
>
> or in Gödel's own words:
> "a proposition which asserts its own unprovability."
> Has the exact same problem.
> > and the result is an integer again. How on earth would
> > somebody think that this has anything to do with what
> > Gödel writes? In Gödels incompletness theorem
> >
> > provable is not an integer function from C, its a
> > predication in some logic. You are comparing apples
> > with oranges. In FOL with equality, you cannot use
> >
> > equality for formulas, it is only among terms.
> >
> > olcott schrieb am Dienstag, 13. April 2021 um 21:36:57 UTC+2:
> >> On 4/13/2021 1:38 AM, Kaz Kylheku wrote:
> >>> On 2021-04-13, olcott <No...@NoWhere.com> wrote:
> >>>> On 4/12/2021 5:08 PM, André G. Isaak wrote:
> >>>>> Even if we were to accept your view that sentences can be 'erroneous',
> >>>>> Gödel's sentence doesn't exhibit any of the properties which you have
> >>>>> thus far discussed as being 'erroneous'. You really need to learn what
> >>>>> Gödel's sentence actually *is* as opposed to what you imagine it to be.
> >>>>>
> >>>>> André
> >>>>>
> >>>>
> >>>> He acknowledges that his sentence "asserts its own unprovability"
> >>>> and then attempts to deny this in a particularly dodgy way that really
> >>>> only reaffirms the pathological self-reference of his sentence.
> >>>
> >>> Kindly shut up about Gödel, until you're willing to grapple with the
> >>> details of the actual sentence, rather than an explanation of it for
> >>> imbeciles.
> >>>
> >>>> 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
> >>>
> >>> ... but my crystal ball tells me that in the next century, there will be
> >>> a crank on some forum called Usenet who will insist that the proposition
> >>> is circular.
> >>>
> >>>> 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.
> >>>>
> >>>> If you remove the dodgy words then these words reaffirm that a
> >>>
> >>> No, "dodgy" is not a good synonym for "shit I don't fucking understand".
> >>>
> >>>> proposition asserts the unprovability of a formula that expresses this
> >>>> same proposition: AKA pathological self-reference.
> >>>>
> >>>> 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).
> >>>>
> >>>> Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
> >>>> Mathematica And Related Systems I, page 39-41.
> >>>>
> >>>> This expression is not provable because its pathological self-reference
> >>>> makes it a Clocksin and Mellish: "some kind of infinite structure."
> >>>> ?- G = not(provable(F, G)).
> >>>
> >>> There is no self-reference. See the text "In spite of appearances, there
> >>> is nothing circular ...".
> >>
> >> 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.
> >> Removing the dodgy words from the above.
> >> a proposition...begins by asserting the unprovability of a wholly
> >> determinate formula...this formula is precisely that by which the
> >> proposition was itself expressed.
> >> Paraphrasing the above using less clumsy words:
> >> a proposition asserts the unprovability of a formula that expresses
> >> this same proposition:
> >> Gödel's footnote 15 is dodgy in that although it denies the circularity
> >> of his proposition he affirms its circularity in the same paragraph that
> >> he denies it:
> >> a proposition asserts the unprovability of a formula that expresses
> >> this same proposition:
> >> AKA the same pathological self-reference as this Prolog expression:
> >> G = not(provable(F, G)).
> >>
> >> --
> >> 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 | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-13 21:26 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <FpidneuPPap_z-v9nZ2dnUU7-efNnZ2d@giganews.com> |
| In reply to | #11862 |
On 4/13/2021 8:03 PM, Mostowski Collapse wrote:
> I dont think there was a C compiler in 1930's when Gödel
> had his paper. You are confusing the halting problem
> with Gödels incompletness result. They might have the
>
> same proof idea, but they nevertheless live in different spheres.
> That they both rely on Liar ideas, doesn't mean they rely on
> occurs check. Since the occurs check has nothing whatever
>
> to do with the Liar paradox. Thats some hallucination of yours.
Tarski "proved" the the notion of truth cannot be formalized on the
basis that he could not prove that the Liar Paradox is true. It never
occurred to him that it is erroneous.
http://www.liarparadox.org/Tarski_247_248.pdf
>
> olcott schrieb am Mittwoch, 14. April 2021 um 01:00:29 UTC+2:
>> On 4/13/2021 4:59 PM, Mostowski Collapse wrote:
>>> You can only relate to what is tangible in your little
>>> hemisphere of toys, i.e. a Prolog interpreter or a
>>> C-Program. The later even does not have a boolean
>>>
>>> type, when you write (LiarParadox != true) this is even
>>> not possible in C-Program. What is true in C? It is
>>> non-zero. So you would need to write:
>>>
>>> (LiarParadox == 0)
>>>
>> THIS IS THE ACTUAL ERROR OF THE ACTUAL LIAR PARADOX.
>>
>> void main()
>> {
>> bool LP = (LP != true);
>> }
>> d:\liarparadox.cpp(3) : warning C4700: uninitialized local variable 'LP'
>> used
>>
>> The error as I said before is that a variable is assigned a value on the
>> basis of testing this variable before it has been initialized with a value.
>>
>>
>> Formalizing the logical (self-reference) error of the Liar Paradox
>> August 2016 PL Olcott
>>
>> https://www.researchgate.net/publication/307442489_Formalizing_the_logical_self-reference_error_of_the_Liar_Paradox
>>
>> "This sentence cannot be proven."
>>
>> or in Gödel's own words:
>> "a proposition which asserts its own unprovability."
>> Has the exact same problem.
>>> and the result is an integer again. How on earth would
>>> somebody think that this has anything to do with what
>>> Gödel writes? In Gödels incompletness theorem
>>>
>>> provable is not an integer function from C, its a
>>> predication in some logic. You are comparing apples
>>> with oranges. In FOL with equality, you cannot use
>>>
>>> equality for formulas, it is only among terms.
>>>
>>> olcott schrieb am Dienstag, 13. April 2021 um 21:36:57 UTC+2:
>>>> On 4/13/2021 1:38 AM, Kaz Kylheku wrote:
>>>>> On 2021-04-13, olcott <No...@NoWhere.com> wrote:
>>>>>> On 4/12/2021 5:08 PM, André G. Isaak wrote:
>>>>>>> Even if we were to accept your view that sentences can be 'erroneous',
>>>>>>> Gödel's sentence doesn't exhibit any of the properties which you have
>>>>>>> thus far discussed as being 'erroneous'. You really need to learn what
>>>>>>> Gödel's sentence actually *is* as opposed to what you imagine it to be.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> He acknowledges that his sentence "asserts its own unprovability"
>>>>>> and then attempts to deny this in a particularly dodgy way that really
>>>>>> only reaffirms the pathological self-reference of his sentence.
>>>>>
>>>>> Kindly shut up about Gödel, until you're willing to grapple with the
>>>>> details of the actual sentence, rather than an explanation of it for
>>>>> imbeciles.
>>>>>
>>>>>> 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
>>>>>
>>>>> ... but my crystal ball tells me that in the next century, there will be
>>>>> a crank on some forum called Usenet who will insist that the proposition
>>>>> is circular.
>>>>>
>>>>>> 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.
>>>>>>
>>>>>> If you remove the dodgy words then these words reaffirm that a
>>>>>
>>>>> No, "dodgy" is not a good synonym for "shit I don't fucking understand".
>>>>>
>>>>>> proposition asserts the unprovability of a formula that expresses this
>>>>>> same proposition: AKA pathological self-reference.
>>>>>>
>>>>>> 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).
>>>>>>
>>>>>> Godel, Kurt 1931. On Formally Undecidable Propositions of Principia
>>>>>> Mathematica And Related Systems I, page 39-41.
>>>>>>
>>>>>> This expression is not provable because its pathological self-reference
>>>>>> makes it a Clocksin and Mellish: "some kind of infinite structure."
>>>>>> ?- G = not(provable(F, G)).
>>>>>
>>>>> There is no self-reference. See the text "In spite of appearances, there
>>>>> is nothing circular ...".
>>>>
>>>> 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.
>>>> Removing the dodgy words from the above.
>>>> a proposition...begins by asserting the unprovability of a wholly
>>>> determinate formula...this formula is precisely that by which the
>>>> proposition was itself expressed.
>>>> Paraphrasing the above using less clumsy words:
>>>> a proposition asserts the unprovability of a formula that expresses
>>>> this same proposition:
>>>> Gödel's footnote 15 is dodgy in that although it denies the circularity
>>>> of his proposition he affirms its circularity in the same paragraph that
>>>> he denies it:
>>>> a proposition asserts the unprovability of a formula that expresses
>>>> this same proposition:
>>>> AKA the same pathological self-reference as this Prolog expression:
>>>> G = not(provable(F, G)).
>>>>
>>>> --
>>>> 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 | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 16:41 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <UPGdndbRYoQCI-n9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #11826 |
On 4/12/2021 2:57 PM, Mostowski Collapse wrote: > You cannot redefine (=)/2 in Prolog. Gödels theorem uses some > Higher Order Logic. You need to check his paper which kind of > equality he uses. In other logics than Prolog usually you can > Gödel's theorem is based entirely in arithmetic that is almost entirely first order logic. https://en.wikipedia.org/wiki/Peano_axioms > change (=)/2 by adding axioms for (=)/2. For example in FOL: > > /* works in FOL */ > morning_star = evening_star |- morning_star = evening_star > > You cannot do the same, you cannot force Prolog so that: > > /* doesn't work in Prolog, how would you make an axiom for (=)/2. > Thats impossible (=)/2 is a so called built-in. */ > ?- morning_star = evening_star > false > > yields "true". So whats the equality that Gödels Theorem uses? > Is it the same as in Prolog or does he assume some other Logic. > Go check it out, shouldn't be so difficult to figure out. > > P.S.: If (=)/2 is not a built-in in your Prolog system, and if > you define it as follows: > > equal(X,X). > > Still you wont have ?- equal(morning_star, evening_star). Because > any divergence from the single fact "equal(X,X)" is not anymore > the definition of Prolog equality. > > olcott schrieb am Montag, 12. April 2021 um 18:12:37 UTC+2: >> On 4/12/2021 10:21 AM, Mostowski Collapse wrote: >>> And? This here: >>> >>>> ?- G = not(provable(F, G)). % G = ¬(F ⊢ G) >>> >>> Is not the same as: >>> >>> % G <=> ¬(F ⊢ G) >>> >>> (=)/2 is only syntactic equality, its not biconditional. >>> >> It does not have to be the same. >> Infix operators can be translated into functions. >> >> This is the Clocksin Mellish example >> equal(X, X). >> ?- equal(foo(Y), Y). >> >> This would also be a term with an infinite structure: >> biconditional(X, X). >> ?- biconditional(foo(Y), Y). >> >> Besides that we are only working on one half of the RHS at a time. >> The LHS is merely the result of satisfying the RHS. >> >> (T ⊬ φ) is >> ?- unify_with_occurs_check(φ, not(provable(T, φ))). >> false >> >> (T ⊬ ¬φ) is >> ?- unify_with_occurs_check(φ, not(provable(T, not(φ)))). >> false. >>>>> The point is that my extremely simplified sentence meets the >>>> conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ >>>> (T ⊬ ¬φ)) >>> >>> Nope, since (=)/2 isn'^t biconditional. >>> >> We are only concerned with the fact that the RHS is satified. >> The LHS is the result of the RHS being satisfied. >>> olcott schrieb am Montag, 12. April 2021 um 16:56:32 UTC+2: >>>> On 4/11/2021 8:27 PM, Kaz Kylheku wrote: >>>>> On 2021-04-11, olcott <No...@NoWhere.com> wrote: >>>>>> On 4/9/2021 6:16 PM, olcott wrote: >>>>>>> Clocksin and Mellish says that this fails an occurs check: >>>>>>> ?- equal(foo(Y), Y). >>>>>>> >>>>>>> 254 Chapter 10 The Relation of Prolog to Logic >>>>>>> Programming in Prolog Using the ISO Standard Fifth Edition by Clocksin >>>>>>> and Mellish >>>>>>> >>>>>>> >>>>>>> Does that mean that this also fails an occurs check: >>>>>>> ?- equal(foo(X,Y), Y). >>>>>>> >>>>>> >>>>>> ?- G = not(provable(F, G)). % G = ¬(F ⊢ G) >>>>>> ?- unify_with_occurs_check(G, not(provable(F, G))). >>>>>> false. >>>>> >>>>> Until you show your code and execution traces from a real Prolog >>>>> implementation that you have installed and learned how to operate, >>>>> nobody should take you seriously. >>>> Welcome to SWI-Prolog (threaded, 64 bits, version 7.6.4) >>>> SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. >>>> Please run ?- license. for legal details. >>>> >>>> For online help and background, visit http://www.swi-prolog.org >>>> For built-in help, use ?- help(Topic). or ?- apropos(Word). >>>> ?- G = not(provable(F, G)). % G = ¬(F ⊢ G) >>>> G = not(provable(F, G)). >>>> ?- unify_with_occurs_check(G, not(provable(F, G))). >>>> false. >>>> ?- >>>>> >>>>> Moreover, I cannot take you seriously until you show a valiant attempt >>>>> to encode the **real Gödel sentence** into Prolog. You know: teach >>>>> Prolog how to work with the the Gödel numbering and all. >>>>> >>>> The point is that my extremely simplified sentence meets the >>>> conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ >>>> (T ⊬ ¬φ)) >>>> thus proving that it is logically equivalent to the Gödel sentence. >>>> >>>> That it meets the conventional definition of incompleteness with an >>>> erroneous infinite term proves that the definition of incompleteness is >>>> flawed. The 1931 Incompleteness theorem depends on this flawed definition. >>>>> (Tip: you might need a bit of a RAM upgrade.) >>>>> >>>>> "Simplified Gödel sentence" means exactly the same thing as "not the >>>>> Gödel sentence", because by "simplified" you do not mean "algebraically >>>>> simplified", but "dumbed down into a kind of sketch to expain the gist >>>>> of it to laymen". >>>>> >>>>> "Simplified Gödel sentence" is good for nothing in terms of proving >>>>> or disproving something. It's a complete strawman. >>>>> >>>> -- >>>> 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 | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 11:15 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <RdydnRtgR9ue7-n9nZ2dnUU7-YGdnZ2d@giganews.com> |
| In reply to | #11821 |
On 4/12/2021 10:21 AM, Mostowski Collapse wrote: > And? This here: > >> ?- G = not(provable(F, G)). % G = ¬(F ⊢ G) > > Is not the same as: > > % G <=> ¬(F ⊢ G) > > (=)/2 is only syntactic equality, its not biconditional. > It does not have to be the same. Infix operators can be translated into functions. This is the Clocksin Mellish example equal(X, X). ?- equal(foo(Y), Y). This would also be a term with an infinite structure: biconditional(X, X). ?- biconditional(foo(Y), Y). Besides that we are only working on one half of the RHS at a time. The LHS is merely the result of satisfying the RHS. (T ⊬ φ) is ?- unify_with_occurs_check(φ, not(provable(T, φ))). false (T ⊬ ¬φ) is ?- unify_with_occurs_check(φ, not(provable(T, not(φ)))). false. >>> The point is that my extremely simplified sentence meets the >> conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ >> (T ⊬ ¬φ)) > > Nope, since (=)/2 isn'^t biconditional. > We are only concerned with the fact that the RHS is satified. The LHS is the result of the RHS being satisfied. > olcott schrieb am Montag, 12. April 2021 um 16:56:32 UTC+2: >> On 4/11/2021 8:27 PM, Kaz Kylheku wrote: >>> On 2021-04-11, olcott <No...@NoWhere.com> wrote: >>>> On 4/9/2021 6:16 PM, olcott wrote: >>>>> Clocksin and Mellish says that this fails an occurs check: >>>>> ?- equal(foo(Y), Y). >>>>> >>>>> 254 Chapter 10 The Relation of Prolog to Logic >>>>> Programming in Prolog Using the ISO Standard Fifth Edition by Clocksin >>>>> and Mellish >>>>> >>>>> >>>>> Does that mean that this also fails an occurs check: >>>>> ?- equal(foo(X,Y), Y). >>>>> >>>> >>>> ?- G = not(provable(F, G)). % G = ¬(F ⊢ G) >>>> ?- unify_with_occurs_check(G, not(provable(F, G))). >>>> false. >>> >>> Until you show your code and execution traces from a real Prolog >>> implementation that you have installed and learned how to operate, >>> nobody should take you seriously. >> Welcome to SWI-Prolog (threaded, 64 bits, version 7.6.4) >> SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. >> Please run ?- license. for legal details. >> >> For online help and background, visit http://www.swi-prolog.org >> For built-in help, use ?- help(Topic). or ?- apropos(Word). >> ?- G = not(provable(F, G)). % G = ¬(F ⊢ G) >> G = not(provable(F, G)). >> ?- unify_with_occurs_check(G, not(provable(F, G))). >> false. >> ?- >>> >>> Moreover, I cannot take you seriously until you show a valiant attempt >>> to encode the **real Gödel sentence** into Prolog. You know: teach >>> Prolog how to work with the the Gödel numbering and all. >>> >> The point is that my extremely simplified sentence meets the >> conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ >> (T ⊬ ¬φ)) >> thus proving that it is logically equivalent to the Gödel sentence. >> >> That it meets the conventional definition of incompleteness with an >> erroneous infinite term proves that the definition of incompleteness is >> flawed. The 1931 Incompleteness theorem depends on this flawed definition. >>> (Tip: you might need a bit of a RAM upgrade.) >>> >>> "Simplified Gödel sentence" means exactly the same thing as "not the >>> Gödel sentence", because by "simplified" you do not mean "algebraically >>> simplified", but "dumbed down into a kind of sketch to expain the gist >>> of it to laymen". >>> >>> "Simplified Gödel sentence" is good for nothing in terms of proving >>> or disproving something. It's a complete strawman. >>> >> -- >> 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-13 06:27 +0000 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <20210412232244.290@kylheku.com> |
| In reply to | #11819 |
On 2021-04-12, olcott <NoOne@NoWhere.com> wrote: > On 4/11/2021 8:27 PM, Kaz Kylheku wrote: >> Moreover, I cannot take you seriously until you show a valiant attempt >> to encode the **real Gödel sentence** into Prolog. You know: teach >> Prolog how to work with the the Gödel numbering and all. >> > > The point is that my extremely simplified sentence meets the > conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ Whose definition is this? From where? What literature attests to its equivalence to the Gödel sentence, that is not a Usenet posting of yours? > (T ⊬ ¬φ)) > thus proving that it is logically equivalent to the Gödel sentence. So, like, Gödel wasted his time with that whole numbering scheme whereby he constructed a sentence which says that some number G (wholly embedded in that sentence) is not the Gödel number of a provable sentence, and G turns out to be the Gödel number of that very same sentence? You can just sweep that under the rug, stick a fork into your simplified sentence, and call the turkey done? For those who don't work on faith, do you have a proof that this simplified sentence is equivalent to that Gödel-numbered construction? -- 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-04-13 12:03 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <c-ydnbZ_hJRGU-j9nZ2dnUU7-W3NnZ2d@giganews.com> |
| In reply to | #11834 |
On 4/13/2021 1:27 AM, Kaz Kylheku wrote: > On 2021-04-12, olcott <NoOne@NoWhere.com> wrote: >> On 4/11/2021 8:27 PM, Kaz Kylheku wrote: >>> Moreover, I cannot take you seriously until you show a valiant attempt >>> to encode the **real Gödel sentence** into Prolog. You know: teach >>> Prolog how to work with the the Gödel numbering and all. >>> >> >> The point is that my extremely simplified sentence meets the >> conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ > > Whose definition is this? From where? What literature attests > to its equivalence to the Gödel sentence, that is not a Usenet posting > of yours? > This common knowledge is also quoted from this source: The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. https://plato.stanford.edu/entries/goedel-incompleteness/ >> (T ⊬ ¬φ)) >> thus proving that it is logically equivalent to the Gödel sentence. > > So, like, Gödel wasted his time with that whole numbering scheme whereby > he constructed a sentence which says that some number G (wholly embedded > in that sentence) is not the Gödel number of a provable sentence, and G > turns out to be the Gödel number of that very same sentence? It wasn't a total waste of time a 24 year old kid is still famous today for his work. > You can just sweep that under the rug, stick a fork into your > simplified sentence, and call the turkey done? The fact that a formal expression of language does prove that its formal system is incomplete even though this formal expression of language is erroneous proves that the definition of incomplete is faulty. > For those who don't work on faith, do you have a proof that this > simplified sentence is equivalent to that Gödel-numbered construction? 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. Removing the dodgy words from the above. a proposition...begins by asserting the unprovability of a wholly determinate formula...this formula is precisely that by which the proposition was itself expressed. Paraphrasing the above using less clumsy words: a proposition asserts the unprovability of a formula that expresses this same proposition: 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. Godel, Kurt 1931. On Formally Undecidable Propositions of Principia Mathematica And Related Systems I, page 39-41. This paper has been updated with a page with the above words. https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence Gödel's footnote 15 is dodgy in that although it denies the circularity of his proposition he affirms its circularity in the same paragraph that he denies it: a proposition asserts the unprovability of a formula that expresses this same proposition -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <janburse@fastmail.fm> |
|---|---|
| Date | 2021-04-13 19:27 +0200 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <s54ka6$qu9$1@solani.org> |
| In reply to | #11843 |
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. 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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-13 12:45 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <9tWdnf2tH71QRej9nZ2dnUU78cfNnZ2d@giganews.com> |
| In reply to | #11846 |
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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-13 10:54 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <9e874537-c166-4ac2-a053-45e9ee5b6de8n@googlegroups.com> |
| In reply to | #11848 |
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. 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
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-13 13:13 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <xL6dnc5i-oLXQuj9nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #11849 |
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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-13 11:21 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <f79f1866-dfab-479e-8523-23f20360c872n@googlegroups.com> |
| In reply to | #11853 |
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? 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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-13 11:32 -0700 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <e8c374de-1201-4322-8684-d043a02bed97n@googlegroups.com> |
| In reply to | #11854 |
You claimed yourself Gödel used FOL in his incompletness proof, which might be sufficient but Gödel introduces another logic in his incompletness proof paper. But anyway, take FOL. What is provable(_) a term or a formula. To the best of my knowledge provable(_) is a predicate in his paper, bew(_) beweis. Therefore is a formula, how comes that you use it on the RHS of (=)/2? Doesn't make any sense. You cannot equate predicates in FOL. Mostowski Collapse schrieb am Dienstag, 13. April 2021 um 20:21:18 UTC+2: > 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? > 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
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-13 14:30 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <qZCdnSzmF4irbOj9nZ2dnUU7-fvNnZ2d@giganews.com> |
| In reply to | #11855 |
On 4/13/2021 1:32 PM, Mostowski Collapse wrote: > You claimed yourself Gödel used FOL in his incompletness > proof, which might be sufficient but Gödel introduces another > logic in his incompletness proof paper. > Gödel constructs his entire proof on the basis of arithmetic. Arithmetic mostly has FOL as its basis. Through some enormously convoluted mess of complexity he ends up "with a proposition which asserts its own unprovability.15" Which is necessarily the same kind of vacuous expression as this C program: int main() bool LiarParadox = (LiarParadox != true); } It assigns a Boolean value to its variable on the basis of testing the Boolean value of this variable before it has been initialized with any value. Which is the exactly same pathological self-reference as: "matching an uninstantiated subterm of itself" in Prolog. https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence > But anyway, take FOL. What is provable(_) a term or a formula. > To the best of my knowledge provable(_) is a predicate in his > paper, bew(_) beweis. Therefore is a formula, > > how comes that you use it on the RHS of (=)/2? Doesn't make > any sense. You cannot equate predicates in FOL. > > Mostowski Collapse schrieb am Dienstag, 13. April 2021 um 20:21:18 UTC+2: >> 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? >> 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:28 +0000 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <20210413192559.736@kylheku.com> |
| In reply to | #11858 |
["Followup-To:" header set to comp.theory.] On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: > On 4/13/2021 1:32 PM, Mostowski Collapse wrote: >> You claimed yourself Gödel used FOL in his incompletness >> proof, which might be sufficient but Gödel introduces another >> logic in his incompletness proof paper. >> > > Gödel constructs his entire proof on the basis of arithmetic. > Arithmetic mostly has FOL as its basis. > > Through some enormously convoluted mess of complexity he ends up > "with a proposition which asserts its own unprovability.15" > > Which is necessarily the same kind of vacuous expression as this C program: > > int main() > bool LiarParadox = (LiarParadox != true); > } Gödel specifically discovered and noted in his writings that the Gödel numbering trick used for constructing his Gödel sentence is not applicable to the Liar Paradox. This is not the first time I'm pointing this out; you really should take some meds for the memory lapse problem.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-14 11:56 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <e7-dnY3rquBTg-r9nZ2dnUU7-TlQAAAA@giganews.com> |
| In reply to | #11858 |
On 4/13/2021 9:30 PM, Kaz Kylheku wrote: > On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: >> On 4/13/2021 3:02 PM, André G. Isaak wrote: >>> But Gödel’s actual sentence doesn't assign any sort of value to >>> anything. There is no assignment operator in FOL, nor is there such a >>> thing as an uninitialized variable. >>> >> >> It all boils down to this case: >> "This sentence cannot be proven." >> because it is vacuous. > > It seems to boils down that because you're too stupid (and, more > importantly, willfully ignorant) to learn about the real thing and what > it actually says. > ...there is also a close relationship with the “liar” antinomy,14 ... 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. ...there is also a close relationship with the “liar” antinomy,14 ... 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. ...there is also a close relationship with the “liar” antinomy,14 ... 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. ...there is also a close relationship with the “liar” antinomy,14 ... 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. > Willful ignorance is abhorrently ugly. It makes you into a > cringe-inducing maggot. > > Why would you do that to youself? > -- 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-04-14 11:05 -0600 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <s577ck$bd3$1@dont-email.me> |
| In reply to | #11874 |
On 2021-04-14 10:56, olcott wrote: > On 4/13/2021 9:30 PM, Kaz Kylheku wrote: >> On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: >>> On 4/13/2021 3:02 PM, André G. Isaak wrote: >>>> But Gödel’s actual sentence doesn't assign any sort of value to >>>> anything. There is no assignment operator in FOL, nor is there such a >>>> thing as an uninitialized variable. >>>> >>> >>> It all boils down to this case: >>> "This sentence cannot be proven." >>> because it is vacuous. >> >> It seems to boils down that because you're too stupid (and, more >> importantly, willfully ignorant) to learn about the real thing and what >> it actually says. >> > > ...there is also a close relationship with the “liar” antinomy,14 ... > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. > There is also a close relationship between the Theory of Special Relativity and Maxwell’s Equations. That doesn't mean they are the same thing, nor that one is an accurate translation of the other. So what is the close relationship which Gödel refers to? You assume it is one of identity, but it is not (if it were, Gödel would have used the term 'equivalence' rather than 'close relationship'). If you want to learn what the actual relationship he refers to is, you need to read the damn math! André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-14 12:09 -0500 |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Message-ID | <kqadnawYjpQjvOr9nZ2dnUU7-SOdnZ2d@giganews.com> |
| In reply to | #11875 |
On 4/14/2021 12:05 PM, André G. Isaak wrote: > On 2021-04-14 10:56, olcott wrote: >> On 4/13/2021 9:30 PM, Kaz Kylheku wrote: >>> On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/13/2021 3:02 PM, André G. Isaak wrote: >>>>> But Gödel’s actual sentence doesn't assign any sort of value to >>>>> anything. There is no assignment operator in FOL, nor is there such a >>>>> thing as an uninitialized variable. >>>>> >>>> >>>> It all boils down to this case: >>>> "This sentence cannot be proven." >>>> because it is vacuous. >>> >>> It seems to boils down that because you're too stupid (and, more >>> importantly, willfully ignorant) to learn about the real thing and what >>> it actually says. >>> >> >> ...there is also a close relationship with the “liar” antinomy,14 ... >> 14 Every epistemological antinomy can likewise be used for a similar >> undecidability proof. >> > > There is also a close relationship between the Theory of Special > Relativity and Maxwell’s Equations. That doesn't mean they are the same > thing, nor that one is an accurate translation of the other. So what is > the close relationship which Gödel refers to? You assume it is one of > identity, but it is not (if it were, Gödel would have used the term > 'equivalence' rather than 'close relationship'). If you want to learn > what the actual relationship he refers to is, you need to read the damn > math! > > André > 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. The liar paradox <is> and epistemological antinomy therefore the liar paradox can likewise be used for a similar undecidability proof. You must be dumber than a box of rocks. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 3 of 4 — ← Prev page 1 2 [3] 4 Next page →
Back to top | Article view | comp.lang.prolog
csiph-web