Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #30760 > unrolled thread

Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)).

Started byolcott <NoOne@NoWhere.com>
First post2021-04-10 22:26 -0500
Last post2021-04-13 00:09 -0700
Articles 16 on this page of 76 — 9 participants

Back to article view | Back to comp.theory

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  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"odel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). R Kym Horsell <kym@kymhorsell.com> - 2021-04-11 05:04 +0000
      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"odel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). R Kym Horsell <kym@kymhorsell.com> - 2021-04-11 06:01 +0000
            Re: Simplified G"odel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 09:30 -0500
          Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-11 14:03 +0100
          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)). 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 <janburse@fastmail.fm> - 2021-04-11 22:00 +0200
              Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 15:31 -0500
                Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 18:57 -0500
                  Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). André G. Isaak <agisaak@gm.invalid> - 2021-04-11 19:29 -0600
                    Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-12 02:11 +0000
                      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 10:06 -0500
                      Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). André G. Isaak <agisaak@gm.invalid> - 2021-04-12 12:50 -0600
                        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)). André G. Isaak <agisaak@gm.invalid> - 2021-04-12 14:04 -0600
                            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)). André G. Isaak <agisaak@gm.invalid> - 2021-04-12 16:37 -0600
                              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)). R Kym Horsell <kym@kymhorsell.com> - 2021-04-13 08:08 +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"odel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). R Kym Horsell <kym@kymhorsell.com> - 2021-04-14 23:59 +0000
                                Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 19:30 -0500
                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)). olcott <NoOne@NoWhere.com> - 2021-04-12 09:45 -0500
    Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-12 01:27 +0000
      Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 09:56 -0500
        Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 11:15 -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)). André G. Isaak <agisaak@gm.invalid> - 2021-04-12 16:04 -0600
        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)). André G. Isaak <agisaak@gm.invalid> - 2021-04-12 16:08 -0600
            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)). André G. Isaak <agisaak@gm.invalid> - 2021-04-12 22:00 -0600
                Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-13 06: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-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)). olcott <NoOne@NoWhere.com> - 2021-04-13 18:00 -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 11:04 -0500
          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)). olcott <NoOne@NoWhere.com> - 2021-04-13 13:13 -0500
                  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)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 02:25 +0000
                      Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:52 -0500
                  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)). André G. Isaak <agisaak@gm.invalid> - 2021-04-13 14:02 -0600
                      Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 15:29 -0500
                        Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). André G. Isaak <agisaak@gm.invalid> - 2021-04-13 17:37 -0600
                          Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:50 -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:30 +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)). 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-15 11:18 -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 18:16 +0000
                                          Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-15 14:18 -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:55 -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:28 +0000
    Pete Olcott spammer of sci.math Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-13 00:09 -0700

Page 4 of 4 — ← Prev page 1 2 3 [4]


#30910

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-04-13 17:37 -0600
Message-ID<s559uu$g2s$1@dont-email.me>
In reply to#30907
On 2021-04-13 14:29, olcott wrote:
> On 4/13/2021 3:02 PM, André G. Isaak wrote:
>> On 2021-04-13 13:30, olcott 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);
>>> }
>>>
>>> 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.
>>
>> 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.

But that sentence is not Gödel's G, which is not vacuous. All your 
attempts to 'translate' Gödel's G into natural language or C or Prolog 
are meaningless given that you don't know what Gödel's G actually is.

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#30965

Fromolcott <NoOne@NoWhere.com>
Date2021-04-14 11:50 -0500
Message-ID<sqidncp5CLjxgOr9nZ2dnUU7-QnNnZ2d@giganews.com>
In reply to#30910
On 4/13/2021 6:37 PM, André G. Isaak wrote:
> On 2021-04-13 14:29, olcott wrote:
>> On 4/13/2021 3:02 PM, André G. Isaak wrote:
>>> On 2021-04-13 13:30, olcott 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);
>>>> }
>>>>
>>>> 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.
>>>
>>> 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.
> 
> But that sentence is not Gödel's G, which is not vacuous. All your 
> attempts to 'translate' Gödel's G into natural language or C or Prolog 
> are meaningless given that you don't know what Gödel's G actually is.
> 
> André
> 

We are therefore confronted with a proposition which asserts its own 
unprovability.15

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

Since Gödel says that: “Every epistemological antinomy can likewise be 
used for a similar undecidability proof.” (including the liar antimony 
AKA liar paradox) then we can analyze how Prolog handles the Liar Paradox:

?- LP = not(true(LP)).
LP = not(true(LP)).

?- unify_with_occurs_check(LP, not(true(LP))).
false.

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.


Updated with the above analysis:

Prolog detects pathological self reference in the Gödel sentence
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]


#30925

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-04-14 02:30 +0000
Message-ID<20210413192857.667@kylheku.com>
In reply to#30907
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.

Willful ignorance is abhorrently ugly. It makes you into a
cringe-inducing maggot.

Why would you do that to youself?

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal

[toc] | [prev] | [next] | [standalone]


#30968

Fromolcott <NoOne@NoWhere.com>
Date2021-04-14 11:56 -0500
Message-ID<e7-dnY3rquBTg-r9nZ2dnUU7-TlQAAAA@giganews.com>
In reply to#30925
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]


#30970

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-04-14 11:05 -0600
Message-ID<s577ck$bd3$1@dont-email.me>
In reply to#30968
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]


#30971

Fromolcott <NoOne@NoWhere.com>
Date2021-04-14 12:09 -0500
Message-ID<kqadnawYjpQjvOr9nZ2dnUU7-SOdnZ2d@giganews.com>
In reply to#30970
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]


#31005

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-04-15 00:32 +0000
Message-ID<20210414172903.469@kylheku.com>
In reply to#30971
["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]


#31044

Fromolcott <NoOne@NoWhere.com>
Date2021-04-15 10:00 -0500
Message-ID<PL2dndJe_c2PyOX9nZ2dnUU7-dGdnZ2d@giganews.com>
In reply to#31005
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]


#31052

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-04-15 15:43 +0000
Message-ID<20210415083340.550@kylheku.com>
In reply to#31044
["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]


#31058

Fromolcott <NoOne@NoWhere.com>
Date2021-04-15 11:18 -0500
Message-ID<3LmdnZFMcJjO-uX9nZ2dnUU7-YvNnZ2d@giganews.com>
In reply to#31052
On 4/15/2021 10:43 AM, Kaz Kylheku wrote:
> ["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.
> 

At the level of natural language exegesis of Gödel's words the only 
possible rebuttals are ridiculously implausible.

Maybe when Gödel said:
 >> 14 Every epistemological antinomy can likewise be used for a similar
 >> undecidability proof. (Gödel 1931:39-41)

He meant Not(Every epistemological antinomy can likewise be used for a 
similar undecidability proof). The direct opposite of what he said.

Antinomy (Greek ἀντί, antí, "against, in opposition to", and νόμος, 
nómos, "law") refers to a real or apparent mutual incompatibility of two 
laws.[1] It is a term used in logic and epistemology, particularly in 
the philosophy of Kant...

A paradox such as "this sentence is false" can also be considered to be 
an antinomy; for the sentence to be true, it must be false, and vice 
versa. https://en.wikipedia.org/wiki/Antinomy

Antinomy (Greek αντι-, against, plus νομος, law) literally means the 
mutual incompatibility, real or apparent, of two laws. It is a term 
often used in logic and epistemology, when describing a paradox or 
unresolvable contradiction. 
https://www.newworldencyclopedia.org/entry/Antinomy





-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#31067

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-04-15 18:16 +0000
Message-ID<20210415110905.26@kylheku.com>
In reply to#31058
On 2021-04-15, olcott <NoOne@NoWhere.com> wrote:
> At the level of natural language exegesis of Gödel's words the only 
> possible rebuttals are ridiculously implausible.

You mean, "the natural language exegesis of Gödel's informal remarks
that reference his work, and not the work itself ..."

> Maybe when Gödel said:
> >> 14 Every epistemological antinomy can likewise be used for a similar
> >> undecidability proof. (Gödel 1931:39-41)
>
> He meant Not(Every epistemological antinomy can likewise be used for a 
> similar undecidability proof). The direct opposite of what he said.

Or maybe he meant that his technique can be applied to all sorts of
formal systems that have axioms and derivations, and which embed enough
mathematics so that they can encode their formulas and work with them
arithmetically.

Nobody actually cares what he meant, because that sentence isn't a
famous theorem attributed to Gödel's.  It's about as relevant as what
Gödel ate for breakfast that morning.

Maybe he simply made a mistake in that sentence, or just used sloppy
wording, trusting that it will be read by someone intelligent who is
genuinely interested in his work, rather than cutting apart English
translations of some surface remarks.

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal

[toc] | [prev] | [next] | [standalone]


#31072

Fromolcott <NoOne@NoWhere.com>
Date2021-04-15 14:18 -0500
Message-ID<Zd6dnby-NIv1DOX9nZ2dnUU7-RHNnZ2d@giganews.com>
In reply to#31067
On 4/15/2021 1:16 PM, Kaz Kylheku wrote:
> On 2021-04-15, olcott <NoOne@NoWhere.com> wrote:
>> At the level of natural language exegesis of Gödel's words the only
>> possible rebuttals are ridiculously implausible.
> 
> You mean, "the natural language exegesis of Gödel's informal remarks
> that reference his work, and not the work itself ..."
> 
>> Maybe when Gödel said:
>>>> 14 Every epistemological antinomy can likewise be used for a similar
>>>> undecidability proof. (Gödel 1931:39-41)
>>
>> He meant Not(Every epistemological antinomy can likewise be used for a
>> similar undecidability proof). The direct opposite of what he said.
> 
> Or maybe he meant that his technique can be applied to all sorts of
> formal systems that have axioms and derivations, and which embed enough
> mathematics so that they can encode their formulas and work with them
> arithmetically.
> 
> Nobody actually cares what he meant, because that sentence isn't a
> famous theorem attributed to Gödel's.  It's about as relevant as what
> Gödel ate for breakfast that morning.
> 
> Maybe he simply made a mistake in that sentence, or just used sloppy
> wording, trusting that it will be read by someone intelligent who is
> genuinely interested in his work, rather than cutting apart English
> translations of some surface remarks.
> 

If his sentence is unprovable in PA only because PA is insufficiently 
expressive to prove this sentence and this sentence is a sentence of PA, 
then it would make perfect sense to say that PA is incomplete.

If his sentence is unprovable in PA and the fact that it is unprovable 
in PA is (for example) provable type theory then we could say type 
theory proves that his sentence is not provable in PA.

When we say it is true and unprovable we are not really saying that it 
is true and unprovable. We are actually saying that it is true that it 
is unprovable in PA. If it was totally unprovable in every formal system 
then it would simply be untrue.

There is no formal system that can prove a sentence of this formal 
system only expressing its own unprovability because such a sentence is 
erroneous:  “This sentence cannot be proven.” is semantically vacuous. 
“This sentence cannot be proven to be a box of chocolates.” can be 
proven to be true.

Here it is in Prolog:
?- 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]


#30922

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-04-14 02:28 +0000
Message-ID<20210413192559.736@kylheku.com>
In reply to#30902
["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]


#30967

Fromolcott <NoOne@NoWhere.com>
Date2021-04-14 11:55 -0500
Message-ID<e7-dnZLrquAZg-r9nZ2dnUU7-TnNnZ2d@giganews.com>
In reply to#30922
On 4/13/2021 9:28 PM, Kaz Kylheku wrote:
> ["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.

He actually says the exact opposite:

...there is also a close relationship with the “liar” antinomy,14 ...

We are therefore confronted with a proposition which asserts its own 
unprovability.15

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

(Gödel 1931:39-41)

> This is not the first time I'm pointing this out; you really should take
> some meds for the memory lapse problem.
> 

You can point out a falsehood an infinite number of times and it still 
remains a falsehood.

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#31003

FromKaz Kylheku <563-365-8930@kylheku.com>
Date2021-04-15 00:28 +0000
Message-ID<20210414172559.746@kylheku.com>
In reply to#30967
On 2021-04-14, olcott <NoOne@NoWhere.com> wrote:
>> 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.
>
> He actually says the exact opposite:

No, he doesn't. In parallel with Tarski, he discovered that a sentence
like "Q is not the Gödel number of a true sentence" cannot be encoded in
arithmetic.

https://en.wikipedia.org/wiki/Tarski%27s_undefinability_theorem

You are willfully, truculantly misinformed, which is a despicable
quality.

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal

[toc] | [prev] | [next] | [standalone]


#30864 — Pete Olcott spammer of sci.math

FromArchimedes Plutonium <plutonium.archimedes@gmail.com>
Date2021-04-13 00:09 -0700
SubjectPete Olcott spammer of sci.math
Message-ID<2d9084c5-bc4d-45ef-bd09-dd56df4ac904n@googlegroups.com>
In reply to#30760
Why Pete Olcott loves to spam sci.math when this b.s. belongs over here

Pete Olcott, that b.s. spammer of 2 OR 1 = 3 with 2 AND 1 = 1, that failure of logic. Read AP's true Logic-- Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) 

Everything that Pete does, says or thinks in Logic is one complete worthless pile of b.s. until he accepts the true connectors of logic with AND truth table TTTF. 

Otherwise, Pete is as full of shit in logic as was Boole with his AND as TFFF 

No point in talking about anything in and of logic -- until you accept the true connectors of AND, OR, IF->Then, Equal-Not. 

Godel was a rinky dink failure of logic, who was so dumb in logic that he thought 10 OR 2= 12 with AND as subtraction. 

Pete just loves to spam sci.math with his worthless dreck. 

5th published book 

Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition 
by Archimedes Plutonium (Author) 

Last revision was 29Mar2021. This is AP's 5th published book of science. 
Preface: 
First comes Logic-- think straight and clear which many logic and math professors are deaf dumb and blind to, and simply refuse to recognize and fix their errors. 

The single biggest error of Old Logic of Boole and Jevons was their "AND" and "OR" connectors. They got them mixed up and turned around. For their logic ends up being that of 3 OR 2 = 5 with 3 AND 2 = either 3 or 2 but never 5, when even the local village idiot knows that 3 AND 2 = 5 (addition) with 3 OR 2 = either 3 or 2 (subtraction). The AND connector in Logic stems from the idea, the mechanism involved, that given a series of statements, if just one of those many statements has a true truth value, then the entire string of statements is overall true, and thus AND truth table is truly TTTF and never TFFF. And secondly, their error of the If->Then conditional. I need to make it clear enough to the reader why the true Truth Table of IF --> Then requires a U for unknown or uncertain with a probability outcome for F --> T = U and F --> F = U. Some smart readers would know that the reason for the U is because without the U, Logic has no means of division by 0 which is undefined in mathematics. You cannot have a Logic that is less than mathematics. A logic that is impoverished and cannot do a "undefined for division by 0 in mathematics". The true logic must be able to have the fact that division by 0 is undefined. True logic is larger than all of mathematics, and must be able to fetch any piece of mathematics from out of Logic itself. So another word for U is undefined. And this is the crux of why Reductio ad Absurdum cannot be a proof method of mathematics, for a starting falsehood in a mathematics proof can only lead to a probability end conclusion. 

My corrections of Old Logic have a history that dates before 1993, sometime around 1991, I realized the Euclid proof of infinitude of primes was illogical, sadly sadly wrong, in that the newly formed number by "multiply the lot and add 1" was necessarily a new prime in the indirect proof method. So that my history of fixing Old Logic starts in 1991, but comes to a synthesis of correcting all four of the connectors of Equal/not, And, Or, If->Then, by 2015. 

Cover picture: some may complain my covers are less in quality, but I have a good reason for those covers-- I would like covers of math or logic to show the teacher's own handwriting as if he were back in the classroom writing on the blackboard or an overhead projector. 


Length: 72 pages 

File Size: 773 KB 
Print Length: 72 pages 
Publication Date: March 12, 2019 
Sold by: Amazon Digital Services LLC 
Language: English 
ASIN: B07PMB69F5 
Text-to-Speech: Enabled  
X-Ray: 
Not Enabled  
 
Word Wise: Not Enabled 
Lending: Enabled 
Screen Reader: Supported  
Enhanced Typesetting: Enabled  



[toc] | [prev] | [standalone]


Page 4 of 4 — ← Prev page 1 2 3 [4]

Back to top | Article view | comp.theory


csiph-web