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


Groups > sci.logic > #172303 > unrolled thread

What is the deal with the Halting Theorem?

Started byNewberry <newberryxy@gmail.com>
First post2018-02-09 16:19 -0800
Last post2018-02-10 16:32 +0000
Articles 19 on this page of 99 — 9 participants

Back to article view | Back to sci.logic


Contents

  What is the deal with the Halting Theorem? Newberry <newberryxy@gmail.com> - 2018-02-09 16:19 -0800
    Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 02:05 +0000
    Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-10 00:31 -0600
      Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 12:19 +0000
      Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-10 18:26 -0800
        Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-12 09:19 -0800
    Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-10 00:15 -0800
      Re: What is the deal with the Halting Theorem? Newberry <newberryxy@gmail.com> - 2018-02-10 06:49 -0800
        Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 18:23 +0000
          Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-10 15:37 -0800
          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-12 09:16 -0800
            Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-12 17:40 +0000
              Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:48 -0600
                Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 04:46 +0000
                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-13 14:16 -0600
                    Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-13 20:46 +0000
                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-13 19:26 -0600
                      Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-14 13:54 +0000
                        Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 15:24 +0000
                    Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 00:21 +0000
                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-13 19:36 -0600
                        Re: What is the deal with the Halting Theorem? Newberry <newberryxy@gmail.com> - 2018-02-13 18:05 -0800
                          Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-13 22:12 -0600
                            Re: What is the deal with the Halting Theorem? Newberry <newberryxy@gmail.com> - 2018-02-13 21:10 -0800
                              Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-13 21:35 -0800
                                Re: What is the deal with the Halting Theorem? Newberry <newberryxy@gmail.com> - 2018-02-13 23:36 -0800
                                  Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-14 14:54 +0000
                                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 09:00 -0600
                                    Re: What is the deal with the Halting Theorem? Newberry <newberryxy@gmail.com> - 2018-02-14 08:29 -0800
                                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 10:46 -0600
                                        Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-14 21:37 -0800
                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-14 21:49 -0800
                                            Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-16 11:52 -0800
                                            Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-16 11:54 -0800
                                              Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 12:52 -0800
                                        Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 14:05 +0000
                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-15 07:02 -0800
                                            Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-15 07:09 -0800
                                              Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-15 10:41 -0600
                                            Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 15:20 +0000
                                              Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-15 10:56 -0600
                                                Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 17:05 +0000
                                                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-15 11:29 -0600
                                                    Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 17:35 +0000
                                                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-15 11:55 -0600
                                                        Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-16 13:44 +0000
                                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 07:21 -0800
                                                            Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 15:39 +0000
                                                              Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 09:08 -0800
                                                                Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-16 17:25 +0000
                                                                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-16 11:38 -0600
                                                                    Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-16 17:49 +0000
                                                                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-16 12:03 -0600
                                                                        Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-16 18:23 +0000
                                                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 10:33 -0800
                                                                        Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-16 16:49 -0800
                                                                    Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 18:20 +0000
                                                                      Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 10:28 -0800
                                                                        Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-16 18:55 +0000
                                                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 12:46 -0800
                                                                            Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-16 20:53 +0000
                                                                              Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-16 13:36 -0800
                                                                                Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-28 13:22 -0800
                                                                                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-28 15:46 -0600
                                                                        Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 20:44 +0000
                                                                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-16 15:53 -0600
                                                Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 17:29 +0000
                                Re: What is the deal with the Halting Theorem? Jim Burns <james.g.burns@att.net> - 2018-02-14 08:42 -0500
                                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 09:35 -0600
                                    Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-14 20:14 +0000
                                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 17:10 -0600
                                        Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 13:39 +0000
                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-15 06:47 -0800
                                    Re: What is the deal with the Halting Theorem? Jim Burns <james.g.burns@att.net> - 2018-02-14 20:55 -0500
                                  Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-14 08:27 -0800
                                Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-14 14:52 +0000
                                  Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 09:47 -0600
                                    Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-14 20:12 +0000
                                      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 17:05 -0600
                                        Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 13:53 +0000
                                          Re: What is the deal with the Halting Theorem? peteolcott <peterolcott2@gmail.com> - 2018-02-15 06:51 -0800
                                            Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 15:16 +0000
                                              Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-15 08:36 -0800
                                                Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-15 11:14 -0600
                                                Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 17:19 +0000
                                              Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-15 10:43 -0600
                                                Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-15 16:57 +0000
                                                  Re: What is the deal with the Halting Theorem? bursejan@gmail.com - 2018-02-15 09:24 -0800
                                      Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-16 11:58 -0800
                                    Re: What is the deal with the Halting Theorem? George Greene <greeneg@email.unc.edu> - 2018-02-14 21:33 -0800
                              Re: What is the deal with the Halting Theorem? Peter Percival <peterxpercival@hotmail.com> - 2018-02-14 14:45 +0000
                        Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 02:24 +0000
                          Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-13 22:18 -0600
                            Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 05:32 +0000
                              Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-14 00:30 -0600
                                Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 14:07 +0000
                    Re: What is the deal with the Halting Theorem? grahamcooper7@gmail.com - 2018-02-13 18:04 -0800
      Re: What is the deal with the Halting Theorem? Pete Olcott <Pete@NoEmail.address> - 2018-02-10 09:06 -0600
        Re: What is the deal with the Halting Theorem? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 16:32 +0000

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


#172782

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-15 06:51 -0800
Message-ID<98692e01-e44d-4523-b625-69f94f90f14c@googlegroups.com>
In reply to#172778
On Thursday, February 15, 2018 at 7:53:21 AM UTC-6, Peter Percival wrote:
> Pete Olcott wrote:
> > On 2/14/2018 2:12 PM, Peter Percival wrote:
> >> Pete Olcott wrote:
> 
> 
> >>> Arithmetic by itself does not even have Boolean negation.
> >>
> >> Formal arithmetic will be based on propositional calculus which has 
> >> "not".
> >>
> > 
> > http://mathworld.wolfram.com/PeanosAxioms.html
> > It looks like you are right, the above uses a Not.
> 
> I find it odd that, for years, you have been claiming that the 
> incompleteness theorem for arithmetic is false but only now have you 
> noticed that there is a not in its language.

The Incompleteness Theorem is incorrect because it would prove that Truth itself is broken. I never said for arithmetic, you have this incorrectly. 

Now I am getting much more specific.

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


#172787

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-15 15:16 +0000
Message-ID<p6488j$p28$1@news.albasani.net>
In reply to#172782
peteolcott wrote:
> On Thursday, February 15, 2018 at 7:53:21 AM UTC-6, Peter Percival wrote:
>> Pete Olcott wrote:
>>> On 2/14/2018 2:12 PM, Peter Percival wrote:
>>>> Pete Olcott wrote:
>>
>>
>>>>> Arithmetic by itself does not even have Boolean negation.
>>>>
>>>> Formal arithmetic will be based on propositional calculus which has
>>>> "not".
>>>>
>>>
>>> http://mathworld.wolfram.com/PeanosAxioms.html
>>> It looks like you are right, the above uses a Not.
>>
>> I find it odd that, for years, you have been claiming that the
>> incompleteness theorem for arithmetic is false but only now have you
>> noticed that there is a not in its language.
> 
> The Incompleteness Theorem is incorrect because it would prove that Truth itself is broken. I never said for arithmetic, you have this incorrectly.
> 
> Now I am getting much more specific.
> 
The incompleteness theorem has got nothing to do with truth.  For a 
broad class of theories T, there is a statement phi in the language of T 
such that neither T|-phi nor T|-~phi.  That is the incompleteness 
theorem.  Why don't you learn this stuff before pontificating in it?

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


#172795

Fromgrahamcooper7@gmail.com
Date2018-02-15 08:36 -0800
Message-ID<8035ada6-7b4f-4d30-95de-acc3e575131c@googlegroups.com>
In reply to#172787
On Friday,  Peter Percival wrote:

> The incompleteness theorem has got nothing to do with truth. 


BZZZZZT!


Good ByE MORON!

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


#172811

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-15 11:14 -0600
Message-ID<AaqdnS3MsYlzIhjHnZ2dnUU7-U3NnZ2d@giganews.com>
In reply to#172795
On 2/15/2018 10:36 AM, grahamcooper7@gmail.com wrote:
> On Friday,  Peter Percival wrote:
> 
>> The incompleteness theorem has got nothing to do with truth.
> 
> 
> BZZZZZT!
> 
> 
> Good ByE MORON!
> 
> 

To be fair that would not make him a moron.

Almost no one ever examines the 1931 GIT with any degree of
philosophical depth. They simply mechanically grind through
the specified steps learning them by rote with almost no actual
comprehension of the underlying reasoning.

They are not even aware that the 1931 GIT has an enormous amount
of totally extraneous complexity that is completely eliminated
if we examine this same proof using HOL that has a provability predicate.

Not only would this simplify the proof enormously it would also show
whether or not this proof applies to HOL formalizations.

This is an interesting article that explains:
Why Facts Don’t Change Our Minds

https://www.newyorker.com/magazine/2017/02/27/why-facts-dont-change-our-minds?mbid=rss&utm_content=buffer90e6f&utm_medium=social&utm_source=facebook.com&utm_campaign=buffer

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172813

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-15 17:19 +0000
Message-ID<p64fft$8rs$1@news.albasani.net>
In reply to#172795
grahamcooper7@gmail.com wrote:
> On Friday,  Peter Percival wrote:
> 
>> The incompleteness theorem has got nothing to do with truth.
> 
> 
> BZZZZZT!
> 
> 
> Good ByE MORON!
> 

Have you ever read an account of the incompleteness theorem?

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


#172799

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-15 10:43 -0600
Message-ID<z5mdnRRDX9VXJRjHnZ2dnUU7-ROdnZ2d@giganews.com>
In reply to#172787
On 2/15/2018 9:16 AM, Peter Percival wrote:
> peteolcott wrote:
>> On Thursday, February 15, 2018 at 7:53:21 AM UTC-6, Peter Percival wrote:
>>> Pete Olcott wrote:
>>>> On 2/14/2018 2:12 PM, Peter Percival wrote:
>>>>> Pete Olcott wrote:
>>>
>>>
>>>>>> Arithmetic by itself does not even have Boolean negation.
>>>>>
>>>>> Formal arithmetic will be based on propositional calculus which has
>>>>> "not".
>>>>>
>>>>
>>>> http://mathworld.wolfram.com/PeanosAxioms.html
>>>> It looks like you are right, the above uses a Not.
>>>
>>> I find it odd that, for years, you have been claiming that the
>>> incompleteness theorem for arithmetic is false but only now have you
>>> noticed that there is a not in its language.
>>
>> The Incompleteness Theorem is incorrect because it would prove that Truth itself is broken. I never said for arithmetic, you have this incorrectly.
>>
>> Now I am getting much more specific.
>>
> The incompleteness theorem has got nothing to do with truth.  For a broad class of theories T, there is a statement phi in the language of T such that neither T|-phi nor T|-~phi.  That is the incompleteness theorem.  Why don't you learn this stuff before pontificating in it?
> 

You are still not paying nearly enough attention.
A statement or mathematical sentence of language L must evaluate
to exactly one of True or False or it is disqualified as being
A statement or mathematical sentence of language L.

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172802

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-15 16:57 +0000
Message-ID<p64e61$bqi$1@news.albasani.net>
In reply to#172799
Pete Olcott wrote:
> On 2/15/2018 9:16 AM, Peter Percival wrote:
>> peteolcott wrote:
>>> On Thursday, February 15, 2018 at 7:53:21 AM UTC-6, Peter Percival 
>>> wrote:
>>>> Pete Olcott wrote:
>>>>> On 2/14/2018 2:12 PM, Peter Percival wrote:
>>>>>> Pete Olcott wrote:
>>>>
>>>>
>>>>>>> Arithmetic by itself does not even have Boolean negation.
>>>>>>
>>>>>> Formal arithmetic will be based on propositional calculus which has
>>>>>> "not".
>>>>>>
>>>>>
>>>>> http://mathworld.wolfram.com/PeanosAxioms.html
>>>>> It looks like you are right, the above uses a Not.
>>>>
>>>> I find it odd that, for years, you have been claiming that the
>>>> incompleteness theorem for arithmetic is false but only now have you
>>>> noticed that there is a not in its language.
>>>
>>> The Incompleteness Theorem is incorrect because it would prove that 
>>> Truth itself is broken. I never said for arithmetic, you have this 
>>> incorrectly.
>>>
>>> Now I am getting much more specific.
>>>
>> The incompleteness theorem has got nothing to do with truth.  For a 
>> broad class of theories T, there is a statement phi in the language of 
>> T such that neither T|-phi nor T|-~phi.  That is the incompleteness 
>> theorem.  Why don't you learn this stuff before pontificating in it?
>>
> 
> You are still not paying nearly enough attention.
> A statement or mathematical sentence of language L must evaluate
> to exactly one of True or False

That may be so, or it may be that cogent arguments can be made against 
it.  I am open-minded myself.  But in either case it does not relate to 
GIT.  Read this:

	For a broad class of theories T, there is a statement phi
	in the language of T such that neither T|-phi nor T|-~phi

and underline the words 'true' and 'false' or their synonyms wherever 
you see them.



> or it is disqualified as being
> A statement or mathematical sentence of language L.
> 

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


#172814

Frombursejan@gmail.com
Date2018-02-15 09:24 -0800
Message-ID<cf79affa-87b4-472d-85d3-a9a774895235@googlegroups.com>
In reply to#172802
Let me speculate, you also have 
~(A ⊆ A) like Mucke Funk? Right?

Am Donnerstag, 15. Februar 2018 18:20:20 UTC+1 schrieb Pete Olcott:
> On 2/15/2018 10:57 AM, Peter Percival
>       wrote:
> 
>     
>     Pete
>       Olcott wrote:
>       
> 
>       On 2/15/2018 9:16 AM, Peter Percival
>         wrote:
>         
> 
>         peteolcott wrote:
>           
> 
>           On Thursday, February 15, 2018 at
>             7:53:21 AM UTC-6, Peter Percival wrote:
>             
> 
>             Pete Olcott wrote:
>               
> 
>               On 2/14/2018 2:12 PM, Peter
>                 Percival wrote:
>                 
> 
>                 Pete Olcott wrote:
>                   
> 
>                 
>               
>               
> 
>               
> 
>               
>                 
>                   Arithmetic by itself does not
>                     even have Boolean negation.
>                     
> 
>                   
>                   
> 
>                   Formal arithmetic will be based on propositional
>                   calculus which has
>                   
> 
>                   "not".
>                   
> 
>                   
> 
>                 
>                 
> 
>                 http://mathworld.wolfram.com/PeanosAxioms.html
>                 
> 
>                 It looks like you are right, the above uses a Not.
>                 
> 
>               
>               
> 
>               I find it odd that, for years, you have been claiming that
>               the
>               
> 
>               incompleteness theorem for arithmetic is false but only
>               now have you
>               
> 
>               noticed that there is a not in its language.
>               
> 
>             
>             
> 
>             The Incompleteness Theorem is incorrect because it would
>             prove that Truth itself is broken. I never said for
>             arithmetic, you have this incorrectly.
>             
> 
>             
> 
>             Now I am getting much more specific.
>             
> 
>             
> 
>           
>           The incompleteness theorem has got nothing to do with truth. 
>           For a broad class of theories T, there is a statement phi in
>           the language of T such that neither T|-phi nor T|-~phi.  That
>           is the incompleteness theorem.  Why don't you learn this stuff
>           before pontificating in it?
>           
> 
>           
> 
>         
>         
> 
>         You are still not paying nearly enough attention.
>         
> 
>         A statement or mathematical sentence of language L must evaluate
>         
> 
>         to exactly one of True or False
>         
> 
>       
>       
> 
>       That may be so, or it may be that cogent arguments can be made
>       against it.  I am open-minded myself.  But in either case it does
>       not relate to GIT.  Read this:
>       
> 
>       
> 
>           For a broad class of theories T, there is a statement phi
>       
> 
>           in the language of T such that neither T|-phi nor T|-~phi
>       
> 
>       
> 
>       and underline the words 'true' and 'false' or their synonyms
>       wherever you see them.
>       
> 
>       
> 
>     
>     
> 
> 
>         
>     
> This is a brand new insight that you will not
>           be able to find any existing references to: 
> 
>         
>     
> a Collection is
>       defined one or more things that have one or more properties in
>       common. These operations from set theory are available:  {⊆, ∈}
>     
> An BaseFact is
>       an expression X of (natural or formal) language  L that has been
>       assigned the semantic property of True. (Similar to a math Axiom).
>     
> A Collection T
>       of BaseFacts of
>       language L forms the ultimate foundation of the notion of Truth in
>       language L.
>     
> To verify that an
>       expression X of language L is True or False only requires a
>       syntactic logical consequence inference chain (formal proof) from
>       X or ~X to one or more elements of T.
>     
> Copyright 2018 Pete
>       Olcott (I have brought up some of these ideas before on these
>       groups). 
> 
>     
>     
> -- 
> 
>       
>       
>             ∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X)

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


#172943

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-02-16 11:58 -0800
Message-ID<56f79c79-0dfa-4b9e-bad6-90d9ff2ecab0@googlegroups.com>
In reply to#172739
On Wednesday, February 14, 2018 at 3:12:16 PM UTC-5, Peter Percival wrote:
> Formal arithmetic will be based on propositional calculus

Not really.  Formal arithmetic has to be first-order, NOT MERELY propositional,
because there is no upper bound on the numbers.  The whole enterprise necessarily entails making statements ABOUT INFINITELY many things (there are infinitely
many prime numbers).

Propositional calculus is "zeroth"-order logic.  You *have* to go UP to first
to deal with infinity.  Yes, first is "based on" zeroth, but when you say something  like "arithmetic will be based on propositional calculus", you are
inviting people to think that you've found a way to do it using ONLY propositional calculus as OPPOSED to going up to first-order.  You have NOT found THAT.

Formal arithmetic is IN ANY CASE ALREADY A KNOWN thing.  You do NOT GET to re-
found or re-"base" it.  It ALREADY HAS a basis.  We are already using first-
order Peano Arithmetic.  THAT IS THE KNOWN basis.

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


#172765

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-02-14 21:33 -0800
Message-ID<da2f39ad-aefc-444a-9f51-2e6560040c38@googlegroups.com>
In reply to#172712
On Wednesday, February 14, 2018 at 10:47:23 AM UTC-5, Pete Olcott wrote:
> Arithmetic by itself does not even have Boolean negation.

Arithmetic by itself has Peano Arithmetic.
Negation is definable in PA.  You can JUST SAY N(0)=1 and N(1)=0 and
Ax[N(x)=1-x].  Or are you next going to tell me that "arithmetic by itself"
doesn't even have subtraction?
If it has addition, and a+b=c, then that is exactly equivalent to
(c-b=a)/\(c-a=b), so it DOES have subtraction, and if it has subtraction,
it has boolean negation.

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


#172700

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-14 14:45 +0000
Message-ID<p61i24$373$1@news.albasani.net>
In reply to#172671
Newberry wrote:

> 
> Is Gödel's sentence syntactically correct expression of FOL?

Gödel's original?  No.  That was a syntactically correct expression of 
Russell's type theory with natural numbers as type 0 individuals.  But 
subsequent formulations of GIT use first-order arithmetic and then G (as 
it is often called here) is a syntactically correct expression of FOL.

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


#172654

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-14 02:24 +0000
Message-ID<87d118e259.fsf@bsb.me.uk>
In reply to#172645
Pete Olcott <Pete@NoEmail.address> writes:
<snip>
> What everyone means for the general class of undecidable decision problems
> is inherently semantically incoherent. They have never bothered to notice
> this grave error only because they make sure to ignore the key nuances
> of semantics that would point out their error.
>
> If the whole class is erroneous then necessarily each instance in this
> class is also erroneous. This simplest instance of undecidable decision
> problem is the Liar Paradox. The other ones tends to be sufficiently
> convoluted that the analogy to the Liar Paradox is not very apparent.
>
> I have known for at least two decades that the existence of undecidable
> decision problems would logically entail that truth itself is broken.
>
> Even if the whole world has a universal consensus that Truth itself is
> broken the great thing about Truth is that it is not a Democracy.

So you have no valid objection to the chain of reasoning that proves the
halting theorem.  It's a purely syntactic matter.  You should simply say
you accept it for what it is since you have no valid objection to it.

-- 
Ben.

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


#172665

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-13 22:18 -0600
Message-ID<F7adnTuasNANJR7HnZ2dnUU7-YudnZ2d@giganews.com>
In reply to#172654
On 2/13/2018 8:24 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> <snip>
>> What everyone means for the general class of undecidable decision problems
>> is inherently semantically incoherent. They have never bothered to notice
>> this grave error only because they make sure to ignore the key nuances
>> of semantics that would point out their error.
>>
>> If the whole class is erroneous then necessarily each instance in this
>> class is also erroneous. This simplest instance of undecidable decision
>> problem is the Liar Paradox. The other ones tends to be sufficiently
>> convoluted that the analogy to the Liar Paradox is not very apparent.
>>
>> I have known for at least two decades that the existence of undecidable
>> decision problems would logically entail that truth itself is broken.
>>
>> Even if the whole world has a universal consensus that Truth itself is
>> broken the great thing about Truth is that it is not a Democracy.
> 
> So you have no valid objection to the chain of reasoning that proves the
> halting theorem.  It's a purely syntactic matter.  You should simply say
> you accept it for what it is since you have no valid objection to it.
> 

It "proves" something that is not true because it is blind to its error.
To see this one must first understand exactly what it means to be True.
Tarski "proved" that this is impossible. Tarski is wrong about this too.

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172676

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-14 05:32 +0000
Message-ID<87eflocf0k.fsf@bsb.me.uk>
In reply to#172665
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/13/2018 8:24 PM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>> <snip>
>>> What everyone means for the general class of undecidable decision problems
>>> is inherently semantically incoherent. They have never bothered to notice
>>> this grave error only because they make sure to ignore the key nuances
>>> of semantics that would point out their error.
>>>
>>> If the whole class is erroneous then necessarily each instance in this
>>> class is also erroneous. This simplest instance of undecidable decision
>>> problem is the Liar Paradox. The other ones tends to be sufficiently
>>> convoluted that the analogy to the Liar Paradox is not very apparent.
>>>
>>> I have known for at least two decades that the existence of undecidable
>>> decision problems would logically entail that truth itself is broken.
>>>
>>> Even if the whole world has a universal consensus that Truth itself is
>>> broken the great thing about Truth is that it is not a Democracy.
>>
>> So you have no valid objection to the chain of reasoning that proves the
>> halting theorem.  It's a purely syntactic matter.  You should simply say
>> you accept it for what it is since you have no valid objection to it.
>
> It "proves" something that is not true because it is blind to its
> error.

I'm saying you have not pointed out an error.  All the waffle and
analogies count for nothing.  A proof is a chain of reasoning, and you
have failed to find any flaw in it (please don't bring up the typo in
Linz again).  You should accept the theorem and then you can complain
about what it /really/ means to your hearts content.

> To see this one must first understand exactly what it means to be True.
> Tarski "proved" that this is impossible. Tarski is wrong about this
> too.

No, that's got nothing to do with it.  Halting is entirely free from
semantics.  I attempted to explain this to you but your "lazer-like
focus" meant you would not pay attention.  The halting theorem (ours,
not yours) is about what states a TM can reach, i.e. it is just about a
function iterated with extra state data (the symbols on the tape).  None
of the states need to "mean" anything and the proof, that no TM reaches
a particular state for some particular set of inputs strings is entirely
syntactic.  You have nothing to say about that.

-- 
Ben.

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


#172684

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-14 00:30 -0600
Message-ID<ROmdnbC8H7E5Sh7HnZ2dnUU7-IPNnZ2d@giganews.com>
In reply to#172676
On 2/13/2018 11:32 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> 
>> On 2/13/2018 8:24 PM, Ben Bacarisse wrote:
>>> Pete Olcott <Pete@NoEmail.address> writes:
>>> <snip>
>>>> What everyone means for the general class of undecidable decision problems
>>>> is inherently semantically incoherent. They have never bothered to notice
>>>> this grave error only because they make sure to ignore the key nuances
>>>> of semantics that would point out their error.
>>>>
>>>> If the whole class is erroneous then necessarily each instance in this
>>>> class is also erroneous. This simplest instance of undecidable decision
>>>> problem is the Liar Paradox. The other ones tends to be sufficiently
>>>> convoluted that the analogy to the Liar Paradox is not very apparent.
>>>>
>>>> I have known for at least two decades that the existence of undecidable
>>>> decision problems would logically entail that truth itself is broken.
>>>>
>>>> Even if the whole world has a universal consensus that Truth itself is
>>>> broken the great thing about Truth is that it is not a Democracy.
>>>
>>> So you have no valid objection to the chain of reasoning that proves the
>>> halting theorem.  It's a purely syntactic matter.  You should simply say
>>> you accept it for what it is since you have no valid objection to it.
>>
>> It "proves" something that is not true because it is blind to its
>> error.
> 
> I'm saying you have not pointed out an error.  All the waffle and
> analogies count for nothing.  A proof is a chain of reasoning, and you
> have failed to find any flaw in it (please don't bring up the typo in
> Linz again).  You should accept the theorem and then you can complain
> about what it /really/ means to your hearts content.
> 
>> To see this one must first understand exactly what it means to be True.
>> Tarski "proved" that this is impossible. Tarski is wrong about this
>> too.
> 
> No, that's got nothing to do with it.  Halting is entirely free from
> semantics.  

That is its big mistake.

> I attempted to explain this to you but your "lazer-like
> focus" meant you would not pay attention.  The halting theorem (ours,
> not yours) is about what states a TM can reach, i.e. it is just about a
> function iterated with extra state data (the symbols on the tape).  None
> of the states need to "mean" anything and the proof, that no TM reaches
> a particular state for some particular set of inputs strings is entirely
> syntactic.  You have nothing to say about that.
> 

No Halt Decider H can correctly decide semantically incorrect
input in exactly the same way and for exactly the same reason
that some syntactically WFF with no free variables cannot be
evaluated for True and False only because they are semantically incorrect.

Liar-Paradox ≡ ~True(Liar-Paradox) // HOL with self-reference semantics

Provide a formal mathematical proof deriving the correct truth value
of the above WFF.


-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172699

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-14 14:07 +0000
Message-ID<87po57br61.fsf@bsb.me.uk>
In reply to#172684
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/13/2018 11:32 PM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
<snip>
>>> To see this one must first understand exactly what it means to be True.
>>> Tarski "proved" that this is impossible. Tarski is wrong about this
>>> too.
>>
>> No, that's got nothing to do with it.  Halting is entirely free from
>> semantics.  
>
> That is its big mistake.

See my other reply.  There is not point in continuing while you deny the
simple facts about TMs.

-- 
Ben.

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


#172648

Fromgrahamcooper7@gmail.com
Date2018-02-13 18:04 -0800
Message-ID<83563522-dd7f-4c9e-8631-a002103d7272@googlegroups.com>
In reply to#172612
On Wednesday,  Pete Olcott wrote:> 
> Notice that the above question is indeed syntactically correct,
> it is only incorrect because of the semantics.


Ok the FAMOUS HALTING PROBLEM doesnt use semantics

But you need to paraphrase the RESULT of HP

rather than DISMISS IT





> 
> What I am saying here is enormously difficult to understand. I am not
> making a mistake, so please do not dismiss what I am saying out-of-hand.
> I have spent 7000 hours on this since 1997.
> 
> > 
> > If you add an extra condition like (2) then you are talking about some
> > other problem which I'll call the PO-problem.  
> 
> If the original problem did not have this requirement and (as I have shown)
> this requirement is necessary, then I have corrected the error of the original
> problem.
> 


No you have merely shown a POTENTIAL ERROR.



****** TURING MACHINES can input another TM ******* 

****** TURING MACHINES ARE ENUMERABLE ******

****** TURING MACHINES ARE DETERMINISTIC ******



*** ENUMERABLE ***

TM1
TM2
TM3
TM4
TM5
TM6
....




THE HALTING PROOF SHOWS there is no single YES/NO ALGORITHM

to PRINT EACH OF THE HALT VALUES OF TM1, TM2, TM3, ....



[ I M P O S S I B L E ]


TM1  .... [HALTS]
TM2  .... [HALTS]
TM3  .... [HALTS]
TM4  .... [NEVER HALTS]
TM5  .... [HALTS]
TM6  .... [NEVER HALTS]

....


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


#172335

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-10 09:06 -0600
Message-ID<jMidnYuO7KkVl-LHnZ2dnUU7-fWdnZ2d@giganews.com>
In reply to#172318
On 2/10/2018 2:15 AM, grahamcooper7@gmail.com wrote:
> On Saturday, February 10, 2018 at 10:19:52 AM UTC+10, Newberry wrote:
>> For every decider we can construct a "counter-example", i.e. a program
>> constructed from the decider such that it will do the opposite of what
>> the decider says. So there is no universal decider, right? Right, but
>> there is s decider that can prove that it cannot prove that the
>> counter-example halts. [It cannot prove that the counter-example does
>> not halt.] In fact I claim that there exists a decider that can
>> dichotomize the entire space of programs: either it can prove that P
>> halts on q, or it can prove that it cannot prove that P halts on q.
>>
>> I am 80% sure I am right. Prove me wrong.
> 
> 
> That's fuzzy logic!
> 
> Halt Loop Neither
> 
> 
> but TMs are ENUMERABLE and DETERMINISTIC
> 

Definition of Turing Machine H (state transition sequence)
H.q0 Wm W ⊢* H.qy
H.q0 Wm W ⊢* H.qn

Definition of Turing Machine Ĥx (state transition sequence)
Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER

H [Ĥx] [Ĥx]

It is not fuzzy logic at all the above specified evaluation sequence
is precisely defined in the language of Turing Machine Descriptions
from the initial finite strings to the syntactic logical consequence
of Ĥx.qy or Ĥx.qn.

The first few steps after qx are necessarily specified thus
Ben was wrong that they are not specified. A TM can only decide
halting on the basis of tracing what the entire state transition
sequence of the TMD would be up to the point that this TMD halts
or demonstrates non-halting behavior.

I prove that right here:
http://www.liarparadox.org/H_evaluates_S.pdf
The necessary evaluation sequence of H [S] "ENN" proves that H
must trace every single state transition of [S] up to the point
where S halts or demonstrates non halting behavior.

You have to actually carefully study what I am saying to understand
what I am saying. Simply presuming that what I am saying because you
have seen it all before will not work.

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172344

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-10 16:32 +0000
Message-ID<87sha8n695.fsf@bsb.me.uk>
In reply to#172335
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/10/2018 2:15 AM, grahamcooper7@gmail.com wrote:
>> On Saturday, February 10, 2018 at 10:19:52 AM UTC+10, Newberry wrote:
>>> For every decider we can construct a "counter-example", i.e. a program
>>> constructed from the decider such that it will do the opposite of what
>>> the decider says. So there is no universal decider, right? Right, but
>>> there is s decider that can prove that it cannot prove that the
>>> counter-example halts. [It cannot prove that the counter-example does
>>> not halt.] In fact I claim that there exists a decider that can
>>> dichotomize the entire space of programs: either it can prove that P
>>> halts on q, or it can prove that it cannot prove that P halts on q.
>>>
>>> I am 80% sure I am right. Prove me wrong.
>>
>>
>> That's fuzzy logic!
>>
>> Halt Loop Neither
>>
>>
>> but TMs are ENUMERABLE and DETERMINISTIC
>>
>
> Definition of Turing Machine H (state transition sequence)
> H.q0 Wm W ⊢* H.qy
> H.q0 Wm W ⊢* H.qn

This is not a definition of TM.  And without extra annotation it is not
even a specification for what H should do.  How may times must yo ube
told?  The notation is not hard and you are using in key places so you
keep saying things you don't mean to say.

> Definition of Turing Machine Ĥx (state transition sequence)
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER
>
> H [Ĥx] [Ĥx]

I will take you literally from now on, since you have not taken my
advice to learn the notation and to specify the actual behaviour of H.

> It is not fuzzy logic at all the above specified evaluation sequence
> is precisely defined in the language of Turing Machine Descriptions
> from the initial finite strings to the syntactic logical consequence
> of Ĥx.qy or Ĥx.qn.

Indeed.  It is precisely defined by a definition you know (almost)
nothing about.  Almost anything you now go on to say about any machine
in the H class actually does will be wrong.

> The first few steps after qx are necessarily specified thus
> Ben was wrong that they are not specified.

You lie again.  Please quote me where I say that (if I did, I want to
correct the record).

I said you don't know what any machine in the H class actually does or
how it does it.  For any one machine in that class, something defines
what and how it behaves but you don't know (and there may be infinitely
many possibilities).  I suspect this is linked to the nonsense above
where you say that the notation you are misusing defines TM.

> A TM can only decide
> halting on the basis of tracing what the entire state transition
> sequence of the TMD would be up to the point that this TMD halts
> or demonstrates non-halting behavior.

If this is a metaphor (and you've hedged your bets here by saying that
the decider need not actually simulate the trace) then you are just
saying that a decider must make the correct decision -- by working out,
somehow, what then execution trace would be.  It must transition to qy
or qn based on what the input TM would do, and that is all.  But so
what?  We all knew that from the start.

Oddly, having said that it need not actually simulate the trace you then
deny the one thing you /do/ know that it does -- transition to qy or qn.
You manage to pack an extraordinary density of mistakes into very short
posts.

> I prove that right here:
> http://www.liarparadox.org/H_evaluates_S.pdf
> The necessary evaluation sequence of H [S] "ENN" proves that H
> must trace every single state transition of [S] up to the point
> where S halts or demonstrates non halting behavior.

You have proved nothing here.  Sadly, the web allows any old rubbish to
be published unchallenged, but with luck, hapless students who might
find you writings know that.  At least on the blog, the errors don't
bother me.

By the way, do you have permission to copy the illustrations form Linz's
book, or is it's covered by fair use?  At least one post seemed to be
using them.

> You have to actually carefully study what I am saying to understand
> what I am saying. Simply presuming that what I am saying because you
> have seen it all before will not work.

Yes.  Something we agree on.

-- 
Ben.

[toc] | [prev] | [standalone]


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

Back to top | Article view | sci.logic


csiph-web