Liste des Groupes | Revenir à s logic |
On 10/16/2024 11:37 AM, Mikko wrote:As I already said:On 2024-10-16 14:27:09 +0000, olcott said:When the question: Is finite string X a theory of L?
The whole notion of undecidability is anchored in ignoring the fact thatA formal theory is undecidable if there is no Turing machine that
some expressions of language are simply not truth bearers.
determines whether a formula of that theory is a theorem of that
theory or not.
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.
Les messages affichés proviennent d'usenet.