Incompleteness for Higher-Order Arithmetic An Example Based on Harrington's Principle /
The book examines the following foundation question: are all theorems in classic mathematics which are expressible in second order arithmetic provable in second order arithmetic? In this book, the author gives a counterexample for this question and isolates this counterexample from Martin-Harrington...
| Main Author: | Cheng, Yong (Author, http://id.loc.gov/vocabulary/relators/aut) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Singapore :
Springer Singapore : Imprint: Springer,
2019.
|
| Edition: | 1st ed. 2019. |
| Series: | SpringerBriefs in Mathematics,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Great Circle of Mysteries Mathematics, the World, the Mind /
by: Gromov, Misha, et al.
Published: (2018) -
Parameterized Complexity in the Polynomial Hierarchy Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /
by: de Haan, Ronald, et al.
Published: (2019) -
An Introduction to the Technique of Formative Processes in Set Theory
by: Cantone, Domenico, et al.
Published: (2018) -
Logica Volume 2 - Incompletezza, teoria assiomatica degli insiemi /
by: Abrusci, Vito Michele, et al.
Published: (2018) -
The Hyperuniverse Project and Maximality
Published: (2018)