Re: A different perspective on undecidability

Liste des GroupesRevenir à c theory 
Sujet : Re: A different perspective on undecidability
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : sci.logic
Date : 16. Oct 2024, 17:37:07
Autres entêtes
Organisation : -
Message-ID : <veoq3j$2aqp2$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
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. 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.
--
Mikko

Date Sujet#  Auteur
15 Apr 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal