Reverse Mathematics
John Stillwell
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Naturwissenschaften, Medizin, Informatik, Technik / Geometrie
Beschreibung
This book presents reverse mathematics to a general mathematical audience for the first time. Reverse mathematics is a new field that answers some old questions. In the two thousand years that mathematicians have been deriving theorems from axioms, it has often been asked: which axioms are needed to prove a given theorem? Only in the last two hundred years have some of these questions been answered, and only in the last forty years has a systematic approach been developed. In Reverse Mathematics, John Stillwell gives a representative view of this field, emphasizing basic analysis—finding the “right axioms” to prove fundamental theorems—and giving a novel approach to logic.
Stillwell introduces reverse mathematics historically, describing the two developments that made reverse mathematics possible, both involving the idea of arithmetization. The first was the nineteenth-century project of arithmetizing analysis, which aimed to define all concepts of analysis in terms of natural numbers and sets of natural numbers. The second was the twentieth-century arithmetization of logic and computation. Thus arithmetic in some sense underlies analysis, logic, and computation. Reverse mathematics exploits this insight by viewing analysis as arithmetic extended by axioms about the existence of infinite sets. Remarkably, only a small number of axioms are needed for reverse mathematics, and, for each basic theorem of analysis, Stillwell finds the “right axiom” to prove it.
By using a minimum of mathematical logic in a well-motivated way, Reverse Mathematics will engage advanced undergraduates and all mathematicians interested in the foundations of mathematics.
Kundenbewertungen
Mathematical induction, Turing degree, Intermediate value theorem, Upper and lower bounds, Kruskal's tree theorem, Quantifier (logic), Variable (mathematics), Actual infinity, Computation, Ramsey's theorem, Sign (mathematics), Least-upper-bound property, Rational number, Significant figures, Axiom, Continuous function (set theory), Axiom of choice, Recursively enumerable set, Decision problem, Elementary proof, Successor function, Computability, Mathematics, Cantor's diagonal argument, Zermelo–Fraenkel set theory, Arbitrarily large, Turing machine, Algorithm, Computable number, Invariance of domain, Reverse mathematics, Sequence, Natural number, Binary tree, Theorem, Constructivism (mathematics), Predicate logic, Bolzano–Weierstrass theorem, Dedekind cut, Commutative property, Special case, Turing jump, Riemann mapping theorem, Geometry, Set theory, Heine–Borel theorem, Well-order, Pythagorean theorem, Monotone convergence theorem, Classical logic, Computable function, Gödel's incompleteness theorems, Entscheidungsproblem, Jordan curve theorem, Maxima and minima, Ramsey theory, Continuous function, Monotonic function, Number theory, Cantor's theorem, Non-Euclidean geometry, Extreme value theorem, Real number, Bounded quantifier, Church–Turing thesis, Subset, Associative property, Prime number, Equation, Infimum and supremum