Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.logic    |    Logic -- math, philosophy & computationa    |    262,912 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 262,618 of 262,912    |
|    Tristan Wibberley to Richard Damon    |
|    =?UTF-8?Q?Re=3A_G=C3=B6del=27s_G_has_nev    |
|    19 Jan 26 13:58:24    |
      XPost: sci.math       From: tristan.wibberley+netnews2@alumni.manchester.ac.uk              On 19/01/2026 11:49, Richard Damon wrote:              ...              > the concept of Truth being based on Provability just breaks as it       > means some things have undefinable (not just unknowable) truth values,       > they can't even be defined as not-having a truth value, as you can't        ^^^^^^^       I'm pretty sure that's not the right word.              > prove that, but you insist that truth must be provable.              Unless you're lucky enough to make a statement about them be an axiom of       the system. Then you are hoping you've defined a consistent system but       perhaps you got lucky.              Is it really true, though, that truth based on provability always breaks       so? It looks like falsity based on non-provability is the problem and       then only in conjunction with some notions of negation and maybe some       notions of conjunction too (obviously the Quine might be the problem but       we know fixed points give us Quines and vice-versa and they're so       important we don't want to lose them).              What is the negation of "go to the shop" ?       What is the negation of "is so! is not! is so! is not! ..." but "is not!       is so! is not! is so! ..."              Given positive intuitionist systems (where a system has unprovable       things that are provable in extensions) our truth predicate must leave       anything unprovable that could be an axiom of an extension as neither       true nor false but rather be inapplicable. A binary Truth predicate (at       minimum) is required to even make sense and maybe it requires a further       restriction argument (a 2nd order logic, then), which Tarski's       indefinability theorem doesn't cover, not by a long way.              --       Tristan Wibberley              The message body is Copyright (C) 2026 Tristan Wibberley except       citations and quotations noted. All Rights Reserved except that you may,       of course, cite it academically giving credit to me, distribute it       verbatim as part of a usenet system or its archives, and use it to       promote my greatness and general superiority without misrepresentation       of my opinions other than my opinion of my greatness and general       superiority which you _may_ misrepresent. You definitely MAY NOT train       any production AI system with it but you may train experimental AI that       will only be used for evaluation of the AI methods it implements.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca