Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Newsgroups | sci.logic, sci.math, comp.theory |
| Subject | Re: ALL undecidability is unmasked |
| Date | 2026-07-14 16:14 -0500 |
| Organization | A noiseless patient Spider |
| Message-ID | <11368r6$n1a7$2@dont-email.me> (permalink) |
| References | (3 earlier) <11363pu$gibk$3@dont-email.me> <11364j6$ljud$3@dont-email.me> <113669l$gibk$5@dont-email.me> <11366vd$md0b$2@dont-email.me> <11368c4$gibk$7@dont-email.me> |
Cross-posted to 3 groups.
On 7/14/2026 4:06 PM, André G. Isaak wrote: > On 2026-07-14 14:42, olcott wrote: >> On 7/14/2026 3:30 PM, André G. Isaak wrote: >>> On 2026-07-14 14:01, olcott wrote: >>>> On 7/14/2026 2:48 PM, André G. Isaak wrote: >>>>> On 2026-07-14 13:41, olcott wrote: >>>>>> On 7/14/2026 4:12 AM, Mikko wrote: >>>>>>> On 13/07/2026 18:46, olcott wrote: >>>>>>>> All undecidability is unmasked as semantic >>>>>>>> incoherence or outside of the body of knowledge. >>>>>>> >>>>>>> Gödel's sentence is true about natural numbers. >>>>>> >>>>>> That stays the same in my system yet in my system >>>>>> undecidability and incompleteness cannot possibly exist. >>>>>> >>>>>> P ⊢ Q means syntactic derivation implements semantic >>>>>> entailment encoded in syntactically the language. This >>>>>> is the only inference steps allowed. >>>>>> >>>>>> PA ⊢ G is simply false. >>>>> >>>>> That was the whole *point* of Gödel’s theorem. He demonstrated that >>>>> his G could not be proven from the axioms of PA. Nor could ¬G be >>>>> proven from the axioms of PA. So it's really unclear what you are >>>>> trying to say. >>>>> >>>>> If that 'stay the same', as you say, then that simply confirms that >>>>> PA is incomplete. >>>>> >>>>> André >>>>> >>>> >>>> My system has zero undecidability and zero incompleteness. >>>> >>>> P ⊢ Q means syntactic derivation implements semantic >>>> entailment encoded in syntactically the language. This >>>> is the only inference steps allowed. >>>> >>>> PA ⊢ G is simply false. >>> >>> You say your system has 'zero incompleteness'. Since you admit that >>> PA ⊢ G is false are you now claiming that PA ⊢ ¬G is true? >> >> PA does not says shit about any of that. > > No, but Gödel's proof does. > >>> Because that is what would be required to get rid of incompleteness >>> and yet Gödel rather clearly shows that PA *cannot* show that –G is >>> true. >>> >>> André >>> >> >> THIS SYSTEM MAKES UNDECIDABILITY AND INCOMPLETENESS IMPOSSIBLE >> P <semantically entails> Q means syntactic derivation >> implements semantic entailment encoded in syntactically >> the language. This is the only inference steps allowed. > > How does that follow? If P does not semantically entail Q and P also > does not semantically entail ¬Q, then the system is incomplete. Your use > of the term 'semantically entails' rather than proves has no bearing on > this. > > André > "sfsdf [pem,e35rty 456456" Is that "undecidable" or just plain nonsense? It is not provable or refutable on PA. -- Copyright 2026 Olcott My 28 year goal has been to make "true on the basis of meaning expressed in language" reliably computable for the entire body of general knowledge. The complete structure of this system is now defined. The entire body of knowledge expressed in language is comprised of two types of relations between finite strings: (a) *Axioms* Expressions of language that are stipulated to be true. My system bridges the analytic/synthetic distinction by expressly encoding all empirical "atomic facts" in a formal language such as CycL of the Cyc project. (b) *Inference Rules* Expressions of language that are semantically entailed syntactically from (a) and/or (b).
Back to sci.math | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-13 10:46 -0500
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-14 10:11 +0300
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-14 13:18 -0500
Re: ALL undecidability is unmasked "Fred. Zwarts" <F.Zwarts@HetNet.nl> - 2026-07-15 11:11 +0200
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-15 09:56 -0500
Re: ALL undecidability is unmasked "Fred. Zwarts" <F.Zwarts@HetNet.nl> - 2026-07-16 11:01 +0200
Re: ALL undecidability is unmasked "Fred. Zwarts" <F.Zwarts@HetNet.nl> - 2026-07-18 12:02 +0200
Re: ALL undecidability is unmasked Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2026-07-18 20:07 +0100
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-14 12:12 +0300
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-14 14:41 -0500
Re: ALL undecidability is unmasked André G. Isaak <agisaak@gm.invalid> - 2026-07-14 13:48 -0600
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-14 15:01 -0500
Re: ALL undecidability is unmasked André G. Isaak <agisaak@gm.invalid> - 2026-07-14 14:30 -0600
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-14 15:42 -0500
Re: ALL undecidability is unmasked André G. Isaak <agisaak@gm.invalid> - 2026-07-14 15:06 -0600
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-14 16:14 -0500
Re: ALL undecidability is unmasked André G. Isaak <agisaak@gm.invalid> - 2026-07-14 15:34 -0600
Re: ALL undecidability is unmasked Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-07-18 13:48 +0100
Re: ALL undecidability is unmasked Alan Mackenzie <acm@muc.de> - 2026-07-14 19:57 +0000
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-14 15:16 -0500
Re: ALL undecidability is unmasked dbush <dbush.mobile@gmail.com> - 2026-07-14 16:18 -0400
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-15 10:35 +0300
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-15 10:31 -0500
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-16 12:16 +0300
Re: ALL undecidability is unmasked Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-07-18 14:17 +0100
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-15 10:25 +0300
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-15 10:14 -0500
Re: ALL undecidability is unmasked Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-07-15 20:18 +0100
Re: ALL undecidability is unmasked olcott <polcott333@gmail.com> - 2026-07-15 14:44 -0500
Re: ALL undecidability is unmasked Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-07-18 19:21 +0100
Re: ALL undecidability is unmasked Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-07-18 19:21 +0100
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-16 09:11 +0300
Re: ALL undecidability is unmasked dbush <dbush.mobile@gmail.com> - 2026-07-15 15:24 -0400
Re: ALL undecidability is unmasked Mikko <mikko.levanto@iki.fi> - 2026-07-16 12:23 +0300
csiph-web