Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: Keith Thompson <Keith.S.Thompson+u@gmail.com>
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: Tue, 14 Jul 2020 09:53:33 -0700
Organization: None to speak of
Lines: 25
Message-ID: <874kqa2g36.fsf@nosuchdomain.example.com>
References: <u8KdneInk71rAp_CnZ2dnUU7-bPNnZ2d@giganews.com> <rea6hg$m4j$1@dont-email.me> <sLGdnelhK8QZP5XCnZ2dnUU7-c_NnZ2d@giganews.com> <rea8ev$2re$1@dont-email.me> <RrydndCJKL46MJXCnZ2dnUU7-dvNnZ2d@giganews.com> <fweo8onfcyl.fsf@foxtrot.inf.ed.ac.uk> <wOOdncmMTradKJXCnZ2dnUU7-dvNnZ2d@giganews.com> <fweo8om8f9h.fsf@foxtrot.inf.ed.ac.uk> <2tCdnb0urbddzpfCnZ2dnUU7-b_NnZ2d@giganews.com> <fwek0z8c20b.fsf@foxtrot.inf.ed.ac.uk> <ZradnRnxvITXyJbCnZ2dnUU7-SXNnZ2d@giganews.com> <87k0z85tt0.fsf@nosuchdomain.example.com> <DsydnePpnqLQPJbCnZ2dnUU7-e_NnZ2d@giganews.com> <87d0505kmk.fsf@nosuchdomain.example.com> <5Lmdnehh4P6hLZbCnZ2dnUU7-LdQAAAA@giganews.com> <fwezh83boxw.fsf@foxtrot.inf.ed.ac.uk> <kZ-dnXdGw7oC5ZHCnZ2dnUU7-f_NnZ2d@giganews.com> <fweh7ubck7y.fsf@foxtrot.inf.ed.ac.uk> <h9qdnV2508rMcpHCnZ2dnUU7-bfNnZ2d@giganews.com> <871rle53ff.fsf@nosuchdomain.example.com> <cpydnUOtwvl7X5DCnZ2dnUU7-bednZ2d@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="2398"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+2lmBw3dA4Je6F/ASa+tkX"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/26.3 (gnu/linux)
Cancel-Lock: sha1:ruAQjlmFmaOi3Bv/dTjX1sk/73g= sha1:Ql9D4VNTJvhHlqCLC3QlQOdNano=
Xref: csiph.com comp.theory:21662 comp.ai.philosophy:22003 comp.ai.nat-lang:2397

olcott <NoOne@NoWhere.com> writes:
> On 7/13/2020 7:46 PM, Keith Thompson wrote:
>> olcott <NoOne@NoWhere.com> 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.
>>
>> [...]
>
> In other words you are claiming that an undecidable sentence has been
> decided to be true.

No.

-- 
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 */