XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/31/2025 3:16 PM, Pierre Asselin wrote:   
   > In sci.logic Tristan Wibberley  wrote:   
   >   
   >> [ ... ]   
   >> Then he defines a new system "P" which he uses to get even more muddled,   
   >> leaves out the crucial elements of his proof because it's too easy to   
   >> get wrong,   
   >   
   > Gödel, muddled? He was the most meticulous sonovabitch that ever   
   > lived!   
   >   
   >   
   >> and Stephen Meyer says he does get it wrong; he seems to be   
   >> the only person in the world that ever checked.   
   >   
   > People have misunderstood Gödel and proved it by their comments.   
   > I don't know who Stephen Meyer is; my money is on Gödel.   
   >   
      
   Gödel proved that there cannot possibly exist any   
   sequence of inference steps in F prove that they   
   themselves do not exist.   
      
   He admitted this himself:   
   ...We are therefore confronted with a proposition   
   which asserts its own unprovability. 15 … (Gödel 1931:40-41)   
      
   Gödel, Kurt 1931.   
   On Formally Undecidable Propositions of   
   Principia Mathematica And Related Systems   
      
      
   --   
   Copyright 2025 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-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)