XPost: comp.theory, sci.math, sci.lang   
   XPost: comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   ...there is also a close relationship with the “liar” antinomy,14 ...   
   ...14 Every epistemological antinomy can likewise be   
   used for a similar undecidability proof...(Gödel 1931:40)   
      
   This last sentence does mean that the liar antinomy   
   can be used for for a similar undecidability proof.   
      
   This does mean that the essence of all of his complex   
   machinery can be boiled down to the Liar Paradox.   
      
   Why is it that no one has understood this simple   
   truth in more than 90 years.   
      
   Gödel, Kurt 1931.   
   On Formally Undecidable Propositions of   
   Principia Mathematica And Related Systems   
      
   https://jamesrmeyer.com/ffgit/godel-original-english   
      
   --   
   Copyright 2026 Olcott

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

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