Many current algebra systems have a lax attitude to the simplification of expressions involving functions like log and √, leading to the ability to “prove” equalities like −1=1 in such systems. In fact, only a little elementary arithmetic is needed to devise what the correct simplifications should be. We detail some of these simplification rules, and outline a method for their incorporation into an algebra system.
|Title of host publication||Design and Implementation of Symbolic Computation Systems |
|Subtitle of host publication||International Symposium, DISCO '92 Bath, U.K., April 13–15, 1992 Proceedings|
|Number of pages||9|
|Publication status||Published - 1993|
|Name||Lecture Notes in Computer Science|