Deutsch English Français Italiano |
<vphd7l$10pa2$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Mikko <mikko.levanto@iki.fi> Newsgroups: sci.logic Subject: Re: Mathematical incompleteness has always been a misconception --- Ultimate Foundation of True(L,x) Date: Mon, 24 Feb 2025 11:13:25 +0200 Organization: - Lines: 70 Message-ID: <vphd7l$10pa2$1@dont-email.me> References: <vnh0sq$35mcm$1@dont-email.me> <vni4ta$3ek8m$1@dont-email.me> <vnikre$3hb19$1@dont-email.me> <vnkov9$1971$1@dont-email.me> <vnl9vj$4f8i$1@dont-email.me> <vnndqs$kef3$1@dont-email.me> <vnpd96$vl84$1@dont-email.me> <vnqm3p$1apip$1@dont-email.me> <vnqsbh$1c5sq$1@dont-email.me> <vnsm90$1pr86$1@dont-email.me> <vnte6s$1tra8$1@dont-email.me> <vnv4tf$2a43e$1@dont-email.me> <vo0249$2eqdl$1@dont-email.me> <vo1qae$2s4cr$1@dont-email.me> <vo2i10$302f0$1@dont-email.me> <vo4nj4$3f6so$1@dont-email.me> <vo5btf$3ipo2$1@dont-email.me> <vo7ckh$q2p$1@dont-email.me> <vo7tdg$36ra$6@dont-email.me> <voa09t$idij$1@dont-email.me> <7e532aaf77653daac5ca2b70bf26d0a3bc515abf@i2pn2.org> <voceuj$14r1q$1@dont-email.me> <vocp21$16c4e$1@dont-email.me> <vof6hb$1nh1f$1@dont-email.me> <voflif$1q1mh$2@dont-email.me> <vohsmu$29krm$1@dont-email.me> <vp10ic$1e7iv$2@dont-email.me> <vp6qjb$2ousc$1@dont-email.me> <vpb1le$3jct4$13@dont-email.me> <vpc4pk$3sob8$1@dont-email.me> <vpd4tk$2q85$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 24 Feb 2025 10:13:25 +0100 (CET) Injection-Info: dont-email.me; posting-host="b8f19db9a2f6094dff4fec67edf03810"; logging-data="1074498"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18YR/JXQnwtDE4xO+WdSNul" User-Agent: Unison/2.2 Cancel-Lock: sha1:q7CLOuzv0mtvNXnmgqHNNe29nnE= On 2025-02-22 18:27:00 +0000, olcott said: > On 2/22/2025 3:18 AM, Mikko wrote: >> On 2025-02-21 23:19:10 +0000, olcott said: >> >>> On 2/20/2025 2:54 AM, Mikko wrote: >>>> On 2025-02-18 03:59:08 +0000, olcott said: >>>> >>>>> On 2/12/2025 4:21 AM, Mikko wrote: >>>>>> On 2025-02-11 14:07:11 +0000, olcott said: >>>>>> >>>>>>> On 2/11/2025 3:50 AM, Mikko wrote: >>>>>>>> On 2025-02-10 11:48:16 +0000, olcott said: >>>>>>>> >>>>>>>>> On 2/10/2025 2:55 AM, Mikko wrote: >>>>>>>>>> On 2025-02-09 13:10:37 +0000, Richard Damon said: >>>>>>>>>> >>>>>>>>>>> On 2/9/25 5:33 AM, Mikko wrote: >>>>>>>>>>>> Of course, completness can be achieved if language is sufficiently >>>>>>>>>>>> restricted so that sufficiently many arithemtic truths become inexpressible. >>>>>>>>>>>> >>>>>>>>>>>> It is far from clear that a theory of that kind can express all arithmetic >>>>>>>>>>>> truths that Peano arithmetic can and avoid its incompletness. >>>>>>>>>>> >>>>>>>>>>> WHich, it seems, are the only type of logic system that Peter can understand. >>>>>>>>>>> >>>>>>>>>>> He can only think in primitive logic systems that can't reach the >>>>>>>>>>> complexity needed for the proofs he talks about, but can't see the >>>>>>>>>>> problem, as he just doesn't understand the needed concepts. >>>>>>>>>> >>>>>>>>>> That would be OK if he wouldn't try to solve problems that cannot even >>>>>>>>>> exist in those systems. >>>>>>>>> >>>>>>>>> There are no problems than cannot be solved in a system >>>>>>>>> that can also reject semantically incorrect expressions. >>>>>>>> >>>>>>>> The topic of the discussion is completeness. Is there a complete system >>>>>>>> that can solve all solvable problems? >>>>>>> >>>>>>> When the essence of the change is to simply reject expressions >>>>>>> that specify semantic nonsense there is no reduction in the >>>>>>> expressive power of such a system. >>>>>> >>>>>> The essence of the change is not sufficient to determine that. >>>>> >>>>> In the same way that 3 > 2 is stipulated the essence of the >>>>> change is that semantically incorrect expressions are rejected. >>>>> Disagreeing with this is the same as disagreeing that 3 > 2. >>>> >>>> That 3 > 2 need not be (and therefore usually isn't) stripualted. >>> >>> The defintion of the set of natural numbers stipulates this. > > If NOTHING ever stipulates that 3 > 2 then NO ONE can > possibly know that 3 > 2 leaving the finite string > "3 > 2" merely random gibberish. A formal language of a theory of natural numbers needn't define "2" or "3". Those concepts can be expressed as "1+1" and "1+1+1" or as "SS0" and "SSS0" depending on which symbols the language has. It is not possible to stipulate separately for every pair of natural numbers whether the first one is grater than the second one. Instead, a theory of natural numbers may have postulates that permit the proofs of all true claims about the order of two natural numbers but no proof of a false claim. -- Mikko