Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #517407 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-04-10 22:26 -0500 |
| Last post | 2021-04-12 23:49 -0700 |
| Articles | 20 on this page of 70 — 9 participants |
Back to article view | Back to sci.math
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.
Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-10 22:26 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Jeff Barnett <jbb@notatt.com> - 2021-04-10 22:27 -0600
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 00:12 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Jeff Barnett <jbb@notatt.com> - 2021-04-10 23:50 -0600
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 09:29 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Peter <peterxpercival@hotmail.com> - 2021-04-11 16:32 +0100
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 09:08 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 12:06 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 14:34 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Peter <peterxpercival@hotmail.com> - 2021-04-11 20:48 +0100
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <janburse@fastmail.fm> - 2021-04-11 22:00 +0200
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 15:31 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 15:38 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 15:49 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-11 16:09 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 18:57 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 10:10 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 07:03 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-13 00:29 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 01:02 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:46 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-15 00:25 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 14:30 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 17:02 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 19:52 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 06:57 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:29 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 23:45 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-11 19:04 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 01:15 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 09:45 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-12 01:27 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 09:56 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 08:21 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 08:24 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 11:15 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 12:56 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 13:04 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 16:41 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 16:56 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-12 15:22 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-12 22:35 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 06:38 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 18:00 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 18:02 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-13 06:27 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 12:03 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 10:29 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 12:45 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 10:54 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 13:13 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 11:20 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 11:32 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 13:43 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 11:49 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 02:25 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-13 14:30 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-13 15:00 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-14 02:28 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 11:56 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). André G. Isaak <agisaak@gm.invalid> - 2021-04-14 11:05 -0600
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-14 12:09 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Peter <peterxpercival@hotmail.com> - 2021-04-14 18:39 +0100
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-15 00:32 +0000
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). olcott <NoOne@NoWhere.com> - 2021-04-15 10:00 -0500
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Mostowski Collapse <bursejan@gmail.com> - 2021-04-15 08:17 -0700
Re: Simplified Gödel sentence fails Prolog occurs check---> ?- G = not(provable(F, G)). Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-15 15:43 +0000
Pete Olcott, that b.s. spammer of 2 OR 1 = 3 with 2 AND 1 = 1, that failure of logic. Read AP's true Logic-- Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-12 15:12 -0700
Re: Archimedes "irrelevant" Plutonium flunked the math test of a lifetime-generation test Michael Moroney <moroney@world.std.spaamtrap.com> - 2021-04-12 19:51 -0400
What is Godel good for when you cannot even recognize that AND should be TTTF not TFFF, and so Godel was rinky dink Archimedes Plutonium <plutonium.archimedes@gmail.com> - 2021-04-12 23:49 -0700
Page 2 of 4 — ← Prev page 1 [2] 3 4 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-14 11:46 -0500 |
| Message-ID | <EoadnZmMR9rxger9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #517674 |
On 4/13/2021 2:03 AM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2021-04-12, olcott <NoOne@NoWhere.com> wrote:
>> On 4/11/2021 9:11 PM, Kaz Kylheku wrote:
>>> On 2021-04-12, André G Isaak <agisaak@gm.invalid> wrote:
>>>> On 2021-04-11 17:57, olcott wrote:
>>>>> 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'? The definition
>>>
>>> For instance, here is a dubious definition of a binary tree:
>>>
>>> - A binary tree consists of a finite number of nodes.
>>>
>>> - The root node of a binary tree is a node with two children, left and
>>> right, which are also binary trees.
>>>
>>> This definition is incomplete. It has only one constraint rule and one
>>> structural rule. The structural rule makes use of the definition itself,
>>> leading to nothing but infinite regress. That infinite regress could be
>>> acceptable by itself, but it implies an infinite number of nodes, which
>>> contradicts the structural rule.
>>>
>>>> of incompleteness is what it is. You can argue about whether the
>>>> property it describes is interesting or not, but you can't claim that
>>>> the definition is 'erroneous'.
>>>
>>> That simply because it isn't erroneous.
>>
>> If a sentence in neither provable nor disprovable because the sentence
>> is an erroneous infinite term then the formal system is deemed
>
> If a proposition is erroneous because of some issue of syntax, then
> we can regard it as ill-formed and false.
>
Yes. If a proposition is erroneous because of its semantics then we make
sure to ignore this because all formal systems only look at form and
studiously ignore content.
Formal systems are insufficiently expressive to even see sematanic
errors. Semantic errors are totally invisible to these systems.
Automated theorem provers are not free to simply ignore the underlying
semantics.
> You can't casually do that with Gödel's real sentence, though.
>
> Gödel's sentence is fully constructed. It contains no references
> at all, let alone unexpanded self-references.
>
14 Every epistemological antinomy can likewise be used for a similar
undecidability proof. (Gödel 1931:39-41)
Yet because Gödel expressly stated that:
"Every epistemological antinomy can likewise be used for
a similar undecidability proof. (including the Liar Paradox)
Then this equivalence to the Liar Paradox can be examined by examining
the Liar Paradox.
https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence
> That part of it that makes use of itself isn't a reference, but
> a full blown, bit for bit verifiable copy, embedded right there
> "by value" rather than "by reference".
>
This is still the liar paradox:
The next sentence is not true.
The prior sentence is true.
>> incomplete. It is incorrect to call a system incomplete when it is not
>> in any way actually incomplete.
>
> It's incomplete when a perfectly well-formed proposition like
> "The number 123739....439 doesn't belong to set Foo" cannot
> be proven or disproven, when Foo is well defined, and numerous
> integers can easily be tested whether they are in Foo or not
> according to precise rules.
>
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-15 00:25 +0000 |
| Message-ID | <20210414164535.99@kylheku.com> |
| In reply to | #517909 |
["Followup-To:" header set to comp.theory.] On 2021-04-14, olcott <NoOne@NoWhere.com> wrote: > On 4/13/2021 2:03 AM, Kaz Kylheku wrote: >> You can't casually do that with Gödel's real sentence, though. >> >> Gödel's sentence is fully constructed. It contains no references >> at all, let alone unexpanded self-references. >> > > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931:39-41) > > Yet because Gödel expressly stated that: > "Every epistemological antinomy can likewise be used for > a similar undecidability proof. (including the Liar Paradox) > > Then this equivalence to the Liar Paradox can be examined by examining > the Liar Paradox. What equivalence? Gödel's sentence is not even equivalent to "This sentence cannot be proven". That just gives some vague gist of what it is about. So how can it be equivalent to "this sentence is false"? > https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence > >> That part of it that makes use of itself isn't a reference, but >> a full blown, bit for bit verifiable copy, embedded right there >> "by value" rather than "by reference". >> > > This is still the liar paradox: > The next sentence is not true. > The prior sentence is true. You still don't seem understand what I'm referring to about. These sentences are still using a pronoun-like symbolic reference, and suffer from infinite expansion. They are not using Gödel numbering. "The next sentence" is not that sentence itself; it is an arbitrary symbolic reference which must be replaced with the sentence, and that leads to runaway substitution which always leaves us with an unresolved symbolic reference. Suppose you had this sentence though: "72345349[...big number...]201 is the number of a false sentence." That is now fully expanded. There is no reference. If we want to know what sentence is 72345349...201, we take that number and extract the symbols encoded in its very digits. By golly, what if that could be the sentence itself! However, note this: "It is not possible to replace "not provable" with "false" in a Gödel sentence because the predicate "Q is the Gödel number of a false formula" cannot be represented as a formula of arithmetic. This result, known as Tarski's undefinability theorem, was discovered independently both by Gödel, when he was working on the proof of the incompleteness theorem, and by the theorem's namesake, Alfred Tarski. Source: https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems#Relationship_with_the_liar_paradox Basically, the Liar Paradox has a problem (Tarski's undefinability, look it up) that Gödel's sentence does not. -- 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-12 14:30 -0500 |
| Message-ID | <1qGdndeyyIUiAun9nZ2dnUU7-anNnZ2d@giganews.com> |
| In reply to | #517525 |
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.
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.
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}.
It is deceptive to refer to Gödel's 1931 theorem as an incompleteness
theorem. It would be more accurate to call it the:
Can't prove incorrect expressions of language theorem.
> How is anyone supposed to know what you mean by the above? You've
> claimed that the standard definition of 'incompleteness' is 'inherently
> erroneous', and now you talk about a system which is 'not in any way
> incomplete' except that you haven't provided a definition of what *you*
> mean by 'incomplete'. You've made it clear that you reject the standard
> definition, but you haven't indicated what definition you are now using
> in its place.
>
> You also haven't defined what it means for a sentence to be 'erroneous'.
>
> And your prolog examples have nothing to do with Gödel's sentence.
>
> André
>
--
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 17:02 -0500 |
| Message-ID | <trOdndThMrwaXun9nZ2dnUU7-fPNnZ2d@giganews.com> |
| In reply to | #517624 |
On 4/12/2021 3:04 PM, André G. Isaak wrote:
> On 2021-04-12 13:30, olcott 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.
>>
>> 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.
>>
>> This proves that the conventional definition of incompleteness does
>> not show that anything is actually incomplete in any way what-so-ever:
>
> This 'proves' no such thing. You've made an empty assertion. I see
> nothing resembling a proof.
>
> And bear in mind that statements like the above are certainly not the
> only types of sentence which can neither be proven nor disproven in prolog.
>
>> formal system are not required to have the ability to prove or
>> disprove incorrect expressions of their formal language, therefore
>> they are in no
>
> You haven't defined 'incorrect expressions of their formal language'.
>
>> way [incomplete]: {lacking required functionality}.
>
> Incomplete doesn't mean 'lacking required functionality'. And if you are
> determined to redefine it that way, you'd need to establish what
> 'functionality' is required and what is not.
>
>> It is deceptive to refer to Gödel's 1931 theorem as an incompleteness
>> theorem. It would be more accurate to call it the:
>> Can't prove incorrect expressions of language theorem.
>
> What exactly is 'incorrect' about Gödel's sentence? The actual Gödel
> sentence, not your prolog example which bears no resemblence to Gödel's G.
>
> André
>
A sentence of the same form as the Gödel sentence:
?- G = not(provable(F, G)).
proves that its formal system is incomplete even though the reason why
it cannot be proved or disproved in its formal system is that it is
infinitely recursive, thus erroneous.
--
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 19:52 -0500 |
| Message-ID | <Xq-dneL7tJ7Qdun9nZ2dnUU7-R_NnZ2d@giganews.com> |
| In reply to | #517639 |
On 4/12/2021 5:23 PM, Mostowski Collapse wrote:
> propositional logic is also incomplete.
> Take the empty theory {}, then you have:
>
> {} |/- p
>
> {} |/- ~p
>
> Do you claim this is because of the Prolog occurs check?
>
> LoL
>
A sentence of the same form as the Gödel sentence:
?- G = not(provable(F, G)).
proves that its formal system is incomplete even though the reason why
it cannot be proved or disproved in its formal system is that it is
infinitely recursive, thus erroneous.
This proves that the definition of incompleteness that Gödel's
incompleteness theorem is based on is faulty.
> olcott schrieb am Dienstag, 13. April 2021 um 00:02:54 UTC+2:
>> On 4/12/2021 3:04 PM, André G. Isaak wrote:
>>> On 2021-04-12 13:30, olcott 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.
>>>>
>>>> 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.
>>>>
>>>> This proves that the conventional definition of incompleteness does
>>>> not show that anything is actually incomplete in any way what-so-ever:
>>>
>>> This 'proves' no such thing. You've made an empty assertion. I see
>>> nothing resembling a proof.
>>>
>>> And bear in mind that statements like the above are certainly not the
>>> only types of sentence which can neither be proven nor disproven in prolog.
>>>
>>>> formal system are not required to have the ability to prove or
>>>> disprove incorrect expressions of their formal language, therefore
>>>> they are in no
>>>
>>> You haven't defined 'incorrect expressions of their formal language'.
>>>
>>>> way [incomplete]: {lacking required functionality}.
>>>
>>> Incomplete doesn't mean 'lacking required functionality'. And if you are
>>> determined to redefine it that way, you'd need to establish what
>>> 'functionality' is required and what is not.
>>>
>>>> It is deceptive to refer to Gödel's 1931 theorem as an incompleteness
>>>> theorem. It would be more accurate to call it the:
>>>> Can't prove incorrect expressions of language theorem.
>>>
>>> What exactly is 'incorrect' about Gödel's sentence? The actual Gödel
>>> sentence, not your prolog example which bears no resemblence to Gödel's G.
>>>
>>> André
>>>
>>
>> A sentence of the same form as the Gödel sentence:
>> ?- G = not(provable(F, G)).
>> proves that its formal system is incomplete even though the reason why
>> it cannot be proved or disproved in its formal system is that it is
>> infinitely recursive, thus erroneous.
>> --
>> 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:57 +0000 |
| Message-ID | <20210412233949.724@kylheku.com> |
| In reply to | #517624 |
["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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-14 11:29 -0500 |
| Message-ID | <x5GdnTvX1u3mher9nZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #517673 |
On 4/13/2021 1:57 AM, Kaz Kylheku wrote:
> ["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!
>
No that is <not> the case. Diagonalization never gets to that level of
detail. It only shows that G is not provable it never begins to try to
answer why G is not provable.
> 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.
The above Prolog expression does build an infinite evaluation tree, if
an infinite evaluation tree is not build then it is evaluated
incorrectly. This is never done with the Gödel sentence.
If we merely take Gödel at his word:
We are therefore confronted with a proposition which asserts its
own unprovability.15
Then the above Prolog sentence does correctly sum up the essence of his
own sentence.
...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)
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.” (including the
liar paradox)
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.
I added this analysis to this paper:
https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence
> 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.
>
--
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 23:45 +0000 |
| Message-ID | <20210414163425.128@kylheku.com> |
| In reply to | #517906 |
On 2021-04-14, olcott <NoOne@NoWhere.com> wrote: >> 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! >> > > No that is <not> the case. There is no evidence that you know a damn thing about it. > Diagonalization never gets to that level of > detail. It only shows that G is not provable it never begins to try to > answer why G is not provable. Weapons grade Dunning-Kruger.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-11 19:04 -0500 |
| Message-ID | <mMCdnUWjvJLrE-79nZ2dnUU7-IHNnZ2d@giganews.com> |
| In reply to | #517509 |
On 4/11/2021 6:08 PM, Mostowski Collapse wrote: > Gödels Incompletness Theorem doesn't use as ambient logic > Prolog logic programming. Gödels Incompletness Theorem original > Paper uses some Higher Order Logic. > If we can duplicate his results by meeting the definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) on the basis of a term that is not provable because it represents: "some kind of infinite structure" then we have proven that the definition of Incompleteness has a fatal flaw. This removes the key basis of the 1931 Incompleteness theorem: the definition of Incompleteness. > You cannot just go on and use some umbral reasoning and compare > apples with oranges. Prolog with Negation of Failure (NAF) has non- > unification. Whereby the meaning is as follows: > > ?- s = t means |- ∃(s = t) ? > ?- \+ s = t means |- ∀(s ≠ t) ? > ?- dif(s, t) means |- ∃(s ≠ t) ? > > Harrop with Negation as Inconsistency (NAI) has also non-unification, > but it could be that there is more control of quantifiers, have to check. > In the past Kunen once even published quantifier elimination for > > Clark Equational Theory (CET). > > Mostowski Collapse schrieb am Montag, 12. April 2021 um 00:49:36 UTC+2: >> 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. It basically says s≠t vesus CET. But >> there are also some quantifiers involved, >> >> I am only mentioning the most basic fact about unification >> you seem not to know. >> >> See also: >> establish not only unifiability but also non-unifiability of terms >> https://link.springer.com/chapter/10.1007/3-540-63045-7_21 >> Mostowski Collapse schrieb am Montag, 12. April 2021 um 00:39:02 UTC+2: >>> Its not an undecidable sentence you moron. (=)/2 is >>> decidable in Prolog. Just try this you moron: >>> >>> ?- set_prolog_flag(occurs_check, true). >>> >>> ?- dif(G, not(provable(F, not(G)))). >>> true >>> olcott schrieb am Sonntag, 11. April 2021 um 22:31:26 UTC+2: >>>> On 4/11/2021 2:54 PM, Mostowski Collapse wrote: >>>>> I guess you are highly confused and never understood Prolog >>>>> when you write the following: >>>>> >>>>>> and its negation also fails >>>>>> ?- unify_with_occurs_check(G, not(provable(F, not(G)))). >>>>>> false. >>>>> >>>>> not(provable(F, not(G))) is just a syntax term tree: >>>>> >>>>> not >>>>> | >>>>> provable >>>>> / \ >>>>> F not >>>>> | >>>>> G >>>>> >>>>> What fails is not the negation. No negation is semantically >>>>> taken of anything. All that fails is syntactic unification, >>>>> >>>>> the only predication that was invoked was unify_with_occurs_check/2. >>>>> No predication not/1 or provable/2 was invoked. >>>>> >>>>> The unification fails, because the result of binding G to >>>>> the syntax term tree not(provable(F, not(G))) would result >>>>> >>>>> in a loop, and the syntax term would not anymore be a tree: >>>>> >>>>> v--------+ >>>>> not | >>>>> | | >>>>> provable | >>>>> / \ | >>>>> F not | >>>>> | | >>>>> G | >>>>> +-----+ >>>>> >>>> >>>> Yes very good you understand it completely. I show this same thing on >>>> page (3) of my paper. >>>> >>>> https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence >>>> >>>> >>>> It cannot even be evaluated for provability because it has a cycle in >>>> its syntactic specification. >>>> ?- G = not(provable(F, G)). >>>> Since it cannot even be evaluated for provability because of this cycle >>>> we can know that it is it neither provable nor disprovable because the >>>> process of provability or disprovability cannot even begin. >>>> >>>> Since the expression can neither be proven nor disproven it exactly >>>> meets the conventional definition of Incompleteness: >>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) >>>> This proves that the conventional definition of incompleteness decides >>>> that a formal system is incomplete on the basis that this formal system >>>> cannot prove erroneous expressions of a formal language. >>>> >>>> The 1931 Gödel Incompleteness theorem proving that formal systems of >>>> arithmetic are incomplete is anchored faulty definition of >>>> "incompleteness". >>>>> olcott schrieb am Sonntag, 11. April 2021 um 21:34:25 UTC+2: >>>>>> On 4/11/2021 11:08 AM, Mostowski Collapse wrote: >>>>>>> Olcott misused Prolog. The outcome of LP = not(true(LP)) >>>>>>> depends on the occurs check flag. >>>>>>> >>>>>>> /* SWI-Prolog 8.3.21 */ >>>>>>> ?- set_prolog_flag(occurs_check, false). >>>>>>> true. >>>>>>> >>>>>>> ?- LP = not(true(LP)). >>>>>>> LP = not(true(LP)). >>>>>>> >>>>>>> ?- set_prolog_flag(occurs_check, true). >>>>>>> true. >>>>>>> >>>>>>> ?- LP = not(true(LP)). >>>>>>> false. >>>>>>> >>>>>>> But indeed nothing to do with Gödel, since (=)/2 in Prolog >>>>>>> is so called syntactic equality. >>>>>>> >>>>>> >>>>>> Setting the unification default has nothing to do with the assessment of >>>>>> whether a Prolog expression is or is not cyclic. >>>>>> https://www.swi-prolog.org/pldoc/man?section=flags#flag:occurs_check >>>>>> >>>>>> These three Prolog expressions being tested are not provable BECAUSE >>>>>> THEY ARE CYCLIC thus Erroneous: >>>>>> >>>>>> ?- unify_with_occurs_check(LP, not(true(LP))). >>>>>> false. >>>>>> ?- unify_with_occurs_check(G, not(provable(F, G))). >>>>>> false. >>>>>> >>>>>> and its negation also fails >>>>>> ?- unify_with_occurs_check(G, not(provable(F, not(G)))). >>>>>> false. >>>>>> Since the latter pair meet the definition of Incompleteness: >>>>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) >>>>>> That proves that they are logically equivalent to the Gödel sentence. >>>>>> >>>>>> In this case instead of merely knowing that the sentence and its >>>>>> negation are unprovable we also know WHY THE SENTENCE AND ITS NEGATION >>>>>> ARE UNPROVABLE, THE SENTENCE AND ITS NEGATION ARE ERRONEOUS. -- 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-12 01:15 -0700 |
| Message-ID | <343db2c2-4577-4e65-8139-89c0ce57ff11n@googlegroups.com> |
| In reply to | #517526 |
Prolog has no ¬φ. Its based on Horn clauses which do not have ¬φ. So your attempt is pretty useless, how is your not/1 defined? olcott schrieb am Montag, 12. April 2021 um 02:04:20 UTC+2: > On 4/11/2021 6:08 PM, Mostowski Collapse wrote: > > Gödels Incompletness Theorem doesn't use as ambient logic > > Prolog logic programming. Gödels Incompletness Theorem original > > Paper uses some Higher Order Logic. > > > If we can duplicate his results by meeting the definition of > incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) > on the basis of a term that is not provable because it represents: "some > kind of infinite structure" then we have proven that the definition of > Incompleteness has a fatal flaw. > > This removes the key basis of the 1931 Incompleteness theorem: the > definition of Incompleteness. > > You cannot just go on and use some umbral reasoning and compare > > apples with oranges. Prolog with Negation of Failure (NAF) has non- > > unification. Whereby the meaning is as follows: > > > > ?- s = t means |- ∃(s = t) ? > > ?- \+ s = t means |- ∀(s ≠ t) ? > > ?- dif(s, t) means |- ∃(s ≠ t) ? > > > > Harrop with Negation as Inconsistency (NAI) has also non-unification, > > but it could be that there is more control of quantifiers, have to check. > > In the past Kunen once even published quantifier elimination for > > > > Clark Equational Theory (CET). > > > > Mostowski Collapse schrieb am Montag, 12. April 2021 um 00:49:36 UTC+2: > >> 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. It basically says s≠t vesus CET. But > >> there are also some quantifiers involved, > >> > >> I am only mentioning the most basic fact about unification > >> you seem not to know. > >> > >> See also: > >> establish not only unifiability but also non-unifiability of terms > >> https://link.springer.com/chapter/10.1007/3-540-63045-7_21 > >> Mostowski Collapse schrieb am Montag, 12. April 2021 um 00:39:02 UTC+2: > >>> Its not an undecidable sentence you moron. (=)/2 is > >>> decidable in Prolog. Just try this you moron: > >>> > >>> ?- set_prolog_flag(occurs_check, true). > >>> > >>> ?- dif(G, not(provable(F, not(G)))). > >>> true > >>> olcott schrieb am Sonntag, 11. April 2021 um 22:31:26 UTC+2: > >>>> On 4/11/2021 2:54 PM, Mostowski Collapse wrote: > >>>>> I guess you are highly confused and never understood Prolog > >>>>> when you write the following: > >>>>> > >>>>>> and its negation also fails > >>>>>> ?- unify_with_occurs_check(G, not(provable(F, not(G)))). > >>>>>> false. > >>>>> > >>>>> not(provable(F, not(G))) is just a syntax term tree: > >>>>> > >>>>> not > >>>>> | > >>>>> provable > >>>>> / \ > >>>>> F not > >>>>> | > >>>>> G > >>>>> > >>>>> What fails is not the negation. No negation is semantically > >>>>> taken of anything. All that fails is syntactic unification, > >>>>> > >>>>> the only predication that was invoked was unify_with_occurs_check/2. > >>>>> No predication not/1 or provable/2 was invoked. > >>>>> > >>>>> The unification fails, because the result of binding G to > >>>>> the syntax term tree not(provable(F, not(G))) would result > >>>>> > >>>>> in a loop, and the syntax term would not anymore be a tree: > >>>>> > >>>>> v--------+ > >>>>> not | > >>>>> | | > >>>>> provable | > >>>>> / \ | > >>>>> F not | > >>>>> | | > >>>>> G | > >>>>> +-----+ > >>>>> > >>>> > >>>> Yes very good you understand it completely. I show this same thing on > >>>> page (3) of my paper. > >>>> > >>>> https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence > >>>> > >>>> > >>>> It cannot even be evaluated for provability because it has a cycle in > >>>> its syntactic specification. > >>>> ?- G = not(provable(F, G)). > >>>> Since it cannot even be evaluated for provability because of this cycle > >>>> we can know that it is it neither provable nor disprovable because the > >>>> process of provability or disprovability cannot even begin. > >>>> > >>>> Since the expression can neither be proven nor disproven it exactly > >>>> meets the conventional definition of Incompleteness: > >>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) > >>>> This proves that the conventional definition of incompleteness decides > >>>> that a formal system is incomplete on the basis that this formal system > >>>> cannot prove erroneous expressions of a formal language. > >>>> > >>>> The 1931 Gödel Incompleteness theorem proving that formal systems of > >>>> arithmetic are incomplete is anchored faulty definition of > >>>> "incompleteness". > >>>>> olcott schrieb am Sonntag, 11. April 2021 um 21:34:25 UTC+2: > >>>>>> On 4/11/2021 11:08 AM, Mostowski Collapse wrote: > >>>>>>> Olcott misused Prolog. The outcome of LP = not(true(LP)) > >>>>>>> depends on the occurs check flag. > >>>>>>> > >>>>>>> /* SWI-Prolog 8.3.21 */ > >>>>>>> ?- set_prolog_flag(occurs_check, false). > >>>>>>> true. > >>>>>>> > >>>>>>> ?- LP = not(true(LP)). > >>>>>>> LP = not(true(LP)). > >>>>>>> > >>>>>>> ?- set_prolog_flag(occurs_check, true). > >>>>>>> true. > >>>>>>> > >>>>>>> ?- LP = not(true(LP)). > >>>>>>> false. > >>>>>>> > >>>>>>> But indeed nothing to do with Gödel, since (=)/2 in Prolog > >>>>>>> is so called syntactic equality. > >>>>>>> > >>>>>> > >>>>>> Setting the unification default has nothing to do with the assessment of > >>>>>> whether a Prolog expression is or is not cyclic. > >>>>>> https://www.swi-prolog.org/pldoc/man?section=flags#flag:occurs_check > >>>>>> > >>>>>> These three Prolog expressions being tested are not provable BECAUSE > >>>>>> THEY ARE CYCLIC thus Erroneous: > >>>>>> > >>>>>> ?- unify_with_occurs_check(LP, not(true(LP))). > >>>>>> false. > >>>>>> ?- unify_with_occurs_check(G, not(provable(F, G))). > >>>>>> false. > >>>>>> > >>>>>> and its negation also fails > >>>>>> ?- unify_with_occurs_check(G, not(provable(F, not(G)))). > >>>>>> false. > >>>>>> Since the latter pair meet the definition of Incompleteness: > >>>>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) > >>>>>> That proves that they are logically equivalent to the Gödel sentence. > >>>>>> > >>>>>> In this case instead of merely knowing that the sentence and its > >>>>>> negation are unprovable we also know WHY THE SENTENCE AND ITS NEGATION > >>>>>> ARE UNPROVABLE, THE SENTENCE AND ITS NEGATION ARE ERRONEOUS. > -- > 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 09:45 -0500 |
| Message-ID | <QPOdna-88P6WwOn9nZ2dnUU7-VHNnZ2d@giganews.com> |
| In reply to | #517526 |
On 4/12/2021 3:16 AM, Mostowski Collapse wrote: > Prolog has no ¬φ. Its based on Horn clauses which do not have ¬φ. > So your attempt is pretty useless, how is your not/1 defined? > You are saying the Prolog defines negation as failure and this is not the way that symbolic logic defines negation. That should not make any difference. This is actually better than the way that symbolic logic does it. Symbolic logic takes not true as false. Prolog takes not true as false or erroneous. > olcott schrieb am Montag, 12. April 2021 um 02:04:13 UTC+2: >> On 4/11/2021 6:08 PM, Mostowski Collapse wrote: >>> Gödels Incompletness Theorem doesn't use as ambient logic >>> Prolog logic programming. Gödels Incompletness Theorem original >>> Paper uses some Higher Order Logic. >>> >> If we can duplicate his results by meeting the definition of >> incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) >> >> on the basis of a term that is not provable because it represents: "some >> kind of infinite structure" then we have proven that the definition of >> Incompleteness has a fatal flaw. >> >> This removes the key basis of the 1931 Incompleteness theorem: the >> definition of Incompleteness. >>> You cannot just go on and use some umbral reasoning and compare >>> apples with oranges. Prolog with Negation of Failure (NAF) has non- >>> unification. Whereby the meaning is as follows: >>> >>> ?- s = t means |- ∃(s = t) ? >>> ?- \+ s = t means |- ∀(s ≠ t) ? >>> ?- dif(s, t) means |- ∃(s ≠ t) ? >>> >>> Harrop with Negation as Inconsistency (NAI) has also non-unification, >>> but it could be that there is more control of quantifiers, have to check. >>> In the past Kunen once even published quantifier elimination for >>> >>> Clark Equational Theory (CET). >>> >>> Mostowski Collapse schrieb am Montag, 12. April 2021 um 00:49:36 UTC+2: >>>> 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. It basically says s≠t vesus CET. But >>>> there are also some quantifiers involved, >>>> >>>> I am only mentioning the most basic fact about unification >>>> you seem not to know. >>>> >>>> See also: >>>> establish not only unifiability but also non-unifiability of terms >>>> https://link.springer.com/chapter/10.1007/3-540-63045-7_21 >>>> Mostowski Collapse schrieb am Montag, 12. April 2021 um 00:39:02 UTC+2: >>>>> Its not an undecidable sentence you moron. (=)/2 is >>>>> decidable in Prolog. Just try this you moron: >>>>> >>>>> ?- set_prolog_flag(occurs_check, true). >>>>> >>>>> ?- dif(G, not(provable(F, not(G)))). >>>>> true >>>>> olcott schrieb am Sonntag, 11. April 2021 um 22:31:26 UTC+2: >>>>>> On 4/11/2021 2:54 PM, Mostowski Collapse wrote: >>>>>>> I guess you are highly confused and never understood Prolog >>>>>>> when you write the following: >>>>>>> >>>>>>>> and its negation also fails >>>>>>>> ?- unify_with_occurs_check(G, not(provable(F, not(G)))). >>>>>>>> false. >>>>>>> >>>>>>> not(provable(F, not(G))) is just a syntax term tree: >>>>>>> >>>>>>> not >>>>>>> | >>>>>>> provable >>>>>>> / \ >>>>>>> F not >>>>>>> | >>>>>>> G >>>>>>> >>>>>>> What fails is not the negation. No negation is semantically >>>>>>> taken of anything. All that fails is syntactic unification, >>>>>>> >>>>>>> the only predication that was invoked was unify_with_occurs_check/2. >>>>>>> No predication not/1 or provable/2 was invoked. >>>>>>> >>>>>>> The unification fails, because the result of binding G to >>>>>>> the syntax term tree not(provable(F, not(G))) would result >>>>>>> >>>>>>> in a loop, and the syntax term would not anymore be a tree: >>>>>>> >>>>>>> v--------+ >>>>>>> not | >>>>>>> | | >>>>>>> provable | >>>>>>> / \ | >>>>>>> F not | >>>>>>> | | >>>>>>> G | >>>>>>> +-----+ >>>>>>> >>>>>> >>>>>> Yes very good you understand it completely. I show this same thing on >>>>>> page (3) of my paper. >>>>>> >>>>>> https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence >>>>>> >>>>>> >>>>>> It cannot even be evaluated for provability because it has a cycle in >>>>>> its syntactic specification. >>>>>> ?- G = not(provable(F, G)). >>>>>> Since it cannot even be evaluated for provability because of this cycle >>>>>> we can know that it is it neither provable nor disprovable because the >>>>>> process of provability or disprovability cannot even begin. >>>>>> >>>>>> Since the expression can neither be proven nor disproven it exactly >>>>>> meets the conventional definition of Incompleteness: >>>>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) >>>>>> This proves that the conventional definition of incompleteness decides >>>>>> that a formal system is incomplete on the basis that this formal system >>>>>> cannot prove erroneous expressions of a formal language. >>>>>> >>>>>> The 1931 Gödel Incompleteness theorem proving that formal systems of >>>>>> arithmetic are incomplete is anchored faulty definition of >>>>>> "incompleteness". >>>>>>> olcott schrieb am Sonntag, 11. April 2021 um 21:34:25 UTC+2: >>>>>>>> On 4/11/2021 11:08 AM, Mostowski Collapse wrote: >>>>>>>>> Olcott misused Prolog. The outcome of LP = not(true(LP)) >>>>>>>>> depends on the occurs check flag. >>>>>>>>> >>>>>>>>> /* SWI-Prolog 8.3.21 */ >>>>>>>>> ?- set_prolog_flag(occurs_check, false). >>>>>>>>> true. >>>>>>>>> >>>>>>>>> ?- LP = not(true(LP)). >>>>>>>>> LP = not(true(LP)). >>>>>>>>> >>>>>>>>> ?- set_prolog_flag(occurs_check, true). >>>>>>>>> true. >>>>>>>>> >>>>>>>>> ?- LP = not(true(LP)). >>>>>>>>> false. >>>>>>>>> >>>>>>>>> But indeed nothing to do with Gödel, since (=)/2 in Prolog >>>>>>>>> is so called syntactic equality. >>>>>>>>> >>>>>>>> >>>>>>>> Setting the unification default has nothing to do with the assessment of >>>>>>>> whether a Prolog expression is or is not cyclic. >>>>>>>> https://www.swi-prolog.org/pldoc/man?section=flags#flag:occurs_check >>>>>>>> >>>>>>>> These three Prolog expressions being tested are not provable BECAUSE >>>>>>>> THEY ARE CYCLIC thus Erroneous: >>>>>>>> >>>>>>>> ?- unify_with_occurs_check(LP, not(true(LP))). >>>>>>>> false. >>>>>>>> ?- unify_with_occurs_check(G, not(provable(F, G))). >>>>>>>> false. >>>>>>>> >>>>>>>> and its negation also fails >>>>>>>> ?- unify_with_occurs_check(G, not(provable(F, not(G)))). >>>>>>>> false. >>>>>>>> Since the latter pair meet the definition of Incompleteness: >>>>>>>> Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) >>>>>>>> That proves that they are logically equivalent to the Gödel sentence. >>>>>>>> >>>>>>>> In this case instead of merely knowing that the sentence and its >>>>>>>> negation are unprovable we also know WHY THE SENTENCE AND ITS NEGATION >>>>>>>> ARE UNPROVABLE, THE SENTENCE AND ITS NEGATION ARE ERRONEOUS. >> -- >> 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-12 01:27 +0000 |
| Message-ID | <20210411181931.763@kylheku.com> |
| In reply to | #517407 |
On 2021-04-11, olcott <NoOne@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. 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. (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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 09:56 -0500 |
| Message-ID | <R7mdnQHxYuMEwun9nZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #517534 |
On 4/11/2021 8:27 PM, Kaz Kylheku wrote: > On 2021-04-11, olcott <NoOne@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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-12 08:21 -0700 |
| Message-ID | <cec76b80-b00e-4eb5-a5d4-e52718e1ebd2n@googlegroups.com> |
| In reply to | #517590 |
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. > > The point is that my extremely simplified sentence meets the > conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ > (T ⊬ ¬φ)) Nope, since (=)/2 isn'^t biconditional. olcott schrieb am Montag, 12. April 2021 um 16:56:40 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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-12 08:24 -0700 |
| Message-ID | <fc0f5af0-fd47-4336-866b-6e78c7d524d7n@googlegroups.com> |
| In reply to | #517597 |
The only two things that meet here is olcott stupidity and the big void. Mostowski Collapse schrieb am Montag, 12. April 2021 um 17:22:05 UTC+2: > 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. > > > The point is that my extremely simplified sentence meets the > > conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ > > (T ⊬ ¬φ)) > Nope, since (=)/2 isn'^t biconditional. > olcott schrieb am Montag, 12. April 2021 um 16:56:40 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
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 11:15 -0500 |
| Message-ID | <RdydnRtgR9ue7-n9nZ2dnUU7-YGdnZ2d@giganews.com> |
| In reply to | #517590 |
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 | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-12 12:56 -0700 |
| Message-ID | <b87c6175-0022-42a8-b799-b01564f40506n@googlegroups.com> |
| In reply to | #517601 |
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
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:15:13 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
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-12 13:04 -0700 |
| Message-ID | <02442860-a548-442e-a926-e3f7bd940139n@googlegroups.com> |
| In reply to | #517631 |
As long as you don't know what equality Gödel uses, and as long as you cannot show versus Gödels equality that x =\= f(x) or x =\= f(x,y) for a certain f, its pretty useless to think Prolog has something to do with Gödels incompletness theorem. Thats like saying babies are brought by the stork, because you see storks coming when babies come. Statistics, Storks, and Babies https://www.youtube.com/watch?v=-n-d1ApBTFw For example Gödel uses natural numbers. For natural numbers there are many functions f intensionally with x=f(x) or x=f(x,y), maybe there are fewer such functions extensionally, but natural numbers do not obey x =\= f(x) or x =\= f(x,y), thats only the case for certain free structures, like the syntactic terms that unification deals with. Mostowski Collapse schrieb am Montag, 12. April 2021 um 21:56:43 UTC+2: > 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 > > 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:15:13 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
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-12 16:41 -0500 |
| Message-ID | <UPGdndbRYoQCI-n9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #517590 |
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 16:56 -0500 |
| Message-ID | <lr2dnSIFatu9X-n9nZ2dnUU7-QfNnZ2d@giganews.com> |
| In reply to | #517590 |
On 4/12/2021 3:04 PM, Mostowski Collapse wrote: > As long as you don't know what equality Gödel uses, > and as long as you cannot show versus Gödels equality > that x =\= f(x) or x =\= f(x,y) for a certain f, its pretty useless to > > think Prolog has something to do with Gödels incompletness > theorem. Thats like saying babies are brought by the stork, > because you see storks coming when babies come. > I am only referring to Gödel's work indirectly through the definition of Incompleteness that it is based on: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)) As long as we have an expression φ of any formal language of any formal system T such that this expression is neither provable nor disprovable in this formal system then this formal system is deemed to be incomplete even if the reason that the expression is neither provable nor disprovable is that it is erroneous. All of the formal proofs of symbolic logic studiously ignore the fact that some expressions of a formal language can possibly be erroneous, the presumption is that this is utterly impossible. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 2 of 4 — ← Prev page 1 [2] 3 4 Next page →
Back to top | Article view | sci.math
csiph-web