Deutsch English Français Italiano |
<v7p499$8bb2$5@solani.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!feeds.phibee-telecom.net!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Mild Shock <janburse@fastmail.fm> Newsgroups: comp.theory,sci.logic Subject: =?UTF-8?Q?Re:_G=c3=b6del's_Basic_Logic_Course_at_Notre_Dame_=28Was:?= =?UTF-8?Q?_Analytic_Truth-makers=29?= Date: Tue, 23 Jul 2024 22:36:59 +0200 Message-ID: <v7p499$8bb2$5@solani.org> References: <v7m26d$nrr4$1@dont-email.me> <e41a2d324173031e1fe47acc0fd69b94b7aba55e@i2pn2.org> <v7msg0$sepk$1@dont-email.me> <3fb77583036a3c8b0db4b77610fb4bf4214c9c23@i2pn2.org> <v7much$sepk$2@dont-email.me> <9577ce80fd6c8a3d5dc37b880ce35a4d10d12a0e@i2pn2.org> <v7n3ho$t590$1@dont-email.me> <7d9b88425623e1166e358f1bce4c3a2767c36da0@i2pn2.org> <v7naae$120r5$1@dont-email.me> <v7o64d$7r0l$1@solani.org> <v7ogdr$17h8r$9@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 23 Jul 2024 20:36:57 -0000 (UTC) Injection-Info: solani.org; logging-data="273762"; mail-complaints-to="abuse@news.solani.org" User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Firefox/91.0 SeaMonkey/2.53.18.2 Cancel-Lock: sha1:Lbzm58Nl7mMokLOuAlMdC6PROPo= X-User-ID: eJwNyMEBwCAIA8CVEEjQcbDA/iPU5x2Mi184Qcdg/K7uYPquc+D4yO2y0uz1aIyk1oMmpEu1BNFGgJJOuT9DDhTJ In-Reply-To: <v7ogdr$17h8r$9@dont-email.me> Bytes: 2591 Lines: 38 Thats a little bit odd to abolish incompletness. Take p, an arbitrary propositional variable. Its neither the case that: True(L,p) Nor is ihe case that: True(L,~p) Because there are always at least two possible worlds. One possible world where p is false, making True(L,p) impossible, and one possible world where p is true, making True(L,~p) impossible. olcott schrieb: > On 7/23/2024 7:02 AM, Mild Shock wrote: >> Little bit odd reference to mathematical logic for 2024. >> >> olcott schrieb: >>>>> Curry, Harkell B. 1977. Foundations of Mathematical Logic. Page:45 > > https://www.liarparadox.org/Haskell_Curry_45.pdf > > *It sustains this idea* > > L is the language of a formal mathematical system. > x is an expression of that language. > > When we understand that True(L,x) means that there is a finite > sequence of truth preserving operations in L from the semantic > meaning of x to x in L, then mathematical incompleteness is abolished. > > ~True(L,x) ∧ ~True(L,~x) > means that x is not a truth-bearer in L. > It does not mean that L is incomplete >