XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   A system such all semantic meaning of the formal   
   system is directly encoded in the syntax of the   
   formal language of the formal system making   
   ∀x ∈ L (Provable(L,x) ≡ True(L,x))   
      
   "true on the basis of meaning expressed in language"   
   is reliably computable by the above formalism.   
      
   I have thought this through for 30,000 hours over   
   28 years.   
      
      
   --   
   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)