Graduate studies at Western
|Abstract||An unprovable theorem is a mathematical result that can-not be proved using the com-monly accepted axioms for mathematics (Zermelo-Frankel plus the axiom of choice), but can be proved by using the higher infinities known as large cardinals. Large car-dinal axioms have been the main proposal for new axioms originating with Gödel.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Colin McLarty (1991). Axiomatizing a Category of Categories. Journal of Symbolic Logic 56 (4):1243-1260.
John R. Lucas (1961). Minds, Machines and Godel. Philosophy 36 (April-July):112-127.
Panu Raatikainen (2005). On the Philosophical Relevance of Gödel's Incompleteness Theorems. Revue Internationale de Philosophie 59 (4):513-534.
G. Longo (2011). Reflections on Concrete Incompleteness. Philosophia Mathematica 19 (3):255-280.
Harvey Friedman (2000). Does Mathematics Need New Axioms? The Bulletin of Symbolic Logic 6 (4):401 - 446.
Kenny Easwaran (2008). The Role of Axioms in Mathematics. Erkenntnis 68 (3):381 - 391.
Added to index2009-01-28
Total downloads17 ( #78,332 of 751,988 )
Recent downloads (6 months)1 ( #63,163 of 751,988 )
How can I increase my downloads?