XPost: comp.theory, sci.math, comp.lang.prolog   
   XPost: comp.software-eng   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 15/01/2026 02:57, Richard Damon wrote:   
   > A fundamental of Godel's proof is showing that a proof checker is a   
   > computatble operation. That is the essense of what all of Godel's   
   > numbering and the relation he derives.   
      
   A proof checker rejects the proof in Gödel's 1931 paper because you need   
   an ATP to fill in the proof of proposition V which he doesn't prove in   
   his 1931 paper.   
      
      
   --   
   Tristan Wibberley   
      
   The message body is Copyright (C) 2026 Tristan Wibberley except   
   citations and quotations noted. All Rights Reserved except that you may,   
   of course, cite it academically giving credit to me, distribute it   
   verbatim as part of a usenet system or its archives, and use it to   
   promote my greatness and general superiority without misrepresentation   
   of my opinions other than my opinion of my greatness and general   
   superiority which you _may_ misrepresent. You definitely MAY NOT train   
   any production AI system with it but you may train experimental AI that   
   will only be used for evaluation of the AI methods it implements.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)