Algebraic simplification of multiple-valued functions

Russell Bradford

doi:10.1007/3-540-57272-4_20

Algebraic simplification of multiple-valued functions

Russell Bradford

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

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.

Original language	English
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
Publisher	Springer
Pages	13-21
Number of pages	9
ISBN (Electronic)	9783540480310
ISBN (Print)	9783540572725
DOIs	https://doi.org/10.1007/3-540-57272-4_20
Publication status	Published - 1993

Publication series

Name	Lecture Notes in Computer Science
Volume	721
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-57272-4_20

Cite this

Algebraic simplification of multiple-valued functions. / Bradford, Russell.
Design and Implementation of Symbolic Computation Systems : International Symposium, DISCO '92 Bath, U.K., April 13–15, 1992 Proceedings. Springer, 1993. p. 13-21 (Lecture Notes in Computer Science; Vol. 721).

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

@inproceedings{6a7f2264db014919ac1563741412a148,

title = "Algebraic simplification of multiple-valued functions",

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.",

author = "Russell Bradford",

year = "1993",

doi = "10.1007/3-540-57272-4_20",

language = "English",

isbn = "9783540572725",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "13--21",

booktitle = "Design and Implementation of Symbolic Computation Systems",

}

TY - GEN

T1 - Algebraic simplification of multiple-valued functions

AU - Bradford, Russell

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1007/3-540-57272-4_20

U2 - 10.1007/3-540-57272-4_20

DO - 10.1007/3-540-57272-4_20

M3 - Chapter in a published conference proceeding

SN - 9783540572725

T3 - Lecture Notes in Computer Science

SP - 13

EP - 21

BT - Design and Implementation of Symbolic Computation Systems

PB - Springer

ER -

Algebraic simplification of multiple-valued functions

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this