| Deutsch English Français Italiano |
|
<vqjmjr$ljre$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!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 --- Tarski Date: Sun, 9 Mar 2025 11:22:03 +0200 Organization: - Lines: 39 Message-ID: <vqjmjr$ljre$1@dont-email.me> References: <vnh0sq$35mcm$1@dont-email.me> <vplbej$25vp2$3@dont-email.me> <vpmlu5$2gca0$1@dont-email.me> <vpn98f$2jkdj$3@dont-email.me> <vps17t$3k1co$1@dont-email.me> <vptbia$3rlov$1@dont-email.me> <vpuh0e$551p$1@dont-email.me> <vpvnvr$bjn9$4@dont-email.me> <vq4gf3$1bub9$1@dont-email.me> <vq5i34$1htc6$2@dont-email.me> <401f8c0b49c2ab6bf0e8ac85de35cfb83b085002@i2pn2.org> <vq5ron$1j128$4@dont-email.me> <1bb723b96c5e9677ec64335325fb72a98d8132e0@i2pn2.org> <vq73qu$1tapm$8@dont-email.me> <3e18fe1ae9e025227818f0f094245416e72d78bc@i2pn2.org> <vq8cm2$24ijh$3@dont-email.me> <ca688ffdb960b5894f4b2b34737d5089c426e23f@i2pn2.org> <vq9msk$2ei4j$5@dont-email.me> <ca3e1fdecb23a3bb1ea84013f7a5c31df3694f86@i2pn2.org> <vqaqm1$2lgq7$4@dont-email.me> <d45b81bb724e752c014b42188cea572d60ff8c02@i2pn2.org> <vqdlhe$371bi$5@dont-email.me> <59a60b7c8170a39b7067110bb854215486d9b6e5@i2pn2.org> <vqgag9$3qol2$13@dont-email.me> <020d9dfbeb2af00cce2180483582b79e1d33286b@i2pn2.org> <vqi2fr$8e1u$9@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sun, 09 Mar 2025 10:22:05 +0100 (CET) Injection-Info: dont-email.me; posting-host="25ff0e646a062f49d12ecc759f26e035"; logging-data="708462"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+JixyGPw11JqM4OxqEzHJv" User-Agent: Unison/2.2 Cancel-Lock: sha1:AUQ+zSnydzwMcsYbn1KMUq3+cd8= Bytes: 3134 On 2025-03-08 18:32:27 +0000, olcott said: > On 3/8/2025 7:54 AM, Richard Damon wrote: >> On 3/7/25 9:36 PM, olcott wrote: >>> On 3/7/2025 6:32 AM, Richard Damon wrote: >>>> On 3/6/25 9:26 PM, olcott wrote: >>>>> On 3/6/2025 6:36 AM, Richard Damon wrote: >>>>>> On 3/5/25 7:36 PM, olcott wrote: >>>> >>>>> >>>>> ?- LP = not(true(LP)). >>>>> LP = not(true(LP)). >>>>> >>>>> ?- unify_with_occurs_check(LP, not(true(LP))). >>>>> false. >>>>> >>>> >>>> Of course, since you have admitted that your logic system is based on >>>> the FRAUD that you are allowed to change the fundamental meaning of >>>> core terms of the system, >>> >>> How the Hell does that have anything to do with the above Prolog? >>> Rambling incoherently DOES NOT COUNT AS REASONING and makes you >>> look very foolish. >>> >> >> Because your Prolog has nothing to do with the subject of the thread. > > Prolog proves that the Liar Paradox is infinitely recursive. > When it is proven that the Liar Paradox <is> infinitely > recursive then any notion of undecidability based on it is > ill-conceived. The question whther there is a well formed sentence A so that neither A nor not A is provable does not involve any infinite recursion. -- Mikko