Atjaunināt sīkdatņu piekrišanu

Reverse Mathematics: Proofs from the Inside Out [Hardback]

4.22/5 (113 ratings by Goodreads)
  • Formāts: Hardback, 200 pages, height x width: 235x152 mm, weight: 454 g, 35 illus.
  • Izdošanas datums: 01-Jan-2018
  • Izdevniecība: Princeton University Press
  • ISBN-10: 0691177171
  • ISBN-13: 9780691177175
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 41,71 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 200 pages, height x width: 235x152 mm, weight: 454 g, 35 illus.
  • Izdošanas datums: 01-Jan-2018
  • Izdevniecība: Princeton University Press
  • ISBN-10: 0691177171
  • ISBN-13: 9780691177175
Citas grāmatas par šo tēmu:

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.

Recenzijas

"If you are not familiar with this relatively new research about the foundations and and minimal assumptions needed to develop the massive mathematical structure, this provides a good informal guideline."---Adhemar Bultheel, European Mathematical Society "John Stillwells book gives a clear and engaging introduction to an intriguing area of mathematics: reverse mathematics."---Martyn Prigmore, Mathematics Today "The book is rich in examples and historical perspectives, is clearly argued and immaculately presented."---Graham Hoare, Mathematical Gazette

Preface xi
1 Historical Introduction
1(25)
1.1 Euclid and the Parallel Axiom
2(3)
1.2 Spherical and Non-Euclidean Geometry
5(5)
1.3 Vector Geometry
10(4)
1.4 Hilbert's Axioms
14(5)
1.5 Well-ordering and the Axiom of Choice
19(4)
1.6 Logic and Computability
23(3)
2 Classical Arithmetization
26(25)
2.1 From Natural to Rational Numbers
27(2)
2.2 From Rationals to Reals
29(3)
2.3 Completeness Properties of R
32(3)
2.4 Functions and Sets
35(2)
2.5 Continuous Functions
37(2)
2.6 The Peano Axioms
39(4)
2.7 The Language of PA
43(2)
2.8 Arithmetically Definable Sets
45(3)
2.9 Limits of Arithmetization
48(3)
3 Classical Analysis
51(19)
3.1 Limits
51(2)
3.2 Algebraic Properties of Limits
53(2)
3.3 Continuity and Intermediate Values
55(2)
3.4 The Bolzano-Weierstrass Theorem
57(2)
3.5 The Heine-Borel Theorem
59(1)
3.6 The Extreme Value Theorem
60(1)
3.7 Uniform Continuity
61(3)
3.8 The Cantor Set
64(2)
3.9 Trees in Analysis
66(4)
4 Computability
70(15)
4.1 Computability and Church's Thesis
71(2)
4.2 The Halting Problem
73(1)
4.3 Computably Enumerable Sets
74(3)
4.4 Computable Sequences in Analysis
77(1)
4.5 Computable Tree with No Computable Path
78(2)
4.6 Computability and Incompleteness
80(1)
4.7 Computability and Analysis
81(4)
5 Arithmetization of Computation
85(24)
5.1 Formal Systems
86(1)
5.2 Smullyan's Elementary Formal Systems
87(2)
5.3 Notations for Positive Integers
89(2)
5.4 Turing's Analysis of Computation
91(2)
5.5 Operations on EFS-Generated Sets
93(3)
5.6 Generating Σ01 Sets
96(2)
5.7 EFS for Σ01 Relations
98(2)
5.8 Arithmetizing Elementary Formal Systems
100(3)
5.9 Arithmetizing Computable Enumeration
103(3)
5.10 Arithmetizing Computable Analysis
106(3)
6 Arithmetical Comprehension
109(21)
6.1 The Axiom System ACA0
110(1)
6.2 Σ01 and Arithmetical Comprehension
111(2)
6.3 Completeness Properties in ACA0
113(3)
6.4 Arithmetization of Trees
116(2)
6.5 The Konig Infinity Lemma
118(3)
6.6 Ramsey Theory
121(3)
6.7 Some Results from Logic
124(3)
6.8 Peano Arithmetic in ACA0
127(3)
7 Recursive Comprehension
130(24)
7.1 The Axiom System RCA0
131(1)
7.2 Real Numbers and Continuous Functions
132(2)
7.3 The Intermediate Value Theorem
134(2)
7.4 The Cantor Set Revisited
136(1)
7.5 From Heine-Borel to Weak Konig Lemma
137(3)
7.6 From Weak Konig Lemma to Heine-Borel
140(1)
7.7 Uniform Continuity
141(2)
7.8 From Weak Konig to Extreme Value
143(3)
7.9 Theorems of WKL0
146(3)
7.10 WKL0, ACA0, and Beyond
149(5)
8 A Bigger Picture
154(14)
8.1 Constructive Mathematics
155(1)
8.2 Predicate Logic
156(4)
8.3 Varieties of Incompleteness
160(2)
8.4 Computability
162(2)
8.5 Set Theory
164(2)
8.6 Concepts of "Depth"
166(2)
Bibliography 168(5)
Index 173
John Stillwell is professor of mathematics at the University of San Francisco and an affiliate of the School of Mathematical Sciences at Monash University, Australia. His many books include Mathematics and Its History and Elements of Mathematics: From Euclid to Godel (Princeton).