Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail From: Keith Thompson Newsgroups: comp.theory,comp.ai.philosophy,comp.ai.nat-lang,sci.lang.semantics Subject: Re: Simply defining =?utf-8?Q?G=C3=B6del?= Incompleteness and Tarski Undefinability away V24 (Are we there yet?) Date: Mon, 13 Jul 2020 17:46:28 -0700 Organization: None to speak of Lines: 18 Message-ID: <871rle53ff.fsf@nosuchdomain.example.com> References: <2tCdnb0urbddzpfCnZ2dnUU7-b_NnZ2d@giganews.com> <87k0z85tt0.fsf@nosuchdomain.example.com> <87d0505kmk.fsf@nosuchdomain.example.com> <5Lmdnehh4P6hLZbCnZ2dnUU7-LdQAAAA@giganews.com> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 8bit Injection-Info: reader02.eternal-september.org; posting-host="4502a91299fcc6f473e7c6cd344f8c9a"; logging-data="9237"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19y6xTU2ws5mxboDczuMpvK" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/26.3 (gnu/linux) Cancel-Lock: sha1:VKIURTu/CXImUQDO3gDtEN6acHA= sha1:STxoCvRLhelUETBtH+l/skgCTFQ= Xref: csiph.com comp.theory:21635 comp.ai.philosophy:21966 comp.ai.nat-lang:2373 olcott writes: [...] > The single-minded focus of all of these last ten or more threads is > how there can be a sentence that is true in a formal system and not > provable in this same a formal system. > > I know it is impossible because: an expression of the language of a > formal system that has no mapping in this formal system to Boolean > values has no possible way to be true or false IN THIS SYSTEM. Gödel proved otherwise. Redefining terms doesn't change that. [...] -- Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com Working, but not speaking, for Philips Healthcare void Void(void) { Void(); } /* The recursive call of the void */