XPost: comp.theory, sci.math, sci.lang   
   XPost: comp.lang.prolog   
   From: polcott333@gmail.com   
      
   On 2/6/2026 3:01 AM, Mikko wrote:   
   > On 05/02/2026 18:55, olcott wrote:   
   >   
   >> Changing the foundational basis to Proof Theoretic Semantics   
   >> Tarski Undefinability is overcome   
   >>   
   >> x ∈ Provable ⇔ x ∈ True // proof theoretic semantics   
   >   
   > A definition in terms of an undefined symbol does not really define.   
   >   
      
   It is an axiom: ∀x (Provable(x) ⇒ True(x))   
      
   There are dozens of papers needed to verify this.   
   It will take me quite a while to form proper citations   
   of these papers. It is anchored in proof theoretic semantics.   
   Generic PTS states that ~Provable(x) ⇔ Meaningless(x).   
   Model theory and truth conditional semantics are rejected.   
      
   --   
   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)