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...
Κύριος συγγραφέας: | Cheng, Yong (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Singapore :
Springer Singapore : Imprint: Springer,
2019.
|
Έκδοση: | 1st ed. 2019. |
Σειρά: | SpringerBriefs in Mathematics,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Great Circle of Mysteries Mathematics, the World, the Mind /
ανά: Gromov, Misha, κ.ά.
Έκδοση: (2018) -
Parameterized Complexity in the Polynomial Hierarchy Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /
ανά: de Haan, Ronald, κ.ά.
Έκδοση: (2019) -
An Introduction to the Technique of Formative Processes in Set Theory
ανά: Cantone, Domenico, κ.ά.
Έκδοση: (2018) -
Logica Volume 2 - Incompletezza, teoria assiomatica degli insiemi /
ανά: Abrusci, Vito Michele, κ.ά.
Έκδοση: (2018) -
The Hyperuniverse Project and Maximality
Έκδοση: (2018)