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


Groups > sci.logic > #167044 > unrolled thread

Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula?

Started byRupert <rupertmccallum@yahoo.com>
First post2017-11-18 16:34 -0800
Last post2017-11-19 19:18 -0800
Articles 20 on this page of 68 — 8 participants

Back to article view | Back to sci.logic

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


Contents

  Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-18 16:34 -0800
    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-18 18:40 -0800
      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-18 18:59 -0800
        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-18 20:31 -0800
          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-19 04:28 -0800
            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 05:55 -0800
              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-20 18:11 -0800
                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-21 06:48 -0800
        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 14:14 -0800
          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 14:43 -0800
            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-21 00:29 +0000
              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:11 -0800
                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-21 01:44 +0000
                  Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:49 -0800
                    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-21 12:30 +0000
                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-21 13:06 -0600
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-21 13:28 -0600
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-22 01:31 +0000
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-21 17:53 -0800
                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-22 21:39 +0000
                              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-22 18:35 -0800
                                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-23 23:43 +0000
                                  Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-23 16:39 -0800
                                    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 01:05 +0000
                                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-23 20:23 -0800
                                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-23 20:24 -0800
                                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 12:30 +0000
                                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-24 08:51 -0600
                                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-24 10:37 -0500
                                              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-24 07:47 -0800
                                                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-24 11:10 -0500
                                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 20:29 +0000
                                              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-24 20:50 -0600
                                                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-25 12:47 +0000
                                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 20:29 +0000
                                    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-23 20:54 -0500
              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:16 -0800
                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:31 -0800
                  Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:51 -0800
                    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:55 -0800
                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:52 -0800
                  Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 18:01 -0800
                    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 23:08 -0800
                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-21 11:02 -0800
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-21 13:30 -0600
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 20:09 +0000
                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 20:54 +0000
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-21 16:18 -0500
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-21 22:31 -0800
                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-23 17:03 -0800
            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:04 -0800
              Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:22 -0800
                Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:54 -0800
                  Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 18:03 -0800
                    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-20 20:35 -0800
                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-20 22:01 -0800
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 09:44 +0000
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-21 02:30 -0800
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-21 10:36 -0800
                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 09:38 +0000
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 11:56 +0000
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-21 04:29 -0800
                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-21 04:31 -0800
                            Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 14:37 +0000
                      Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-21 21:42 -0800
                        Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-22 06:36 -0800
                          Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-22 13:44 -0500
    Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-19 19:18 -0800

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


#167293

Frompeteolcott <peterolcott2@gmail.com>
Date2017-11-22 18:35 -0800
Message-ID<e2fa9a52-e7f7-47d6-8154-71a472cfe74c@googlegroups.com>
In reply to#167282
On Wednesday, November 22, 2017 at 3:39:04 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> <snip>
> > Even though I have spent 3000 hours on this since 16 months ago there
> > are only about 22 pages on the site.
> >
> > A good chunk of this time was spent writing a Minimal Type Theory to
> > Directed Acyclic Graph compiler.
> 
> I'll wait for the peer-reviewed paper, but as a precaution, I won't hold
> my breath.
> 
> -- 
> Ben.

Defining Tarski’s ∀x True(x) ↔ φ(x) -
∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability -
∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability - 

As far as I know you have never answered the key questions that would -
let anyone know what it even means. -

Bull shit.

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


#167324

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-11-23 23:43 +0000
Message-ID<87h8tkr26q.fsf@bsb.me.uk>
In reply to#167293
peteolcott <peterolcott2@gmail.com> writes:

> On Wednesday, November 22, 2017 at 3:39:04 PM UTC-6, Ben Bacarisse wrote:
<snip>
>> I'll wait for the peer-reviewed paper, but as a precaution, I won't hold
>> my breath.
>
> Defining Tarski’s ∀x True(x) ↔ φ(x) -
> ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability -
> ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability - 
>
> As far as I know you have never answered the key questions that would -
> let anyone know what it even means. -

I am not making the claim.  Oh, I see.  You've forgotten how to quote
text properly.

> Bull shit.

So how is the paper coming along?  You've been posting about this topic
for nearly 15 years so it does not seem unreasonable to expect a
peer-reviewed paper by now.  Even if you have decided you were wrong for
the first decade of making these sorts of claim, you must be close to
knowing what you mean now.

-- 
Ben.

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


#167325

Frompeteolcott <peterolcott2@gmail.com>
Date2017-11-23 16:39 -0800
Message-ID<4abce4da-dc61-4562-ae39-cc200d4fab2b@googlegroups.com>
In reply to#167324
On Thursday, November 23, 2017 at 5:43:43 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> 
> > On Wednesday, November 22, 2017 at 3:39:04 PM UTC-6, Ben Bacarisse wrote:
> <snip>
> >> I'll wait for the peer-reviewed paper, but as a precaution, I won't hold
> >> my breath.
> >
> > Defining Tarski’s ∀x True(x) ↔ φ(x) -
> > ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability -
> > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability - 
> >
> > As far as I know you have never answered the key questions that would -
> > let anyone know what it even means. -
> 
> I am not making the claim.  Oh, I see.  You've forgotten how to quote
> text properly.
> 
> > Bull shit.
> 
> So how is the paper coming along?  You've been posting about this topic
> for nearly 15 years so it does not seem unreasonable to expect a
> peer-reviewed paper by now.  Even if you have decided you were wrong for
> the first decade of making these sorts of claim, you must be close to
> knowing what you mean now.
> 
> -- 
> Ben.

Hypothetically if we assume that I have correctly proven 1931 Incompleteness Theorem to be incorrect, who would be my peer? 

What instances are there of of Theorems that have been accepted as proven for 87 years that have been dramatically overturned? 

Most everyone that I have spoken with about these things are logician's rather than philosophers so they have been trained to think inside the box. Whenever I start thinking outside the box this is always taken to be an error from their think-inside-the-box POV. 

The closest field that I could come up with where something like a peer might exist is philosophy of logic. I tried talking with these guys and the only one that ever responded was Doug Lenat of Cyc Corp fame. 
http://www.cyc.com/natural-language-processing-in-cyc/ 

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


#167327

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-11-24 01:05 +0000
Message-ID<87bmjsqyeq.fsf@bsb.me.uk>
In reply to#167325
peteolcott <peterolcott2@gmail.com> writes:

> On Thursday, November 23, 2017 at 5:43:43 PM UTC-6, Ben Bacarisse wrote:
>> peteolcott writes:
>> 
>> > On Wednesday, November 22, 2017 at 3:39:04 PM UTC-6, Ben Bacarisse wrote:
>> <snip>
>> >> I'll wait for the peer-reviewed paper, but as a precaution, I won't hold
>> >> my breath.
>> >
>> > Defining Tarski’s ∀x True(x) ↔ φ(x) -
>> > ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability -
>> > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability - 
>> >
>> > As far as I know you have never answered the key questions that would -
>> > let anyone know what it even means. -
>> 
>> I am not making the claim.  Oh, I see.  You've forgotten how to quote
>> text properly.
>> 
>> > Bull shit.
>> 
>> So how is the paper coming along?  You've been posting about this topic
>> for nearly 15 years so it does not seem unreasonable to expect a
>> peer-reviewed paper by now.  Even if you have decided you were wrong for
>> the first decade of making these sorts of claim, you must be close to
>> knowing what you mean now.
>> 
>
> Hypothetically if we assume that I have correctly proven 1931
> Incompleteness Theorem to be incorrect, who would be my peer?

That's not how it works.  You write the paper and submit it.  The
journal picks the reviewers.  I have been asked to peer-review articles
but that was not in this field.  Journals pick experts, not people like
me.

> What instances are there of of Theorems that have been accepted as
> proven for 87 years that have been dramatically overturned?
>
> Most everyone that I have spoken with about these things are
> logician's rather than philosophers so they have been trained to think
> inside the box. Whenever I start thinking outside the box this is
> always taken to be an error from their think-inside-the-box POV.

Ah, so no journal will ever take your paper because no expert will ever
see that you are right?  Frankly, I suggest you do something else.
Surely there's something better you could do than evade the questions of
people you have no respect for on Usenet?

<snip>
-- 
Ben.

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


#167329

Fromgrahamcooper7@gmail.com
Date2017-11-23 20:23 -0800
Message-ID<b88951df-3f4c-4312-84bf-01d9998da0fe@googlegroups.com>
In reply to#167327
On Friday, November 24, 2017 at 12:05:20 PM UTC+11, Ben Bacarisse wrote:
> peteolcott <peterolcott2@gmail.com> writes:
> 
> > On Thursday, November 23, 2017 at 5:43:43 PM UTC-6, Ben Bacarisse wrote:
> >> peteolcott writes:
> >> 
> >> > On Wednesday, November 22, 2017 at 3:39:04 PM UTC-6, Ben Bacarisse wrote:
> >> <snip>
> >> >> I'll wait for the peer-reviewed paper, but as a precaution, I won't hold
> >> >> my breath.
> >> >
> >> > Defining Tarski’s ∀x True(x) ↔ φ(x) -
> >> > ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability -
> >> > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability - 
> >> >
> >> > As far as I know you have never answered the key questions that would -
> >> > let anyone know what it even means. -
> >> 
> >> I am not making the claim.  Oh, I see.  You've forgotten how to quote
> >> text properly.
> >> 
> >> > Bull shit.
> >> 
> >> So how is the paper coming along?  You've been posting about this topic
> >> for nearly 15 years so it does not seem unreasonable to expect a
> >> peer-reviewed paper by now.  Even if you have decided you were wrong for
> >> the first decade of making these sorts of claim, you must be close to
> >> knowing what you mean now.
> >> 
> >
> > Hypothetically if we assume that I have correctly proven 1931
> > Incompleteness Theorem to be incorrect, who would be my peer?
> 
> That's not how it works.  You write the paper and submit it.  The
> journal picks the reviewers.  I have been asked to peer-review articles
> but that was not in this field.  Journals pick experts, not people like
> me.
> 
> > What instances are there of of Theorems that have been accepted as
> > proven for 87 years that have been dramatically overturned?
> >
> > Most everyone that I have spoken with about these things are
> > logician's rather than philosophers so they have been trained to think
> > inside the box. Whenever I start thinking outside the box this is
> > always taken to be an error from their think-inside-the-box POV.
> 
> Ah, so no journal will ever take your paper because no expert will ever
> see that you are right?  Frankly, I suggest you do something else.
> Surely there's something better you could do than evade the questions of
> people you have no respect for on Usenet?
> 


DO YOU?


do you know what a metaphor is you Big Boob!

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


#167330

Fromgrahamcooper7@gmail.com
Date2017-11-23 20:24 -0800
Message-ID<0c569a7f-a673-4648-9e70-2cda4697fb20@googlegroups.com>
In reply to#167327
> Surely there's something better you could do than evade the questions


Post 1 USENET ID where you answered 1 QUESTION BEN !

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


#167346

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-11-24 12:30 +0000
Message-ID<871sknrh9q.fsf@bsb.me.uk>
In reply to#167330
grahamcooper7@gmail.com writes:

>> Surely there's something better you could do than evade the questions
>
> Post 1 USENET ID where you answered 1 QUESTION BEN !

Message-ID: <87zi8259sm.fsf@bsb.me.uk>

(I've got a list in case you were being overly literal in asking for
one.)

Looking through my posts in this group, I found it interesting how often
people ask me rhetorical questions like "will you now agree that...".

-- 
Ben.

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


#167352

FromPete Olcott <Pete@NoEmail.address>
Date2017-11-24 08:51 -0600
Message-ID<BKqdnZaT5vWQr4XHnZ2dnUU7-YmdnZ2d@giganews.com>
In reply to#167346
On 11/24/2017 6:30 AM, Ben Bacarisse wrote:
> grahamcooper7@gmail.com writes:
>
>>> Surely there's something better you could do than evade the questions
>> Post 1 USENET ID where you answered 1 QUESTION BEN !
> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
>
> (I've got a list in case you were being overly literal in asking for
> one.)
>
> Looking through my posts in this group, I found it interesting how often
> people ask me rhetorical questions like "will you now agree that...".
>
You know that is a bad link don't you?

Here is what a good link (to your message) looks like:
https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ

-- 
Defining Tarski’s ∀x True(x) ↔ φ(x)
∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability
∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability

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


#167353

FromJim Burns <james.g.burns@att.net>
Date2017-11-24 10:37 -0500
Message-ID<23dd8ffc-6dd8-144a-3b6a-40fad447cc18@att.net>
In reply to#167352
On 11/24/2017 9:51 AM, Pete Olcott wrote:
> On 11/24/2017 6:30 AM, Ben Bacarisse wrote:

>> Message-ID: <87zi8259sm.fsf@bsb.me.uk>

> You know that is a bad link don't you?

<https://en.wikipedia.org/wiki/Message-ID>

> Here is what a good link (to your message) looks like:
> https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ

<https://en.wikipedia.org/wiki/URL>

You're welcome.

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


#167354

Frompeteolcott <peterolcott2@gmail.com>
Date2017-11-24 07:47 -0800
Message-ID<db239bd2-508f-4123-bf15-6911bb5134f8@googlegroups.com>
In reply to#167353
On Friday, November 24, 2017 at 9:37:39 AM UTC-6, Jim Burns wrote:
> On 11/24/2017 9:51 AM, Pete Olcott wrote:
> > On 11/24/2017 6:30 AM, Ben Bacarisse wrote:
> 
> >> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
> 
> > You know that is a bad link don't you?
> 
> <https://en.wikipedia.org/wiki/Message-ID>
> 
> > Here is what a good link (to your message) looks like:
> > https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ
> 
> <https://en.wikipedia.org/wiki/URL>
> 
> You're welcome.

When you click on his link it does not work.
When you click on my link it works.
Maybe now you can begin to understand what I mean by extraneous details? 

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


#167355

FromJim Burns <james.g.burns@att.net>
Date2017-11-24 11:10 -0500
Message-ID<b36447ae-e42c-6ce3-e948-d9f798e9a874@att.net>
In reply to#167354
On 11/24/2017 10:47 AM, peteolcott wrote:
> On Friday, November 24, 2017 at 9:37:39 AM UTC-6,
> Jim Burns wrote:
>> On 11/24/2017 9:51 AM, Pete Olcott wrote:
>>> On 11/24/2017 6:30 AM, Ben Bacarisse wrote:

>>>> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
>>
>>> You know that is a bad link don't you?
>>
>> <https://en.wikipedia.org/wiki/Message-ID>
>>
>>> Here is what a good link (to your message) looks like:
>>> https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ
>>
>> <https://en.wikipedia.org/wiki/URL>
>>
>> You're welcome.
> 
> When you click on his link it does not work.
> When you click on my link it works.
> Maybe now you can begin to understand what I mean by
> extraneous details?

I agree. This is a perfect example of _what you mean by_
_extraneous details_

His link does not work because his link is not a link,
it is a message-ID -- which it said right there.
What is a message-ID? See the link I gave you.

And _what you mean by extraneous details_ is that you
don't know what you are talking about and you will make
no effort to find out.

That is an excellent summary of your position with respect
to Goedel's first incompleteness theorem and Tarski's
undefinability of truth. You don't know what you are
talking about, and you _insist_ on making no effort to
find out. You call anything you don't want to bother
with "extraneous details", without even knowing what those
details are.

Here's yet another detail for you to call extraneous:
<https://en.wikipedia.org/wiki/Dunning_Kruger>

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


#167377

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-11-24 20:29 +0000
Message-ID<ovak2q$s6g$1@gioia.aioe.org>
In reply to#167352
Pete Olcott <Pete@NoEmail.address> writes:

> On 11/24/2017 6:30 AM, Ben Bacarisse wrote:
>> grahamcooper7@gmail.com writes:
>>
>>>> Surely there's something better you could do than evade the questions
>>> Post 1 USENET ID where you answered 1 QUESTION BEN !
>> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
>>
>> (I've got a list in case you were being overly literal in asking for
>> one.)
>>
>> Looking through my posts in this group, I found it interesting how often
>> people ask me rhetorical questions like "will you now agree that...".
>>
> You know that is a bad link don't you?

I was asked for an ID so I gave one.  That's the correct way to
reference a Usenet post.  With a good news reader you should just be
able to click on that ID.  (The Google web interface is a terriable new
reader.)

> Here is what a good link (to your message) looks like:
> https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ

No, that's a web URL -- and, what's more, one provided by a company
whose support for Usenet may vanish any time they feel it to be no
longer profitable.  And it's of no use in most news readers.

How's the paper coming along?

-- 
Ben.

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


#167379

FromPete Olcott <Pete@NoEmail.address>
Date2017-11-24 20:50 -0600
Message-ID<3dadnSrvWZkaR4XHnZ2dnUU7-b_NnZ2d@giganews.com>
In reply to#167377
On 11/24/2017 2:29 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
>
>> On 11/24/2017 6:30 AM, Ben Bacarisse wrote:
>>> grahamcooper7@gmail.com writes:
>>>
>>>>> Surely there's something better you could do than evade the questions
>>>> Post 1 USENET ID where you answered 1 QUESTION BEN !
>>> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
>>>
>>> (I've got a list in case you were being overly literal in asking for
>>> one.)
>>>
>>> Looking through my posts in this group, I found it interesting how often
>>> people ask me rhetorical questions like "will you now agree that...".
>>>
>> You know that is a bad link don't you?
> I was asked for an ID so I gave one.  That's the correct way to
> reference a Usenet post.  With a good news reader you should just be
> able to click on that ID.  (The Google web interface is a terriable new
> reader.)

Thunderbird links Message-ID, yet thinks the above one is an email address.
It links to other Message-ID from you just fine.

>> Here is what a good link (to your message) looks like:
>> https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ
> No, that's a web URL -- and, what's more, one provided by a company
> whose support for Usenet may vanish any time they feel it to be no
> longer profitable.  And it's of no use in most news readers.
>
> How's the paper coming along?
>
I bought a book that explains how to do SOL in Prolog.
I am also considering learning Lambda Calculus as a Lingua Franca for MTT.


-- 

Defining Tarski’s ∀x True(x) ↔ φ(x)
∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability
∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability

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


#167405

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-11-25 12:47 +0000
Message-ID<871skmjzih.fsf@bsb.me.uk>
In reply to#167379
Pete Olcott <Pete@NoEmail.address> writes:

> On 11/24/2017 2:29 PM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>>
>>> On 11/24/2017 6:30 AM, Ben Bacarisse wrote:
>>>> grahamcooper7@gmail.com writes:
>>>>
>>>>>> Surely there's something better you could do than evade the questions
>>>>> Post 1 USENET ID where you answered 1 QUESTION BEN !
>>>> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
>>>>
>>>> (I've got a list in case you were being overly literal in asking for
>>>> one.)
>>>>
>>>> Looking through my posts in this group, I found it interesting how often
>>>> people ask me rhetorical questions like "will you now agree that...".
>>>>
>>> You know that is a bad link don't you?
>> I was asked for an ID so I gave one.  That's the correct way to
>> reference a Usenet post.  With a good news reader you should just be
>> able to click on that ID.  (The Google web interface is a terriable new
>> reader.)
>
> Thunderbird links Message-ID, yet thinks the above one is an email
> address.

Thunderbird is a mail program with a news reader tacked on so that is
not surprising.

> It links to other Message-ID from you just fine.

It should open it in a browser because it is simple a web URL.
Obviously even my good news reader will do that, but that is of no use
if I want to treat is as a news post.

<snip>
>> How's the paper coming along?
>>
> I bought a book that explains how to do SOL in Prolog.
> I am also considering learning Lambda Calculus as a Lingua Franca for MTT.

So still in the foothills after 15 years of making these claims.  Do you
realise that by using notations like Prolog and the lambda calculus you
are simply incorporating the theorems you so very much hate into your
logic?

-- 
Ben.

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


#167440

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-11-24 20:29 +0000
Message-ID<87d147pght.fsf@bsb.me.uk>
In reply to#167352
Pete Olcott <Pete@NoEmail.address> writes:

> On 11/24/2017 6:30 AM, Ben Bacarisse wrote:
>> grahamcooper7@gmail.com writes:
>>
>>>> Surely there's something better you could do than evade the questions
>>> Post 1 USENET ID where you answered 1 QUESTION BEN !
>> Message-ID: <87zi8259sm.fsf@bsb.me.uk>
>>
>> (I've got a list in case you were being overly literal in asking for
>> one.)
>>
>> Looking through my posts in this group, I found it interesting how often
>> people ask me rhetorical questions like "will you now agree that...".
>>
> You know that is a bad link don't you?

No, I was asked for an ID so I gave one.  That's the correct way to
reference a Usenet post.  With a good news reader you should just be
able to click on that ID.

> Here is what a good link (to your message) looks like:
> https://groups.google.com/d/msg/sci.logic/tkTdcj9ejJU/mwS0T_kuAwAJ

No, that's a web URL -- and, what's more, one provided by a company
whose support for Usenet may vanish any time they feel it to be no
longer profitable.  And it's of no use in most news readers.

How's the paper coming along?

-- 
Ben.

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


#167328

FromJim Burns <james.g.burns@att.net>
Date2017-11-23 20:54 -0500
Message-ID<33cf5dea-bb5f-fcb8-1d92-f68677069370@att.net>
In reply to#167325
On 11/23/2017 7:39 PM, peteolcott wrote:
> On Thursday, November 23, 2017 at 5:43:43 PM UTC-6,
>  Ben Bacarisse wrote:
>> peteolcott writes:

>>> Bull shit.
>>
>> So how is the paper coming along?  You've been posting
>> about this topic for nearly 15 years so it does not seem
>> unreasonable to expect a peer-reviewed paper by now.
>> Even if you have decided you were wrong for the first
>> decade of making these sorts of claim, you must be close
>> to knowing what you mean now.

> Hypothetically if we assume that I have correctly
> proven 1931 Incompleteness Theorem to be incorrect,
> who would be my peer?

Is it your claim that you will not be able to explain
your oh-so-hypothetical results? If you can explain it
(when, someday, you have these hypothetical results),
why wouldn't you explain it?

Is it possible that you want to have an excuse to make
enormous claims without having to back them up?
It looks as though your "correction" of Goedel's "error"
is to transform logic into a mystery religion, based
on fantastical claims and supported by faith. Will you
be taking up a collection, too?

> What instances are there of of Theorems that have been
>  accepted as proven for 87 years that have been
>  dramatically overturned?

Shall we consider physical theories? Geocentrism was
overturned after only a few thousand years. How was that
done? Did Copernicus tell all the geocentrists that
that their criticisms could not be valid because they were
geocentrists? If he did, that must have convinced them,
since today only cranks are geocentrists.

How did he convince people who believed differently?
Is it even possible to do?

> Most everyone that I have spoken with about these things
>  are logician's rather than philosophers so they have
>  been trained to think inside the box. Whenever I start
>  thinking outside the box this is always taken to be an
>  error from their think-inside-the-box POV.

This is pretty much the quintessential argument ad hominem.
You say criticisms are wrong because of who made the
criticisms.

In the past, I have badgered you, trying to get you to
learn FOPL. However, I see now that this would not have
helped you -- not until you learn how to make a reasonably
effective plain-language argument.

> The closest field that I could come up with where
>  something like a peer might exist is philosophy of logic.
>  I tried talking with these guys and the only one that
>  ever responded was Doug Lenat of Cyc Corp fame.
> http://www.cyc.com/natural-language-processing-in-cyc/

The poor man. I bet he is embarrassed to be associated
with you in any way.

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


#167154

FromRupert <rupertmccallum@yahoo.com>
Date2017-11-20 17:16 -0800
Message-ID<07eb6390-6983-44c2-9b89-89c54e04a78f@googlegroups.com>
In reply to#167151
On Tuesday, November 21, 2017 at 1:29:43 AM UTC+1, Ben Bacarisse wrote:
> peteolcott <peterolcott2@gmail.com> writes:
> 
> > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote:
> >> Peter Olcott: So Stafford University got it wrong? 
> >> 
> >> Me: No. They did not make the claim you attributed to them.
> >
> > Sure they did and here is where they did:
> > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom 
> 
> Rupert is a careful poster.  The "no" was placed after this text:
> 
> | Defining Tarski’s ∀x True(x) ↔ φ(x) 
> | ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability
> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
> 
> none of which can be found on that page.  And since I'm posting, did you
> ever say what the binary Provable means?
> 
> -- 
> Ben.

Peter Olcott wrote:

OK then you are saying that the Stanford University form of the 1931 Incompleteness Theorem (shown above) accurately sums up the essence of the formula at the top of page 57 of the original paper?

The formula at the top of page 57 is the definition of omega-inconsistency, which is not what the Stanford University formula is about. This is my reason for saying "No". 

If he goes to the bottom of page 58, he will find an expression for the Goedel number of the Goedel sentence.

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


#167156

Frompeteolcott <peterolcott2@gmail.com>
Date2017-11-20 17:31 -0800
Message-ID<017fd8a9-54fb-4998-b7ad-130173dfe5d4@googlegroups.com>
In reply to#167154
On Monday, November 20, 2017 at 7:16:27 PM UTC-6, Rupert wrote:
> On Tuesday, November 21, 2017 at 1:29:43 AM UTC+1, Ben Bacarisse wrote:
> > peteolcott <peterolcott> writes:
> > 
> > > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote:
> > >> Peter Olcott: So Stafford University got it wrong? 
> > >> 
> > >> Me: No. They did not make the claim you attributed to them.
> > >
> > > Sure they did and here is where they did:
> > > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom 
> > 
> > Rupert is a careful poster.  The "no" was placed after this text:
> > 
> > | Defining Tarski’s ∀x True(x) ↔ φ(x) 
> > | ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability
> > | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
> > 
> > none of which can be found on that page.  And since I'm posting, did you
> > ever say what the binary Provable means?
> > 
> > -- 
> > Ben.
> 
> Peter Olcott wrote:
> 
> OK then you are saying that the Stanford University form of the 1931 Incompleteness Theorem (shown above) accurately sums up the essence of the formula at the top of page 57 of the original paper?
> 
> The formula at the top of page 57 is the definition of omega-inconsistency, which is not what the Stanford University formula is about. This is my reason for saying "No". 
> 
> If he goes to the bottom of page 58, he will find an expression for the Goedel number of the Goedel sentence.

I saw no other formula in the original pager that looks as much like G on page 97:  http://liarparadox.org/NNH_Pages_96_98.pdf

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


#167159

FromRupert <rupertmccallum@yahoo.com>
Date2017-11-20 17:51 -0800
Message-ID<ddd17bdc-1ef8-4aca-9d09-a8427df92414@googlegroups.com>
In reply to#167156
On Tuesday, November 21, 2017 at 2:31:35 AM UTC+1, peteolcott wrote:
> On Monday, November 20, 2017 at 7:16:27 PM UTC-6, Rupert wrote:
> > On Tuesday, November 21, 2017 at 1:29:43 AM UTC+1, Ben Bacarisse wrote:
> > > peteolcott <peterolcott> writes:
> > > 
> > > > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote:
> > > >> Peter Olcott: So Stafford University got it wrong? 
> > > >> 
> > > >> Me: No. They did not make the claim you attributed to them.
> > > >
> > > > Sure they did and here is where they did:
> > > > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom 
> > > 
> > > Rupert is a careful poster.  The "no" was placed after this text:
> > > 
> > > | Defining Tarski’s ∀x True(x) ↔ φ(x) 
> > > | ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability
> > > | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
> > > 
> > > none of which can be found on that page.  And since I'm posting, did you
> > > ever say what the binary Provable means?
> > > 
> > > -- 
> > > Ben.
> > 
> > Peter Olcott wrote:
> > 
> > OK then you are saying that the Stanford University form of the 1931 Incompleteness Theorem (shown above) accurately sums up the essence of the formula at the top of page 57 of the original paper?
> > 
> > The formula at the top of page 57 is the definition of omega-inconsistency, which is not what the Stanford University formula is about. This is my reason for saying "No". 
> > 
> > If he goes to the bottom of page 58, he will find an expression for the Goedel number of the Goedel sentence.
> 
> I saw no other formula in the original pager that looks as much like G on page 97:  http://liarparadox.org/NNH_Pages_96_98.pdf

So you don't understand the notation at all, so you'd probably better not comment on the paper.

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


#167162

Frompeteolcott <peterolcott2@gmail.com>
Date2017-11-20 17:55 -0800
Message-ID<a6e1dd6e-e782-42c0-b02b-b6204cf6f0d6@googlegroups.com>
In reply to#167159
On Monday, November 20, 2017 at 7:51:32 PM UTC-6, Rupert wrote:
> On Tuesday, November 21, 2017 at 2:31:35 AM UTC+1, peteolcott wrote:
> > On Monday, November 20, 2017 at 7:16:27 PM UTC-6, Rupert wrote:
> > > On Tuesday, November 21, 2017 at 1:29:43 AM UTC+1, Ben Bacarisse wrote:
> > > > peteolcott <peterolcott> writes:
> > > > 
> > > > > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote:
> > > > >> Peter Olcott: So Stafford University got it wrong? 
> > > > >> 
> > > > >> Me: No. They did not make the claim you attributed to them.
> > > > >
> > > > > Sure they did and here is where they did:
> > > > > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom 
> > > > 
> > > > Rupert is a careful poster.  The "no" was placed after this text:
> > > > 
> > > > | Defining Tarski’s ∀x True(x) ↔ φ(x) 
> > > > | ∀x True(x)  ↔ ∃y Provable(y, x)  // True entirely defined by Provability
> > > > | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
> > > > 
> > > > none of which can be found on that page.  And since I'm posting, did you
> > > > ever say what the binary Provable means?
> > > > 
> > > > -- 
> > > > Ben.
> > > 
> > > Peter Olcott wrote:
> > > 
> > > OK then you are saying that the Stanford University form of the 1931 Incompleteness Theorem (shown above) accurately sums up the essence of the formula at the top of page 57 of the original paper?
> > > 
> > > The formula at the top of page 57 is the definition of omega-inconsistency, which is not what the Stanford University formula is about. This is my reason for saying "No". 
> > > 
> > > If he goes to the bottom of page 58, he will find an expression for the Goedel number of the Goedel sentence.
> > 
> > I saw no other formula in the original pager that looks as much like G on page 97:  http://liarparadox.org/NNH_Pages_96_98.pdf
> 
> So you don't understand the notation at all, so you'd probably better not comment on the paper.

It turns out that this comment is superseded by further research.

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


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

Back to top | Article view | sci.logic


csiph-web