Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | sci.logic, comp.theory |
| Subject | Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory |
| Date | 2017-10-24 01:36 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <87inf5idp3.fsf@bsb.me.uk> (permalink) |
| References | <zdOdnWPlyNtVd3HEnZ2dnUU7-UWdnZ2d@giganews.com> <eda75d70-8fd0-4573-9609-65f044b598dc@googlegroups.com> <f71a62df-983c-47b0-b1f9-020a890e7894@googlegroups.com> <87zi8hipzj.fsf@bsb.me.uk> <UoCdne51A-l3zHPEnZ2dnUU7-TXNnZ2d@giganews.com> |
Cross-posted to 2 groups.
Pete Olcott <Pete@NoEmail.address> writes: > On 10/23/2017 3:11 PM, Ben Bacarisse wrote: >> peteolcott <peterolcott2@gmail.com> writes: >> >>> On Monday, October 23, 2017 at 11:06:06 AM UTC-5, Charlie-Boo wrote: >> <snip> >>>> Truth is not recursively enumerable. >> <snip> >>> Prolog is able to express Truth in a recursively enumerable way. >> >> Prolog has no choice -- that's the best is can do. However, the set of >> true sentences of any interesting axiomatic system is not an R.E. set. >> > > https://en.wikipedia.org/wiki/Recursively_enumerable_set > Your statement depends upon the assumption that the Halting Problem > proof is correct? No. I don't know which proof you are thinking of but it's correctness or otherwise has no bearing on the validity of the statement it may or may not prove. -- Ben.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Charlie-Boo <shymathguy@gmail.com> - 2017-10-23 09:06 -0700
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory peteolcott <peterolcott2@gmail.com> - 2017-10-23 09:42 -0700
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-23 21:11 +0100
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Pete Olcott <Pete@NoEmail.address> - 2017-10-23 15:32 -0500
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-24 01:36 +0100
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Pete Olcott <Pete@NoEmail.address> - 2017-10-23 20:49 -0500
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-24 12:01 +0100
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Pete Olcott <Pete@NoEmail.address> - 2017-10-24 08:43 -0500
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-25 02:33 +0100
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Pete Olcott <Pete@NoEmail.address> - 2017-10-27 10:49 -0500
Re: Gödel’s 1931 Incompleteness Theorem summed as a single line of Minimal Type Theory Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-27 21:50 +0100
csiph-web