XPost: comp.theory, sci.math, sci.math.symbolic   
   XPost: comp.lang.prolog, comp.software-eng   
   From: polcott333@gmail.com   
      
   We completely replace the foundation of truth conditional   
   semantics with proof theoretic semantics. 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 a purely linguistic PTS notion of truth with no   
   connections outside the inferential system.   
      
   Well-founded proof-theoretic semantics reject expressions   
   lacking a "well-founded justification tree" as meaningless.   
   ∀x (~Provable(T, x) ⇔ Meaningless(T, x))   
      
   --   
   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)