Well a sheep has surely more brains than RJF.   
   The reduction does the same as clasical division, when the   
   input is only from K[X], i.e. K[X1,..,Xn] with n=1.   
      
   But since RJF doesn't have any brains, he cannot   
   verify this mathematical claim. He is even not able   
   to read wiki or a book. Poor brain amputated fellow.   
      
   This could lead to an automatism in detecting elements of   
   K(X1,..,Xn)[Y1,..,Ym] from K(X1,..,Xn,Y1,..,Ym), so maybe   
   we can completely get rid of any domain parameters.   
      
   Not yet sure, didn't start the now projected classical   
   Euclid GCD thingy yet. Passing around domains, or even having   
   a type system for domains, sounds anyway a   
      
   little bit relict to me. My Prototype uses on purpose a   
   typeless language, i.e. Prolog, the only thing I added was   
   single dispatch. You find typing hell for example in products   
   such as:   
      
   http://commons.apache.org/proper/commons-math/javadocs/api-3.6.1   
   org/apache/commons/math3/FieldElement.html   
      
   The typing hell is mitigated, you can use super classes,   
   but nevertheless its kind of annoying sometimes, and the   
   documentation effect of super classes, can also be used   
      
   in my single dispatch modules as classes.   
      
   Am Dienstag, 11. Juli 2017 22:48:39 UTC+2 schrieb burs...@gmail.com:   
   > > Here is an example by RJF done in GB for GCD.   
   > > RJF claims that GB doesnt have division. Well   
   > > it has of course, its called reduction.   
   >   
   > Reminds me of an old riddle.   
   > How many legs does a sheep have, if you call   
   > its tail a leg?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)