XPost: sci.math, comp.ai.philosophy, comp.theory   
   From: polcott333@gmail.com   
      
   On 1/30/2026 7:47 PM, Tristan Wibberley wrote:   
   > On 16/01/2026 04:03, olcott wrote:   
   >   
   >> It is the same ∀x ∈ T ((True(T, x) ≡ (T ⊢ x))   
   >   
   > I still think you're asking for confusion with that use of the turnstile.   
   >   
      
   I mean exactly what it says provable in the syntactic sense.   
   For all of these years the model theoretic notion of true   
   was simply totally wrong-headed.   
      
   I have my 28 years of work boiled down to about 1/2   
   page of text that five LLMs all agree would make:   
      
   "true on the basis of meaning expressed in language"   
   reliably computable for the entire body of knowledge.   
      
   > But it does make it very obvious that we should expect negation to be   
   > restricted in your system which might overcome a psychological hurdle.   
   >   
   > How is negation restricted in your system?   
   >   
      
      
   --   
   Copyright 2026 Olcott

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

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