Algebraic simplification of multiple-valued functions

  • Russell Bradford
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 721)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W Kahan. The Interface between Symbolic and Numberic Computation. seminar notes, IBM Oberlech, Austria, July 1991.Google Scholar
  2. 2.
    David R Stoutemyer. Crimes and Misdemeanors in the Computer Algebra Trade. Notices of the AMS, 38(7):778–785, September 1991.Google Scholar
  3. 3.
    Trudy Weibel and G H Gonnet. An Algebra of Properties. Technical Report 157, ETH Zürich, Institut für Wissenschaftliches Rechnen, ETH-Zentrum, CH-8092, Zürich, Switzerland, April 1991.Google Scholar
  4. 4.
    Trudy Weibel and G H Gonnet. An Algebra of Properties. In Stephen M Watt, editor, Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC 91), pages 352–359. ACM Press, July 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Russell Bradford
    • 1
  1. 1.School of Mathematical SciencesUniversity of BathBath

Personalised recommendations