Reasoning about the Elementary Functions of Complex Analysis

Authors:
Robert M. Corless;James H. Davenport;David J. Jeffrey;Gurjeet Litt;Stephen M. Watt
Affiliations:
-;-;-;-;-
Venue:
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Year:
2000

Citing 5
Cited 2

The unwinding number

ACM SIGSAM Bulletin
“According to Abramowitz and Stegun” or arccoth needn't be uncouth

ACM SIGSAM Bulletin - Special issue of OpenMath
Algebraic Simplification of Multiple-Valued Functions

DISCO '92 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Common Lisp: The Language

Common Lisp: The Language
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

MKM from Book to Computer: A Case Study

MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management
The Wright omega Function

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding number" approach to such problems, and show how it can be used to prevent errors and to systematise such simplification, even though we have not yet reduced the simplification process to a complete algorithm. The unsolved problems are probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis.