Summary: This paper presents in the sixth revised and extended edition a deeper understanding of the quantification of mathematical infinity. After eliminating the incorrect usage of bijections, key results based on the concept of cardinality become...
More
Summary: This paper presents in the sixth revised and extended edition a deeper understanding of the quantification of mathematical infinity. After eliminating the incorrect usage of bijections, key results based on the concept of cardinality become obsolete. The number of algebraic numbers is counted in general and asymptotically up to a given degree, and a method for counting the elements of infinite sets is specified. The real and complex numbers are re-characterised by extending them to infinity. In the field of linear programming, a perturbation method for overcoming the problem of multiple vertices in the simplex algorithm is presented, and Smale's 9th problem is solved with the fast strongly polynomial intex algorithm. The book ends with the proof of the generalised Riemann hypothesis by concluding two theorems.
Less
