XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   *When we analyze this one statement made in isolation*   
      
   ...We are therefore confronted with a proposition which   
   asserts its own unprovability.  … (Gödel 1931:40-41)   
      
   G asserts its own unprovability.   
      
   G asserts that there are no sequence of inference   
   steps that prove that they themselves do not exist.   
      
   Nothing can prove that itself does not exist.   
   Any such proof would be self-refuting.   
      
   Gödel, Kurt 1931.   
   On Formally Undecidable Propositions of   
   Principia Mathematica And Related Systems   
      
      
      
   --   
   Copyright 2025 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)