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 | 10 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 4 of 4 — ← Prev page 1 2 3 [4]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-14 11:05 -0600 |
| Message-ID | <s577ck$bd3$1@dont-email.me> |
| In reply to | #517910 |
On 2021-04-14 10:56, olcott wrote: > On 4/13/2021 9:30 PM, Kaz Kylheku wrote: >> On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: >>> On 4/13/2021 3:02 PM, André G. Isaak wrote: >>>> But Gödel’s actual sentence doesn't assign any sort of value to >>>> anything. There is no assignment operator in FOL, nor is there such a >>>> thing as an uninitialized variable. >>>> >>> >>> It all boils down to this case: >>> "This sentence cannot be proven." >>> because it is vacuous. >> >> It seems to boils down that because you're too stupid (and, more >> importantly, willfully ignorant) to learn about the real thing and what >> it actually says. >> > > ...there is also a close relationship with the “liar” antinomy,14 ... > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. > There is also a close relationship between the Theory of Special Relativity and Maxwell’s Equations. That doesn't mean they are the same thing, nor that one is an accurate translation of the other. So what is the close relationship which Gödel refers to? You assume it is one of identity, but it is not (if it were, Gödel would have used the term 'equivalence' rather than 'close relationship'). If you want to learn what the actual relationship he refers to is, you need to read the damn math! André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-14 12:09 -0500 |
| Message-ID | <kqadnawYjpQjvOr9nZ2dnUU7-SOdnZ2d@giganews.com> |
| In reply to | #517913 |
On 4/14/2021 12:05 PM, André G. Isaak wrote: > On 2021-04-14 10:56, olcott wrote: >> On 4/13/2021 9:30 PM, Kaz Kylheku wrote: >>> On 2021-04-13, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/13/2021 3:02 PM, André G. Isaak wrote: >>>>> But Gödel’s actual sentence doesn't assign any sort of value to >>>>> anything. There is no assignment operator in FOL, nor is there such a >>>>> thing as an uninitialized variable. >>>>> >>>> >>>> It all boils down to this case: >>>> "This sentence cannot be proven." >>>> because it is vacuous. >>> >>> It seems to boils down that because you're too stupid (and, more >>> importantly, willfully ignorant) to learn about the real thing and what >>> it actually says. >>> >> >> ...there is also a close relationship with the “liar” antinomy,14 ... >> 14 Every epistemological antinomy can likewise be used for a similar >> undecidability proof. >> > > There is also a close relationship between the Theory of Special > Relativity and Maxwell’s Equations. That doesn't mean they are the same > thing, nor that one is an accurate translation of the other. So what is > the close relationship which Gödel refers to? You assume it is one of > identity, but it is not (if it were, Gödel would have used the term > 'equivalence' rather than 'close relationship'). If you want to learn > what the actual relationship he refers to is, you need to read the damn > math! > > André > 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. The liar paradox <is> and epistemological antinomy therefore the liar paradox can likewise be used for a similar undecidability proof. You must be dumber than a box of rocks. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Peter <peterxpercival@hotmail.com> |
|---|---|
| Date | 2021-04-14 18:39 +0100 |
| Message-ID | <s579d2$189i$1@gioia.aioe.org> |
| In reply to | #517915 |
olcott wrote: > [...] > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. > > The liar paradox <is> and epistemological antinomy therefore the liar > paradox can likewise be used for a similar undecidability proof. > > You must be dumber than a box of rocks. I challenge you to prove the incompleteness theorem using the liar. Note that "n is the Gödel number of a false sentence" isn't arithmetical. -- Just as 'beautiful' points the way for aesthetics and 'good' for ethics, so do words like 'true' for logic. All sciences have truth as their goal; but logic is also concerned with it in a quite different way: logic has much the same relation to truth as physics has to weight or heat. Frege in 'Thoughts' (Der Gedanke)
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-15 00:32 +0000 |
| Message-ID | <20210414172903.469@kylheku.com> |
| In reply to | #517915 |
["Followup-To:" header set to comp.theory.] On 2021-04-14, olcott <NoOne@NoWhere.com> wrote: > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. Except the liar-paradox and its ilk; those fall victim to Tarski's undefinabiity, independently discovered by Gödel. "Every epistemological antinomy can likewise be used for a similar undecidability proof." really means every *eligible* one. That rules out ones which try to model a system's semantic truth within that system. Gödel's sentence models only a mechanical truth: derivation from axioms. I.e. the notion of "provable", not "true". In any axiomatic system where you can represent formulas arithmetically, you can set up an undecidability proof in relation to deriving from axioms. Or something like that.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-15 10:00 -0500 |
| Message-ID | <PL2dndJe_c2PyOX9nZ2dnUU7-dGdnZ2d@giganews.com> |
| In reply to | #517982 |
On 4/14/2021 7:32 PM, Kaz Kylheku wrote: > ["Followup-To:" header set to comp.theory.] > On 2021-04-14, olcott <NoOne@NoWhere.com> wrote: >> 14 Every epistemological antinomy can likewise be used for a similar >> undecidability proof. > > Except the liar-paradox and its ilk; those fall victim to Tarski's > undefinabiity, independently discovered by Gödel. > > "Every epistemological antinomy can likewise be used for a similar > undecidability proof." really means every *eligible* one. > > That rules out ones which try to model a system's semantic truth within > that system. > > Gödel's sentence models only a mechanical truth: derivation from axioms. > I.e. the notion of "provable", not "true". > > In any axiomatic system where you can represent formulas arithmetically, > you can set up an undecidability proof in relation to deriving from > axioms. Or something like that. > 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) 14 Every epistemological antinomy can likewise be used for a similar undecidability proof. (Gödel 1931:39-41) In Prolog these two sentences are equivalent: G = not(provable(F, G)). LP = not(true(LP)). Because the Prolog Liar Paradox has an “uninstantiated subterm of itself” we can know that unification will fail because it specifies “some kind of infinite structure.” The quotes come from: (Clocksin and Mellish 2003:255) If we simply take Gödel at his word: “Every epistemological antinomy can likewise be used for a similar undecidability proof.” then the Liar Paradox is equivalent to his own undecidable sentence. Godel, Kurt 1931. On Formally Undecidable Propositions of Principia Mathematica And Related Systems I, page 39-41. Prolog detects pathological self reference in the Gödel sentence April 2021 PL Olcott https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mostowski Collapse <bursejan@gmail.com> |
|---|---|
| Date | 2021-04-15 08:17 -0700 |
| Message-ID | <c6f70614-db84-4833-b552-7d2a7b8df29fn@googlegroups.com> |
| In reply to | #518028 |
No it doesn't. olcott schrieb am Donnerstag, 15. April 2021 um 17:00:49 UTC+2: > On 4/14/2021 7:32 PM, Kaz Kylheku wrote: > > ["Followup-To:" header set to comp.theory.] > > On 2021-04-14, olcott <No...@NoWhere.com> wrote: > >> 14 Every epistemological antinomy can likewise be used for a similar > >> undecidability proof. > > > > Except the liar-paradox and its ilk; those fall victim to Tarski's > > undefinabiity, independently discovered by Gödel. > > > > "Every epistemological antinomy can likewise be used for a similar > > undecidability proof." really means every *eligible* one. > > > > That rules out ones which try to model a system's semantic truth within > > that system. > > > > Gödel's sentence models only a mechanical truth: derivation from axioms. > > I.e. the notion of "provable", not "true". > > > > In any axiomatic system where you can represent formulas arithmetically, > > you can set up an undecidability proof in relation to deriving from > > axioms. Or something like that. > > > > > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931:39-41) > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931:39-41) > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931:39-41) > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931:39-41) > 14 Every epistemological antinomy can likewise be used for a similar > undecidability proof. (Gödel 1931:39-41) > > In Prolog these two sentences are equivalent: > > G = not(provable(F, G)). > LP = not(true(LP)). > Because the Prolog Liar Paradox has an > “uninstantiated subterm of itself” > we can know that unification will fail because it specifies > “some kind of infinite structure.” > > The quotes come from: (Clocksin and Mellish 2003:255) If we simply take > Gödel at his word: “Every epistemological antinomy can likewise be used > for a similar undecidability proof.” then the Liar Paradox is equivalent > to his own undecidable sentence. > Godel, Kurt 1931. On Formally Undecidable Propositions of Principia > Mathematica And Related Systems I, page 39-41. > Prolog detects pathological self reference in the Gödel sentence > April 2021 PL Olcott > > https://www.researchgate.net/publication/350789898_Prolog_detects_pathological_self_reference_in_the_Godel_sentence > -- > Copyright 2021 Pete Olcott > > "Great spirits have always encountered violent opposition from mediocre > minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-15 15:43 +0000 |
| Message-ID | <20210415083340.550@kylheku.com> |
| In reply to | #518028 |
["Followup-To:" header set to comp.theory.]
On 2021-04-15, olcott <NoOne@NoWhere.com> wrote:
> On 4/14/2021 7:32 PM, Kaz Kylheku wrote:
>> On 2021-04-14, olcott <NoOne@NoWhere.com> wrote:
>>> 14 Every epistemological antinomy can likewise be used for a similar
>>> undecidability proof.
>>
>> Except the liar-paradox and its ilk; those fall victim to Tarski's
>> undefinabiity, independently discovered by Gödel.
>>
>> "Every epistemological antinomy can likewise be used for a similar
>> undecidability proof." really means every *eligible* one.
>>
>> That rules out ones which try to model a system's semantic truth within
>> that system.
>>
>> Gödel's sentence models only a mechanical truth: derivation from axioms.
>> I.e. the notion of "provable", not "true".
>>
>> In any axiomatic system where you can represent formulas arithmetically,
>> you can set up an undecidability proof in relation to deriving from
>> axioms. Or something like that.
>>
>
> 14 Every epistemological antinomy can likewise be used for a similar
> undecidability proof. (Gödel 1931:39-41)
We know for a fact that Gödel tried, and was not able to encode the liar
paradox into arithmetic, which is required for his undecidability proof,
and that he knew about this in 1930.
"The undefinability theorem is conventionally attributed to Alfred
Tarski. Gödel also discovered the undefinability theorem in 1930, while
proving his incompleteness theorems published in 1931, and well before
the 1933 publication of Tarski's work (Murawski 1998)."
[https://en.wikipedia.org/wiki/Tarski%27s_undefinability_theorem]
It must be that Gödel didn't regard the liar paradox as being an
"epistemological antinomy".
You're trying to milk everything out of the only sentences in Gödel
which you can understand at all. Or think you can understand, at any rate.
[toc] | [prev] | [next] | [standalone]
| From | Archimedes Plutonium <plutonium.archimedes@gmail.com> |
|---|---|
| Date | 2021-04-12 15:12 -0700 |
| Subject | 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) |
| Message-ID | <0def7b37-a914-4163-ae39-1820cad478c2n@googlegroups.com> |
| In reply to | #517407 |
Pete Olcott, that b.s. spammer of 2 OR 1 = 3 with 2 AND 1 = 1, that failure of logic. Read AP's true Logic-- Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) Everything that Pete does, says or thinks in Logic is one complete worthless pile of b.s. until he accepts the true connectors of logic with AND truth table TTTF. Otherwise, Pete is as full of shit in logic as was Boole with his AND as TFFF No point in talking about anything in and of logic -- until you accept the true connectors of AND, OR, IF->Then, Equal-Not. Godel was a rinky dink failure of logic, who was so dumb in logic that he thought 10 OR 2= 12 with AND as subtraction. Pete just loves to spam sci.math with his worthless dreck. 5th published book Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) Last revision was 29Mar2021. This is AP's 5th published book of science. Preface: First comes Logic-- think straight and clear which many logic and math professors are deaf dumb and blind to, and simply refuse to recognize and fix their errors. The single biggest error of Old Logic of Boole and Jevons was their "AND" and "OR" connectors. They got them mixed up and turned around. For their logic ends up being that of 3 OR 2 = 5 with 3 AND 2 = either 3 or 2 but never 5, when even the local village idiot knows that 3 AND 2 = 5 (addition) with 3 OR 2 = either 3 or 2 (subtraction). The AND connector in Logic stems from the idea, the mechanism involved, that given a series of statements, if just one of those many statements has a true truth value, then the entire string of statements is overall true, and thus AND truth table is truly TTTF and never TFFF. And secondly, their error of the If->Then conditional. I need to make it clear enough to the reader why the true Truth Table of IF --> Then requires a U for unknown or uncertain with a probability outcome for F --> T = U and F --> F = U. Some smart readers would know that the reason for the U is because without the U, Logic has no means of division by 0 which is undefined in mathematics. You cannot have a Logic that is less than mathematics. A logic that is impoverished and cannot do a "undefined for division by 0 in mathematics". The true logic must be able to have the fact that division by 0 is undefined. True logic is larger than all of mathematics, and must be able to fetch any piece of mathematics from out of Logic itself. So another word for U is undefined. And this is the crux of why Reductio ad Absurdum cannot be a proof method of mathematics, for a starting falsehood in a mathematics proof can only lead to a probability end conclusion. My corrections of Old Logic have a history that dates before 1993, sometime around 1991, I realized the Euclid proof of infinitude of primes was illogical, sadly sadly wrong, in that the newly formed number by "multiply the lot and add 1" was necessarily a new prime in the indirect proof method. So that my history of fixing Old Logic starts in 1991, but comes to a synthesis of correcting all four of the connectors of Equal/not, And, Or, If->Then, by 2015. Cover picture: some may complain my covers are less in quality, but I have a good reason for those covers-- I would like covers of math or logic to show the teacher's own handwriting as if he were back in the classroom writing on the blackboard or an overhead projector. Length: 72 pages File Size: 773 KB Print Length: 72 pages Publication Date: March 12, 2019 Sold by: Amazon Digital Services LLC Language: English ASIN: B07PMB69F5 Text-to-Speech: Enabled  X-Ray: Not Enabled  Word Wise: Not Enabled Lending: Enabled Screen Reader: Supported  Enhanced Typesetting: Enabled 
[toc] | [prev] | [next] | [standalone]
| From | Michael Moroney <moroney@world.std.spaamtrap.com> |
|---|---|
| Date | 2021-04-12 19:51 -0400 |
| Subject | Re: Archimedes "irrelevant" Plutonium flunked the math test of a lifetime-generation test |
| Message-ID | <s52med$1ogb$1@gioia.aioe.org> |
| In reply to | #517640 |
🤡 of Math and 🃏 of Physics Archimedes "Court Jester of Math" Plutonium <plutonium.archimedes@gmail.com> fails at math and science: > Pete Olcott, that b.s. spammer of 2 OR 1 = 3 with 2 AND 1 = 1, that failure of logic. > Everything that Pete does, says or thinks in Logic is one complete worthless pile of b.s. Why are you insulting your superior like that? You sound mad. Is it because Pete is using a bunch of math symbols, none of which you have any clue as to what they mean?
[toc] | [prev] | [next] | [standalone]
| From | Archimedes Plutonium <plutonium.archimedes@gmail.com> |
|---|---|
| Date | 2021-04-12 23:49 -0700 |
| Subject | What is Godel good for when you cannot even recognize that AND should be TTTF not TFFF, and so Godel was rinky dink |
| Message-ID | <63aff26e-041c-463e-8829-272bc50101b4n@googlegroups.com> |
| In reply to | #517407 |
Pete Olcott, that b.s. spammer of 2 OR 1 = 3 with 2 AND 1 = 1, that failure of logic. Read AP's true Logic-- Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) Everything that Pete does, says or thinks in Logic is one complete worthless pile of b.s. until he accepts the true connectors of logic with AND truth table TTTF. Otherwise, Pete is as full of shit in logic as was Boole with his AND as TFFF No point in talking about anything in and of logic -- until you accept the true connectors of AND, OR, IF->Then, Equal-Not. Godel was a rinky dink failure of logic, who was so dumb in logic that he thought 10 OR 2= 12 with AND as subtraction. Pete just loves to spam sci.math with his worthless dreck. 5th published book Suspend all College Classes in Logic, until they Fix their Errors // Logic series, book 1 Kindle Edition by Archimedes Plutonium (Author) Last revision was 29Mar2021. This is AP's 5th published book of science. Preface: First comes Logic-- think straight and clear which many logic and math professors are deaf dumb and blind to, and simply refuse to recognize and fix their errors. The single biggest error of Old Logic of Boole and Jevons was their "AND" and "OR" connectors. They got them mixed up and turned around. For their logic ends up being that of 3 OR 2 = 5 with 3 AND 2 = either 3 or 2 but never 5, when even the local village idiot knows that 3 AND 2 = 5 (addition) with 3 OR 2 = either 3 or 2 (subtraction). The AND connector in Logic stems from the idea, the mechanism involved, that given a series of statements, if just one of those many statements has a true truth value, then the entire string of statements is overall true, and thus AND truth table is truly TTTF and never TFFF. And secondly, their error of the If->Then conditional. I need to make it clear enough to the reader why the true Truth Table of IF --> Then requires a U for unknown or uncertain with a probability outcome for F --> T = U and F --> F = U. Some smart readers would know that the reason for the U is because without the U, Logic has no means of division by 0 which is undefined in mathematics. You cannot have a Logic that is less than mathematics. A logic that is impoverished and cannot do a "undefined for division by 0 in mathematics". The true logic must be able to have the fact that division by 0 is undefined. True logic is larger than all of mathematics, and must be able to fetch any piece of mathematics from out of Logic itself. So another word for U is undefined. And this is the crux of why Reductio ad Absurdum cannot be a proof method of mathematics, for a starting falsehood in a mathematics proof can only lead to a probability end conclusion. My corrections of Old Logic have a history that dates before 1993, sometime around 1991, I realized the Euclid proof of infinitude of primes was illogical, sadly sadly wrong, in that the newly formed number by "multiply the lot and add 1" was necessarily a new prime in the indirect proof method. So that my history of fixing Old Logic starts in 1991, but comes to a synthesis of correcting all four of the connectors of Equal/not, And, Or, If->Then, by 2015. Cover picture: some may complain my covers are less in quality, but I have a good reason for those covers-- I would like covers of math or logic to show the teacher's own handwriting as if he were back in the classroom writing on the blackboard or an overhead projector. Length: 72 pages File Size: 773 KB Print Length: 72 pages Publication Date: March 12, 2019 Sold by: Amazon Digital Services LLC Language: English ASIN: B07PMB69F5 Text-to-Speech: Enabled  X-Ray: Not Enabled  Word Wise: Not Enabled Lending: Enabled Screen Reader: Supported  Enhanced Typesetting: Enabled 
[toc] | [prev] | [standalone]
Page 4 of 4 — ← Prev page 1 2 3 [4]
Back to top | Article view | sci.math
csiph-web