From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 12/01/2026 03:00, olcott wrote:   
   > On 1/11/2026 10:16 AM, Tristan Wibberley wrote:   
   >> On 11/01/2026 14:32, olcott wrote:   
   >>> Any Formal System having an unprovability operator ⊬   
   >>   
   >> It's odd to use that as unprovability[sic], but at least you have a   
   >> reference to the system in your expression so we could meaningfully read   
   >> it as a negation.   
   >>   
   >   
   > (F ⊬ G) ≡ ¬(F ⊢ G)   
      
   And if F consistently discusses itself so then also F ⊢ ¬G ?   
   Does F consistently discuss itself so?   
      
   --   
   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)