Re: Concise rebuttal of incompleteness and undecidability

Liste des GroupesRevenir à c theory 
Sujet : Re: Concise rebuttal of incompleteness and undecidability
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : sci.logic comp.theory
Date : 04. Jun 2024, 01:56:19
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v3lonj$2uv04$5@i2pn2.org>
References : 1
User-Agent : Mozilla Thunderbird
On 6/2/24 1:36 PM, olcott wrote:
Because of Quine's paper: https://www.ditext.com/quine/quine.html most
philosophers have been confused into believing that there is no such
thing as expressions of language that are {true on the basis of their
meaning}.
 The unique contribution I have made to this is that the semantic meaning
of these expressions is always specified by other expressions. When we
can derive x or ~x by applying truth preserving operations to a set of
semantic meanings then this perfectly aligns with Wittgenstein's concise
critique of Gödel: https://www.liarparadox.org/Wittgenstein.pdf
 Unless P or ~P has been proved in Russell's system P has no truth value
and thus cannot be a proposition according to the law of the excluded
middle.
 As Richard keeps pointing out:
Sometimes this "proof" may require an infinite sequence of steps.
 
WHich means it isn't a Proof, so you have an unprovable truth.
So, you seem to admit that, and that you have been wrong about your claim that truth must be provable.
Maybe your problem is you don't know what a proof actually is, which explains why you can't actually prove anything.

Date Sujet#  Auteur
2 Jun 24 * Concise rebuttal of incompleteness and undecidability3olcott
2 Jun 24 +- Re: Concise rebuttal of incompleteness and undecidability1Richard Damon
4 Jun 24 `- Re: Concise rebuttal of incompleteness and undecidability1Richard Damon

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal