XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 2/12/2026 1:10 PM, Tristan Wibberley wrote:   
   > On 11/02/2026 23:30, André G. Isaak wrote:   
   >> Please quote someone working on PTS who claims that ∀x (~Provable(T, x)   
   >> ⇔ Meaningless(T, x))   
   >   
   > Depends on the meaning of "Provable" and of "Meaningless". We don't even   
   > know what objects the system has for quantification, he says it's a   
   > syntactical system but I'm starting to think that only has meaning as a   
   > specific sort of abstract formal system (semantical, technically).   
   >   
      
   We completely replace the foundation of Truth Conditional   
   Semantics with Proof Theoretic Semantics (PTS). Then   
   expressions are "true on the basis of meaning expressed   
   in language" only to the extent that all their meaning   
   comes from inferential relations to other expressions of   
   that language. This is the purely linguistic PTS notion   
   of truth having no connections outside the inferential system.   
      
   Expressions of language of formal system L only have   
   PTS meaning in L the exact same way that a word only   
   has meaning in a dictionary when that word is in that   
   dictionary.   
      
      
   --   
   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)