Reverse Mathematics [E-Book] : Problems, Reductions, and Proofs / by Damir D. Dzhafarov, Carl Mummert.
Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability theory, t...
Saved in:
Full text |
|
Personal Name(s): | Dzhafarov, Damir D., author |
Mummert, Carl, author | |
Edition: |
1st edition 2022. |
Imprint: |
Cham :
Springer,
2022
|
Physical Description: |
XIX, 488 pages 1 illustration (online resource) |
Note: |
englisch |
ISBN: |
9783031113673 |
DOI: |
10.1007/978-3-031-11367-3 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Theory and Applications of Computability, In cooperation with the association Computability in Europe
|
Subject (LOC): |
- 1 introduction
- Part I Computable mathematics: 2 Computability theory
- 3 Instance-solution problems
- 4 Problem reducibilities
- Part II Formalization and syntax: 5 Second order arithmetic
- 6 Induction and bounding
- 7 Forcing
- Part III Combinatorics: 8 Ramsey's theorem
- 9 Other combinatorial principles
- Part IV Other areas: 10 Analysis and topology
- 11 Algebra
- 12 Set theory and beyond.