Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #164791 > unrolled thread
| Started by | peteolcott <peterolcott2@gmail.com> |
|---|---|
| First post | 2017-10-11 10:01 -0700 |
| Last post | 2017-10-24 10:34 -0700 |
| Articles | 19 on this page of 59 — 8 participants |
Back to article view | Back to sci.logic
The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 10:01 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 10:36 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-11 21:59 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-11 18:29 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 00:52 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-11 19:15 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 02:02 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 18:50 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 11:28 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 06:37 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 11:52 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 12:44 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 18:08 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 15:25 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 19:18 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 17:12 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 21:24 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-13 08:31 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-13 17:07 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-17 08:38 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-17 14:51 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-17 07:08 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-17 20:49 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 08:54 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-18 17:28 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 18:41 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 18:49 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 11:51 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-20 07:17 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 15:45 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-20 13:09 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-18 12:56 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-18 20:11 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 19:52 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-18 21:41 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 21:44 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-19 18:26 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-19 17:39 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 11:38 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-20 07:18 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 16:10 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 19:12 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 22:32 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 18:54 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 18:47 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 19:31 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 19:59 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 17:40 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-13 01:46 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 17:55 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 21:40 -0400
Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-13 12:26 +0100
Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-23 15:10 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: Charlie-Boo <shymathguy@gmail.com> - 2017-10-24 10:36 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-24 15:02 -0500
Re: The simplest possible form of the 1931 Incompleteness Theorem: William Elliot <marsh@panix.com> - 2017-10-11 21:16 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 21:59 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: William Elliot <marsh@panix.com> - 2017-10-12 19:44 -0700
Re: The simplest possible form of the 1931 Incompleteness Theorem: Charlie-Boo <shymathguy@gmail.com> - 2017-10-24 10:34 -0700
Page 3 of 3 — ← Prev page 1 2 [3]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-10-20 16:10 +0100 |
| Message-ID | <osd3m5$rlq$1@news.albasani.net> |
| In reply to | #165376 |
peteolcott wrote: > On Friday, October 20, 2017 at 5:38:55 AM UTC-5, Peter Percival wrote: >> peteolcott wrote: >> >>> >>> Yet you apparently do not realize that respect and its opposite have nothing at all to do with correct reasoning (logic). >>> >>> G @ ~Provable(X, G) - >>> The above sentence states that it is not provable. - >>> The above sentence is indeed not provable. - >>> QED The true essence of the 1931 GIT >>> >> >> What theory does your notion of proof refer to? >> > > Aristotle's syllogism. There are complete and consistent theories of the syllogism, so it has no relevance to incompleteness. > -- Do, as a concession to my poor wits, Lord Darlington, just explain to me what you really mean. I think I had better not, Duchess. Nowadays to be intelligible is to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-10-18 19:12 -0700 |
| Message-ID | <1d88c66a-a52a-4024-ab55-701efae69c17@googlegroups.com> |
| In reply to | #165279 |
On Wednesday, October 18, 2017 at 7:52:23 PM UTC-5, mitch wrote: > On 10/18/2017 07:11 PM, Jim Burns wrote: > > What follows is my attempt to translate this: > > ∃X (X ⊢ Y) asserts that there is a set of connected WFF > > from X to Y. > > into first-order predicate logic. > > > > Maybe it would be useful if I inserted English glosses for > > the various definitions. > > > > On 10/18/2017 12:56 PM, Jim Burns wrote: > > > >> Provable(y) @ > >> Ex:( Proof(x) & y = last(x) ) > > > > "y is provable" means > > there is some proof x that ends with y > > > > If y is a finite string (I want to say well-formed > formula, but ...) and x is a sequence of finite > strings, then are you using a two-sorted logic? > > > mitch Jim did make it more convoluted. All that we are really asking is whether or not there exists a sequence of WFF from X to Y. Prolog does not need to infer any infinite set. If a WFF does not exist in Prolog's database, then it does not exist. The tricky part is connecting all of these WFF together head to tail.
[toc] | [prev] | [next] | [standalone]
| From | mitch <mitch@dev.null> |
|---|---|
| Date | 2017-10-18 22:32 -0500 |
| Message-ID | <6aidnRP_naN8gXXEnZ2dnUU7-LWdnZ2d@giganews.com> |
| In reply to | #165287 |
On 10/18/2017 09:12 PM, peteolcott wrote: > On Wednesday, October 18, 2017 at 7:52:23 PM UTC-5, mitch wrote: >> On 10/18/2017 07:11 PM, Jim Burns wrote: >>> What follows is my attempt to translate this: >>> ∃X (X ⊢ Y) asserts that there is a set of connected WFF >>> from X to Y. >>> into first-order predicate logic. >>> >>> Maybe it would be useful if I inserted English glosses for >>> the various definitions. >>> >>> On 10/18/2017 12:56 PM, Jim Burns wrote: >>> >>>> Provable(y) @ >>>> Ex:( Proof(x) & y = last(x) ) >>> >>> "y is provable" means >>> there is some proof x that ends with y >>> >> >> If y is a finite string (I want to say well-formed >> formula, but ...) and x is a sequence of finite >> strings, then are you using a two-sorted logic? >> >> >> mitch > > Jim did make it more convoluted. > Nope. You made it convoluted. Mr. Burns is trying to make sense of it if at all possible. Sorry, boss. mitch
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-10-18 18:54 -0700 |
| Message-ID | <1fc3f4b6-f9ee-4bc9-87ab-cd9205f6977f@googlegroups.com> |
| In reply to | #165276 |
On Wednesday, October 18, 2017 at 7:11:58 PM UTC-5, Jim Burns wrote: > What follows is my attempt to translate this: > ∃X (X ⊢ Y) asserts that there is a set of connected WFF > from X to Y. > into first-order predicate logic. > > Maybe it would be useful if I inserted English glosses for > the various definitions. > > On 10/18/2017 12:56 PM, Jim Burns wrote: > > > Provable(y) @ > > Ex:( Proof(x) & y = last(x) ) > > "y is provable" means > there is some proof x that ends with y > > > Proof(x) @ > > ( len(x) > 1 & > > Ez:( z = last(x) & > > Ep:( p = allbutlast(x) & > > Justifies(p,z) ) & Proof(p) ))) > > \/ > > ( len(x) = 1 & Axiom( peek(1,x) ) ) > > "x is a proof" means > either of two things: > (i) If x is longer than one formula long, the last > formula z is justified by the earlier formulas p, and > the earlier formulas themselves form a proof > (ii) If x is one formula long, that formula is an axiom. > > > Justifies(p,z) @ > > Axiom(z) \/ > > Ex:Ey: Lists(p,x) & Lists(p,y) & Rule(x,y,z) > > "p justifies z" means > either of two things: > (i) z is an axiom > (ii) the finite formula sequence p lists two > formulas x and y from which z follows, > according to the rules of inference. > > > Lists(p,x) @ > > Ek:( 1 =< k =< len(p) & x = peek(k,p) ) > > "p lists x" means > for the sequence p of formulas, there is some number k > for which x is the k_th formula of p > > > y = last(x) @ > > y = peek(len(x),x) > > y is the last formula of the sequence x" > > > p = allbutlast(x) @ > > p = subseq( 1, len(x)-1, x ) > > The formulas sequence p is the formula sequence x, > except without the last formula of x. > > > y = subseq( j, k, x ) @ > > len(y) = k + 1 - j & > > Ai: j =< i =< k -> peek( i, y ) = peek( i + j - 1, x ) > > The formula sequence y is the subsequence of the > formula sequence x, that starts at the j_th position of x > and ends at the k_th position of x. > That is enormously better.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-10-18 18:47 -0700 |
| Message-ID | <5ccca6d6-5dbc-4434-b3a5-c02408e06c27@googlegroups.com> |
| In reply to | #165274 |
On Wednesday, October 18, 2017 at 11:56:16 AM UTC-5, Jim Burns wrote: > On 10/18/2017 11:54 AM, peteolcott wrote: > > On Tuesday, October 17, 2017 at 7:49:19 PM UTC-5, > > Jim Burns wrote: > >> On 10/17/2017 9:38 AM, Pete Olcott wrote: > >>> On 10/13/2017 4:07 PM, Jim Burns wrote: > > >>>> People occasionally work out the precise sentence of arithmetic > >>>> that is proven to be true if and only if it is provable and > >>> > >>> AND it is impossibly provable because it is logically > >>> incoherent: > >>> G @ ∃X Provable(X,G) - > >>> [00] ROOT (01) - > >>> [01] G (02) - > >>> [02] Provable (03)(0) // Cycle indicates evaluation infinite loop - > >>> [03] X - > >> > Can you answer the question "What is the formal system > in which Prolog decides x proves y?" > What if you want to prove that about some_different_ > formal system? What will you do? > First of all let me say that was a very good question. I already explained that at a very high level of abstraction. The programmer formally specifies a set of FACTS and and set of RULES the system uses Backward chaining inference based on level agnostic** predicate logic to link these to the QUERY (conclusion of the proof). ** level agnostic predicate logic in not FOPL, SOPL or HOPL it is arbitrary finite order PL. I do not currently have any additional details. I am in the process of moving Minimal Type Theory system to its own Linux based server, 512 MB dedicated RAM and 1 dedicated CPU core for $5 per month.
[toc] | [prev] | [next] | [standalone]
| From | mitch <mitch@dev.null> |
|---|---|
| Date | 2017-10-18 19:31 -0500 |
| Message-ID | <lbSdnYZrL5Tjb3rEnZ2dnUU7-KfNnZ2d@giganews.com> |
| In reply to | #164949 |
On 10/18/2017 12:12 AM, Pete Olcott wrote: > *When I say somthing totally clear you simply ignore it. * No one ignores it. It is your responsibility to present it so that your audience says "Ah! That is so clear, I cannot believe that I did not see it!" You, jackass, have *NO* *RIGHT* to *speak* for your audience. Mr. Burns, Mr. Percival, and Rupert probably have the most complete knowledge of Goedel's incompleteness theorem in this forum, with Mr. Greene close behind. I cannot speak for Mr. Shobe. Across the board, his remarks are very direct and insightful. But, they are often very terse. Nevertheless, I know that he is expert on your other delusion -- the halting problem. So, too, is Mr. Bacarisse who is probably enjoying some rest since you have turned to Goedel's theorems. Mr. Smaill picks up a regular paycheck because of his knowledge in these areas. As for me, I am a crank. But, I am a damn good one and know my responsibilities. Should I ever have a construct that satisfies what I am trying to do, the next step would be to submit a publishable document. Unfortunately, that is a pretty difficult hurdle that Ph.D. students get practice toward when they write their thesis with advisory help. I will never receive that assistance. No one is ignoring what you are saying. They are telling you to put up or shut up. You have not put up anything that makes it clear to other people that you have anything worthwhile. And, to make matters worse, you are a conceited liar to the best anyone can tell. Whenever you do provide some sort of third party reference, someone in this forum has identified the fact that you have misrepresented the statements of the author. So, first, you should consider shutting up. Go learn first-order logic so that you can criticize it intelligibly. You might even learn how to write a proof. Then, you might understand what it takes to write a logic or a metalogic. And, with any luck, you might realize the ubiquity of notions like induction and well-foundedness in mathematics which are generally understood in terms of prior and posterior elements representable with directed acyclic graphs. You are saying nothing. And, you are saying it badly. You are the one ignoring what is totally clear. mitch
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-12 19:59 +0100 |
| Message-ID | <87376ojioj.fsf@bsb.me.uk> |
| In reply to | #164861 |
peteolcott <peterolcott2@gmail.com> writes: > On Thursday, October 12, 2017 at 5:28:25 AM UTC-5, Ben Bacarisse wrote: >> peteolcott writes: <snip> >> > So as usual you want to go around and around focusing on relative >> > trivialities to make sure that the actual point is always dodged. >> >> I don't think the correctness of your claim is a triviality. And the >> point you are dodging is a very important one -- that you write English >> in order to avoid doing mathematics. > > No, as I told you many years ago all of the currently existing > branches of mathematics are insufficiently expressive to detect the > error. Because of this I invented Minimal Type Theory. Not my point. Look at the subject: "The simplest possible form of the 1931 Incompleteness Theorem" That says GIT is a theorem. It says you have a simpler form of that theorem. I was simply asking you to justify that claim. You can't, of course, because you don't even know what GIT says beyond a Sunday supplement write-up. You got lost before you'd got though even the definitions used in the paper. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-10-12 17:40 -0700 |
| Message-ID | <84797ee8-3e19-46c1-bfeb-bc74cc002af8@googlegroups.com> |
| In reply to | #164866 |
On Thursday, October 12, 2017 at 1:59:59 PM UTC-5, Ben Bacarisse wrote: > peteolcott writes: > > > On Thursday, October 12, 2017 at 5:28:25 AM UTC-5, Ben Bacarisse wrote: > >> peteolcott writes: > <snip> > >> > So as usual you want to go around and around focusing on relative > >> > trivialities to make sure that the actual point is always dodged. > >> > >> I don't think the correctness of your claim is a triviality. And the > >> point you are dodging is a very important one -- that you write English > >> in order to avoid doing mathematics. > > > > No, as I told you many years ago all of the currently existing > > branches of mathematics are insufficiently expressive to detect the > > error. Because of this I invented Minimal Type Theory. > > Not my point. Look at the subject: > > "The simplest possible form of the 1931 Incompleteness Theorem" > > That says GIT is a theorem. It says you have a simpler form of that > theorem. I was simply asking you to justify that claim. > I justified it in my next reply to Jim, her it is again: (1) The 1931 GIT has all kinds of extraneous complexity that is mostly eliminated by this: Gödel’s Proof Revised Edition Nagel, Newman, and Hofstadter http://liarparadox.org/NNH_Pages_96_98.pdf (G) ~(∃x) Dem (x, Sub(n, 17, n) ) // page 96 Two more steps reduce this extraneous complexity further. Completing the substitution (G) ~(∃x) Dem (x, G) Converting to common notation (G) ~(∃x)(x ⊢ G)
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-13 01:46 +0100 |
| Message-ID | <874lr3j2nm.fsf@bsb.me.uk> |
| In reply to | #164876 |
peteolcott <peterolcott2@gmail.com> writes: > On Thursday, October 12, 2017 at 1:59:59 PM UTC-5, Ben Bacarisse wrote: >> peteolcott writes: >> >> > On Thursday, October 12, 2017 at 5:28:25 AM UTC-5, Ben Bacarisse wrote: >> >> peteolcott writes: >> <snip> >> >> > So as usual you want to go around and around focusing on relative >> >> > trivialities to make sure that the actual point is always dodged. >> >> >> >> I don't think the correctness of your claim is a triviality. And the >> >> point you are dodging is a very important one -- that you write English >> >> in order to avoid doing mathematics. >> > >> > No, as I told you many years ago all of the currently existing >> > branches of mathematics are insufficiently expressive to detect the >> > error. Because of this I invented Minimal Type Theory. >> >> Not my point. Look at the subject: >> >> "The simplest possible form of the 1931 Incompleteness Theorem" >> >> That says GIT is a theorem. It says you have a simpler form of that >> theorem. I was simply asking you to justify that claim. >> > > I justified it in my next reply to Jim, her it is again: > > (1) The 1931 GIT has all kinds of extraneous complexity that is mostly eliminated by this: > > Gödel’s Proof Revised Edition Nagel, Newman, and Hofstadter > http://liarparadox.org/NNH_Pages_96_98.pdf > (G) ~(∃x) Dem (x, Sub(n, 17, n) ) // page 96 > > Two more steps reduce this extraneous complexity further. > Completing the substitution > (G) ~(∃x) Dem (x, G) > > Converting to common notation > (G) ~(∃x)(x ⊢ G) No. None of this constitutes the proof of a theorem, let alone a theorem stated in English. But waffle away, you are obviously having fun. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-10-12 17:55 -0700 |
| Message-ID | <d10170f6-0aeb-4f08-bbe3-35e8dedfc3a1@googlegroups.com> |
| In reply to | #164879 |
On Thursday, October 12, 2017 at 7:46:08 PM UTC-5, Ben Bacarisse wrote: > peteolcott writes: > > > On Thursday, October 12, 2017 at 1:59:59 PM UTC-5, Ben Bacarisse wrote: > >> peteolcott writes: > >> > >> > On Thursday, October 12, 2017 at 5:28:25 AM UTC-5, Ben Bacarisse wrote: > >> >> peteolcott writes: > >> <snip> > >> >> > So as usual you want to go around and around focusing on relative > >> >> > trivialities to make sure that the actual point is always dodged. > >> >> > >> >> I don't think the correctness of your claim is a triviality. And the > >> >> point you are dodging is a very important one -- that you write English > >> >> in order to avoid doing mathematics. > >> > > >> > No, as I told you many years ago all of the currently existing > >> > branches of mathematics are insufficiently expressive to detect the > >> > error. Because of this I invented Minimal Type Theory. > >> > >> Not my point. Look at the subject: > >> > >> "The simplest possible form of the 1931 Incompleteness Theorem" > >> > >> That says GIT is a theorem. It says you have a simpler form of that > >> theorem. I was simply asking you to justify that claim. > >> > > > > I justified it in my next reply to Jim, her it is again: > > > > (1) The 1931 GIT has all kinds of extraneous complexity that is mostly eliminated by this: > > > > Gödel’s Proof Revised Edition Nagel, Newman, and Hofstadter > > http://liarparadox.org/NNH_Pages_96_98.pdf > > (G) ~(∃x) Dem (x, Sub(n, 17, n) ) // page 96 > > > > Two more steps reduce this extraneous complexity further. > > Completing the substitution > > (G) ~(∃x) Dem (x, G) > > > > Converting to common notation > > (G) ~(∃x)(x ⊢ G) > > No. None of this constitutes the proof of a theorem, let alone a theorem > stated in English. But waffle away, you are obviously having fun. > > -- > Ben. How did you get confused and think that I was proving a theorem? I never said anything like that in this whole thread.
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2017-10-12 21:40 -0400 |
| Message-ID | <d7d7e92f-34eb-9d03-f843-8119a00a78dc@att.net> |
| In reply to | #164880 |
On 10/12/2017 8:55 PM, peteolcott wrote:
> On Thursday, October 12, 2017 at 7:46:08 PM UTC-5,
> Ben Bacarisse wrote:
>> peteolcott writes:
>>> On Thursday, October 12, 2017 at 1:59:59 PM UTC-5,
>>> Ben Bacarisse wrote:
>>>> peteolcott writes:
>>>>> On Thursday, October 12, 2017 at 5:28:25 AM UTC-5,
>>>>> Ben Bacarisse wrote:
>>>>>> peteolcott writes:
>>>>>>> So as usual you want to go around and around focusing on
>>>>>>> relative trivialities to make sure that the actual point
>>>>>>> is always dodged.
>>>>>>
>>>>>> I don't think the correctness of your claim is a triviality.
>>>>>> And the point you are dodging is a very important one --
>>>>>> that you write English in order to avoid doing mathematics.
>>>>>
>>>>> No, as I told you many years ago all of the currently
>>>>> existing branches of mathematics are insufficiently expressive
>>>>> to detect the error. Because of this I invented
>>>>> Minimal Type Theory.
>>>>
>>>> Not my point. Look at the subject:
>>>> "The simplest possible form of the 1931 Incompleteness Theorem"
>>>> That says GIT is a theorem. It says you have a simpler form
>>>> of that theorem. I was simply asking you to justify that claim.
>>>
>>> I justified it in my next reply to Jim, her it is again:
>>>
>>> (1) The 1931 GIT has all kinds of extraneous complexity that
>>> is mostly eliminated by this:
>>> Gödel’s Proof Revised Edition Nagel, Newman, and Hofstadter
>>> http://liarparadox.org/NNH_Pages_96_98.pdf
>>> (G) ~(∃x) Dem (x, Sub(n, 17, n) ) // page 96
>>> Two more steps reduce this extraneous complexity further.
>>> Completing the substitution
>>> (G) ~(∃x) Dem (x, G)
>>> Converting to common notation
>>> (G) ~(∃x)(x ⊢ G)
>>
>> No. None of this constitutes the proof of a theorem, let
>> alone a theorem stated in English. But waffle away, you
>> are obviously having fun.
> How did you get confused and think that I was proving a theorem?
> I never said anything like that in this whole thread.
Look at the subject:
"The simplest possible form of the 1931 Incompleteness Theorem"
You said this is a theorem, the simplest possible form of some
other theorem:
(G) ~(∃x)(x ⊢ G)
Is it your plan to just _assert_ that it is a theorem?
That, maybe, if you repeat yourself enough times, you'll "win"?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-10-13 12:26 +0100 |
| Message-ID | <87o9pbgug9.fsf@bsb.me.uk> |
| In reply to | #164880 |
peteolcott <peterolcott2@gmail.com> writes: <snip> >> > On Thursday, October 12, 2017 at 1:59:59 PM UTC-5, Ben Bacarisse wrote: <snip> >> >> ... Look at the subject: >> >> >> >> "The simplest possible form of the 1931 Incompleteness Theorem" <snip> > How did you get confused and think that I was proving a theorem? I > never said anything like that in this whole thread. I never thought you were. What an absurd idea -- that you could or would prove anything. You simply claimed to state a theorem, in the vaguest possible way you could think of. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-10-23 15:10 -0500 |
| Message-ID | <KcSdnccnrq5a0XPEnZ2dnUU7-IudnZ2d@giganews.com> |
| In reply to | #164910 |
On 10/13/2017 6:26 AM, Ben Bacarisse wrote: > peteolcott <peterolcott2@gmail.com> writes: > <snip> >>>> On Thursday, October 12, 2017 at 1:59:59 PM UTC-5, Ben Bacarisse wrote: > <snip> >>>>> ... Look at the subject: >>>>> >>>>> "The simplest possible form of the 1931 Incompleteness Theorem" > <snip> >> How did you get confused and think that I was proving a theorem? I >> never said anything like that in this whole thread. > > I never thought you were. What an absurd idea -- that you could or > would prove anything. You simply claimed to state a theorem, in the > vaguest possible way you could think of. > This way has zero vagueness and can be translated into Prolog. http://liarparadox.org/index.php/2017/10/22/godels-1931-incompleteness-theorem-summed-as-a-single-line-of-minimal-type-theory/ Not only that but Prolog can even detect Pathological Self Reference. http://liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf My first use of the term Pathological Self-Reference: From: "Peter Olcott" <olcott@worldnet.att.net> Newsgroups: comp.theory,sci.logic Subject: Halting Problem Final Conclusion Date: Sun, 05 Sep 2004 16:21:57 GMT https://groups.google.com/forum/#!msg/comp.theory/RO9Z9eCabeE/Ka8-xS2rdEEJ -- Defining Tarski’s ∀x True(x) ↔ φ(x) True(x) ↔ ∃y Provable(y, x)
[toc] | [prev] | [next] | [standalone]
| From | Charlie-Boo <shymathguy@gmail.com> |
|---|---|
| Date | 2017-10-24 10:36 -0700 |
| Message-ID | <be1697f8-0673-4b0a-903d-9eb803bcfdd1@googlegroups.com> |
| In reply to | #164812 |
On Wednesday, October 11, 2017 at 4:59:33 PM UTC-4, Ben Bacarisse wrote: > peteolcott <peterolcott2@gmail.com> writes: > > > "This (quoted) sentence cannot be proven true." > > > > Transformed so it is much easier to see what is going on: > > "Why can't this (quoted) sentence be proven true?" > > Can you prove your theorem? I doubt it, but trying to will reveal why > neither of these are the simplest possible form of any theorem. It's not a statement. Can you prove a horse? C-B > > copyright 2017 Pete Olcott > > !! > > -- > Ben.
[toc] | [prev] | [next] | [standalone]
| From | mitch <mitch@dev.null> |
|---|---|
| Date | 2017-10-24 15:02 -0500 |
| Message-ID | <cbCdnVJcwqH1AXLEnZ2dnUU7-fnNnZ2d@giganews.com> |
| In reply to | #165646 |
On 10/24/2017 12:36 PM, Charlie-Boo wrote: > On Wednesday, October 11, 2017 at 4:59:33 PM UTC-4, Ben Bacarisse wrote: >> peteolcott <peterolcott2@gmail.com> writes: >> >>> "This (quoted) sentence cannot be proven true." >>> >>> Transformed so it is much easier to see what is going on: >>> "Why can't this (quoted) sentence be proven true?" >> >> Can you prove your theorem? I doubt it, but trying to will reveal why >> neither of these are the simplest possible form of any theorem. > > It's not a statement. Can you prove a horse? > The question had been directed to the subject line. If one claims that something is the smallest set with a certain property, one must prove that the set has the property and that it is a subset of all sets with that property. Is that not so? The subject line begins with "The simplest possible..." mitch
[toc] | [prev] | [next] | [standalone]
| From | William Elliot <marsh@panix.com> |
|---|---|
| Date | 2017-10-11 21:16 -0700 |
| Message-ID | <Pine.NEB.4.64.1710112114310.11476@panix5.panix.com> |
| In reply to | #164791 |
On Wed, 11 Oct 2017, peteolcott wrote: > "This (quoted) sentence cannot be proven true." > > Transformed so it is much easier to see what is going on: > "Why can't this (quoted) sentence be proven true?" Because it's a paradox. Thus the probability of "This (quoted) sentence cannot be proven true." is 1/2 as demostrated in the thread "Half True".
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-10-11 21:59 -0700 |
| Message-ID | <c295c64d-2460-4e76-a2e3-312594dc9b40@googlegroups.com> |
| In reply to | #164840 |
On Wednesday, October 11, 2017 at 11:16:31 PM UTC-5, William Elliot wrote: > On Wed, 11 Oct 2017, peteolcott wrote: > > > "This (quoted) sentence cannot be proven true." > > > > Transformed so it is much easier to see what is going on: > > "Why can't this (quoted) sentence be proven true?" > > Because it's a paradox. Thus the probability of > "This (quoted) sentence cannot be proven true." > is 1/2 as demostrated in the thread "Half True". (1) It cannot be proven true because it is not true. (2) It is not true because it is not a declarative sentence and only declarative sentences are truth bearers. (3) Why it is not a declarative sentence is the tricky part. The four types of sentences in the English language include: Declarative sentence. Imperative sentence. Interrogative sentence. Exclamatory sentence.
[toc] | [prev] | [next] | [standalone]
| From | William Elliot <marsh@panix.com> |
|---|---|
| Date | 2017-10-12 19:44 -0700 |
| Message-ID | <Pine.NEB.4.64.1710121941210.23492@panix5.panix.com> |
| In reply to | #164844 |
On Wed, 11 Oct 2017, peteolcott wrote: > > > "This (quoted) sentence cannot be proven true." > > > > > > Transformed so it is much easier to see what is going on: > > > "Why can't this (quoted) sentence be proven true?" > > > > Because it's a paradox. Thus the probability of > > "This (quoted) sentence cannot be proven true." > > is 1/2 as demostrated in the thread "Half True". > > (1) It cannot be proven true because it is not true. Just because it's only half true is no reason to reject your precious, copywrighted junk.
[toc] | [prev] | [next] | [standalone]
| From | Charlie-Boo <shymathguy@gmail.com> |
|---|---|
| Date | 2017-10-24 10:34 -0700 |
| Message-ID | <7f4f4443-d939-40b1-87ce-80c676e265da@googlegroups.com> |
| In reply to | #164791 |
On Wednesday, October 11, 2017 at 1:01:36 PM UTC-4, peteolcott wrote: > "This (quoted) sentence cannot be proven true." > > Transformed so it is much easier to see what is going on: > "Why can't this (quoted) sentence be proven true?" > > copyright 2017 Pete Olcott Why can't we eat this sentence for supper? C-B
[toc] | [prev] | [standalone]
Page 3 of 3 — ← Prev page 1 2 [3]
Back to top | Article view | sci.logic
csiph-web