XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   On 12/29/2025 11:49 PM, Tristan Wibberley wrote:   
   > On 30/12/2025 04:35, olcott wrote:   
   >   
   >> ...We are therefore confronted with a proposition   
   >> which asserts its own unprovability. 15 … (Gödel 1931:40-41)   
   >>   
   >> Correctly paraphrased as:   
   >> a sequence of inference steps from axioms   
   >> that assert that they themselves do not exist.   
   >   
   > No they don't. That's an interpretation outside the system. The axioms   
   > merely force you to conclude that some symbol or other is not negation   
   > and/or another one is not a reference to the system itself when fools   
   > think they both /are/ those things.   
   >   
   >   
      
   G := (F ⊬ G)   
   a sequence of inference steps in F from the axioms   
   of F that assert that they themselves do not exist in F.   
      
   --   
   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)