XPost: comp.theory, sci.math, sci.lang   
   XPost: comp.lang.prolog   
   From: mikko.levanto@iki.fi   
      
   On 06/02/2026 17:30, olcott wrote:   
   > 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 theories where every sentence is provable but it is not   
   possiible to interprete any theory so that every sentence is true.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)