Deutsch   English   Français   Italiano  
<veota3$2baph$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!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: sci.logic
Subject: Re: A different perspective on undecidability
Date: Wed, 16 Oct 2024 12:31:47 -0500
Organization: A noiseless patient Spider
Lines: 23
Message-ID: <veota3$2baph$1@dont-email.me>
References: <veoift$29dtl$2@dont-email.me> <veoq3j$2aqp2$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 16 Oct 2024 19:31:48 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="f097d53e4abea8ea9babea4b430282e3";
	logging-data="2468657"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/NiAFUNLy6YWlRdBwEIS0r"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:QB5N8kP1OzgU8xAZd6v2GVr2hMA=
In-Reply-To: <veoq3j$2aqp2$1@dont-email.me>
Content-Language: en-US
Bytes: 1840

On 10/16/2024 11:37 AM, Mikko wrote:
> On 2024-10-16 14:27:09 +0000, olcott said:
> 
>> The whole notion of undecidability is anchored in ignoring the fact that
>> some expressions of language are simply not truth bearers.
> 
> A formal theory is undecidable if there is no Turing machine that
> determines whether a formula of that theory is a theorem of that
> theory or not. 

When the question: Is finite string X a theory of L?
has no correct answer from YES and NO, then the question
is rejected as not a truth bearer.

> Whether an expression is a truth bearer is not
> relevant. Either there is a valid proof of that formula or there
> is not. No third possibility.
> 


-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer