XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 1/3/2026 11:35 AM, Tristan Wibberley wrote:   
   > On 02/01/2026 16:06, Richard Damon wrote:   
   >>> You have to derive the statement from the axioms of the system using the   
   >>> deduction rules of the system. It's the actual definition of "Theorem of   
   >>> a Formal System".   
   >>   
   >> And the statement G was.   
   >   
   > Then a system can be complete.   
   >   
   >   
      
   If G is a theorem of F and G asserts its   
   own unprovability in F then a sequence   
   of inferences steps exist in F that   
   prove that they themselves do not exist.   
      
   --   
   Copyright 2026 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-DOS v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)