This book promotes constructive mathematics not by defining it or formalizing it but by practicing it. This means that its definitions and proofs use finite algorithms, not `algorithms' that require surveying an infinite number of possibilities to determine whether a given condition is met. The topics covered derive from classic works of nineteenth century mathematics - among them Galois' theory of algebraic equations, Gauss's theory of binary quadratic forms and Abel's theorem about integrals of rational differentials on algebraic curves. For Abel's theorem the main algorithm is Newton's polygon, which is given a full treatment. Other topics covered include the fundamental theorem of algebra, the factorization of polynomials over an algebraic number field, and the spectral theorem for symmetric matrices.
Rezensionen / Stimmen
From the reviews:
"Harold Edwards is well known for his books with a constructivist slant, and his latest book aims to spread his message further. . The major part of the book consists of essays . telling a connected story, showing what can be achieved with such a constructive restriction imposed. The achievement is impressive . . " (John Baylis, The Mathematical Gazette, Vol. 90 (5l9), 2006)
"It is not a book about the history/philosophy of mathematics but rather a very serious book of mathematics. . the mathematics is accessible to those with advanced undergraduate or graduate level courses in algebra . . Without a doubt the mathematics in this book is rigorous . . One of the nice features of this book is the bibliography which notes the sections where each reference appears. It should appeal to mathematicians and historians of mathematics alike." (Bonnie Shulman, MathDL, January, 2005)
"The author of this volume points out immediately that it is not about the history or philosophy of mathematics, but rather a book about mathematics. It soon becomes clear, though, that historical and philosophical issues strongly influenced the topics discussed. . The general point of view is that all definitions, theorems, constructs, and proofs should involve only algorithms that terminate in a finite number of steps. . The book contains a wealth of interesting mathematics well worth reading." (Larry C. Grove, SIAM Review, Vol. 47 (4), 2005)
"The book under review presents several important topics in mathematics from a constructivist point of view. . This book is a delight to read. . Moreover, the required background is kept to a minimum, so the book can be read by anyone with a good understanding of basic algebra. . The style of the book itself is sufficient reason for reading it. . One would wish that more mathematicians read the masters in search of inspiration, instead of merely following the most recent fads." (S.C. Coutinho, SIGACT News, Vol. 41 (2), 2010)
