Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W Kahan. The Interface between Symbolic and Numberic Computation. seminar notes, IBM Oberlech, Austria, July 1991.
David R Stoutemyer. Crimes and Misdemeanors in the Computer Algebra Trade. Notices of the AMS, 38(7):778–785, September 1991.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bradford, R. (1993). Algebraic simplification of multiple-valued functions. In: Fitch, J. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1992. Lecture Notes in Computer Science, vol 721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57272-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-57272-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57272-5
Online ISBN: 978-3-540-48031-0
eBook Packages: Springer Book Archive