Algebraic simplification of multiple-valued functions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationDesign and Implementation of Symbolic Computation Systems
Subtitle of host publicationInternational Symposium, DISCO '92 Bath, U.K., April 13–15, 1992 Proceedings
PublisherSpringer
Pages13-21
Number of pages9
ISBN (Electronic)9783540480310
ISBN (Print)9783540572725
DOIs
Publication statusPublished - 1993

Publication series

NameLecture Notes in Computer Science
Volume721
ISSN (Print)0302-9743

Fingerprint

simplification
current algebra
algebra

Cite this

Bradford, R. (1993). Algebraic simplification of multiple-valued functions. In Design and Implementation of Symbolic Computation Systems : International Symposium, DISCO '92 Bath, U.K., April 13–15, 1992 Proceedings (pp. 13-21). (Lecture Notes in Computer Science; Vol. 721). Springer. https://doi.org/10.1007/3-540-57272-4_20

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 in Book/Report/Conference proceedingConference contribution

Bradford, R 1993, Algebraic simplification of multiple-valued functions. in Design and Implementation of Symbolic Computation Systems : International Symposium, DISCO '92 Bath, U.K., April 13–15, 1992 Proceedings. Lecture Notes in Computer Science, vol. 721, Springer, pp. 13-21. https://doi.org/10.1007/3-540-57272-4_20
Bradford R. Algebraic simplification of multiple-valued functions. In 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). https://doi.org/10.1007/3-540-57272-4_20
Bradford, Russell. / Algebraic simplification of multiple-valued functions. Design and Implementation of Symbolic Computation Systems : International Symposium, DISCO '92 Bath, U.K., April 13–15, 1992 Proceedings. Springer, 1993. pp. 13-21 (Lecture Notes in Computer Science).
@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 - Conference contribution

SN - 9783540572725

T3 - Lecture Notes in Computer Science

SP - 13

EP - 21

BT - Design and Implementation of Symbolic Computation Systems

PB - Springer

ER -