Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Newsgroups | comp.theory, comp.ai.philosophy, comp.lang.prolog, sci.math |
| Subject | Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). |
| Followup-To | comp.theory |
| Date | 2021-04-13 06:57 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <20210412233949.724@kylheku.com> (permalink) |
| References | (13 earlier) <icydnYq2X7JSEe79nZ2dnUU7-UPNnZ2d@giganews.com> <s507q6$5r3$1@dont-email.me> <fYqdndiLZMF7_On9nZ2dnUU7-XnNnZ2d@giganews.com> <s524or$eqk$1@dont-email.me> <1qGdndeyyIUiAun9nZ2dnUU7-anNnZ2d@giganews.com> |
Cross-posted to 4 groups.
Followups directed to: comp.theory
["Followup-To:" header set to comp.theory.]
On 2021-04-12, olcott <NoOne@NoWhere.com> wrote:
> On 4/12/2021 1:50 PM, André G. Isaak wrote:
>> On 2021-04-12 09:06, olcott wrote:
>>> On 4/11/2021 8:29 PM, André G. Isaak wrote:
>>>> On 2021-04-11 17:57, olcott wrote:
>>>>> On 4/11/2021 5:49 PM, Mostowski Collapse wrote:
>>>>>> The unification algorithm is not a provability relation,
>>>>>> that only decides whether s=t holds. It can also decide
>>>>>> s≠t, versus so called Clark Equational Theory (CET),
>>>>>>
>>>>>> which has these two axioms added to FOL with Equality:
>>>>>>
>>>>>> f(x1,..,xn)≠g(y1,..,ym) for f≠g or n≠m
>>>>>> x≠g(y1,..,yj,..,ym) for x e yj
>>>>>>
>>>>>> So when unification fails, it says a little more than s=t
>>>>>> could not be proved.
>>>>>
>>>>> I am not denigrating Prolog. I am applauding Prolog for its ability
>>>>> to detect the key error in Gödel's 1931 Incompleteness theorem.
>>>>>
>>>>> Page (2) of my paper quotes page 254 of Clocksin and Mellish:
>>>>> https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence
>>>>>
>>>>>
>>>>> The key thing more that it does say is WHY s=t could not be proved.
>>>>>
>>>>> ?- equal(foo(Y), Y).
>>>>> Y ends up standing for some kind of infinite structure.
>>>>>
>>>>> The definition of incompleteness:
>>>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ))
>>>>>
>>>>> Doesn't give a rats ass WHY it couldn't be proved (that is its big
>>>>> mistake), it only cares THAT it couldn't be proved.
>>>>>
>>>>> So if s=t cannot be proved and s=not(t) cannot be proved then the
>>>>> inherently erroneous definition of incompleteness that Gödel's 1931
>>>>
>>>> How on earth can a definition be 'inherently erroneous'?
>>>
>>> If a sentence in neither provable nor disprovable because the sentence
>>> is erroneous then the formal system is deemed incomplete. It is
>>> incorrect to call a system incomplete when it is not in any way
>>> incomplete.
>>
>
> ?- G = not(provable(F, G)).
> Is not provable or disprovable because it specifies an infinitely
> recursive expression.
Gödel's sentence isn't infinitely recursive in a way that
requires a non-terminating expansion. It's already fully
expanded; it's a constructed thing, done and dusted!
It's possible to make a deliberately infinitely recursive traversal of
it, similar to zooming into a fractal; but that is not necessary for
evaluating it. This is because the number G that the sentence contains
is found to itself contain that entire sentence. Which means that
another copy of G is found in there. And that's the same G which
decodes to that entire sentence again, containing another copy of G, ...
It's like the Droste effect. Except the picture-in-picture isn't
getting any smaller: it's not losing any resolution.
We can terminate our recursive traversal as soon as we recognize that
the number G embedded in the sentence decodes to a string of symbols
which is identical to the sentence.
Since he traversal terminates, it is not infinitely recursive.
> Because it is not provable or disprovable in its formal system it meets
> the conventional definition of incompleteness used in Gödel's 1931
> incompleteness theorem.
Amazing; Gödel's sentence meets Gödel's incompleteness definition.
That tiny squeak I heard; was that something giving way, allowing small
intellectual progress?
Shall I call a doctor/shrink? This could be life-threatening.
> This proves that the conventional definition of incompleteness does not
> show that anything is actually incomplete in any way what-so-ever:
>
> formal system are not required to have the ability to prove or disprove
> incorrect expressions of their formal language, therefore they are in no
> way [incomplete]: {lacking required functionality}.
"Incorrect expression" means "false expression", which means disproven.
By what system do you arrive at that conclusion, if that original
system is not required to, and does not, disprove?
This is some sort of about-face for you; you have hitherto insisted that
if a proposition cannot be proven true, it is false. (And that is the
reason there is no incompleteness.) In other words, all truths are
provable; all else is false.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-10 22:26 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Jeff Barnett <jbb@notatt.com> - 2021-04-10 22:27 -0600
Re: Simplified G"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
csiph-web