XPost: sci.math   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 11/01/2026 12:37, Richard Damon wrote:   
   > The transformed statement is: This sentence is true if and only if it is   
   > not provable.   
   >   
   > That transformed statement is NOT a contradiction, and in addition to   
   > possibly not being a truth-bearer, could also be a True statement, that   
   > just was not provable.   
      
      
   How does he make it that "true" doesn't mean the same as "provable"   
   without also introducing a contradiction and how can it be shown that a   
   contradiction is not introduced by that method?   
      
   --   
   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)