Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 9,468 of 10,432    |
|    asetofsymbols@gmail.com to All    |
|    Re: [Axiom] define a rule    |
|    09 Jun 17 01:13:56    |
      W:=f(g(x))       f(g(x))       Means in expression W one can identify       a sub expression g(x) that depends of x and in W there is no other       subexpression that depends from x       out the expression g(x)       and f=subst(W, g(x)=y)       If I have a expression that contain       x, x is the first possible g(x)=x       so g(x) has to be different of x       because otherwise we would obtain       The same f() in W              Yes this is perhaps too much complex              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca