- Shopping Bag ( 0 items )
This book is a collection of essays centred around the subject of mathematical mechanization. It tries to deal with mathematics in a constructive and algorithmic manner so that reasoning becomes mechanical, automated and less laborious.
The book is divided into three parts. Part I concerns historical developments of mathematics mechanization, especially in ancient China. Part II describes the underlying principles of polynomial equation-solving, with polynomial coefficients in fields restricted to the case of characteristic 0. Based on the general principle, some methods of solving such arbitrary polynomial systems may be found. This part also goes back to classical Chinese mathematics as well as treating modern works in this field. Finally, Part III contains applications and examples.
Audience: This volume will be of interest to research and applied mathematicians, computer scientists and historians in mathematics.
Preface. Part I: Historical Developments. 1. Polynomial Equations-Solving in Ancient Times, Mainly in Ancient China. 2. Historical Development of Geometry Theorem-Proving and Geometry Problem-Solving in Ancient Times. Part II: Principles and Methods. 3. Algebraic Varieties as Zero-Sets and Characteristic-Set Method. 4. Some Topics in Computer Algebra. 5. Some Topics in Computational Algebraic Geometry. Part III: Applications and Examples. 6. Applications to Polynomial Equations-Solving. 7. Applications to Geometry Theorem-Proving. 8. Diverse Applications. Bibliography. Index.