XPost: comp.theory, alt.buddha.short.fat.guy, sci.math   
   From: mikko.levanto@iki.fi   
      
   olcott kirjoitti 6.12.2025 klo 19.00:   
      
   > As my signature line now stipulates   
   > My 28 year goal has been to make   
   > "true on the basis of meaning" computable.   
   You should first present a "proof of concept" version with very small   
   scope. For example, you could restrict to the following:   
      
   The language has, in addition to the symbols of logic with equivalence,   
   a constant symbol 1, a unary operator ', and a binary operator symbol *.   
      
   The basic truths are:   
      
   1. for every a, b, c: (a * b) * c = a * (b * c)   
   2. for every a: 1 * a = a and a * 1 = a   
   3. for every a: a * a' = 1 and a' * a = 1   
   4. for every a and b: a * b = b * a   
      
   Other truths are what can be inferred from above.   
      
   When you have solved that a good next step is to remove the basic truth   
   4. Then you can advance to systems with more functions and then to   
   systems that cover wider ranges of topics.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)