From: mikko.levanto@iki.fi   
      
   On 19/01/2026 17:00, Tristan Wibberley wrote:   
   > On 19/01/2026 08:19, Mikko wrote:   
   >> But the syntactic incompleteness is still there. Both G and ¬G are   
   >> well-formed formulas of Peano arithmetic but neither is provable.   
   >> The well-formed formula G ∨ ¬G is provable, and so is G → G.   
   >   
   > whose "or" operator are you talking about?   
      
   The symbol ∨ above is a connective of ordinary logic.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)