Unprovable theorems in discrete mathematics

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.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Concrete Mathematical Incompleteness: Basic Emulation Theory.Harvey Friedman - 2018 - In John Burgess (ed.), Hilary Putnam on Logic and Mathematics. Cham: Springer Verlag.
Does normal mathematics need new axioms?Harvey Friedman - manuscript
Reflections on Concrete Incompleteness.G. Longo - 2011 - Philosophia Mathematica 19 (3):255-280.
On the philosophical relevance of Gödel's incompleteness theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
Is Incompleteness A Serious Problem?G. Lolli & U. Pagallo - unknown
Axiomatizing a category of categories.Colin McLarty - 1991 - Journal of Symbolic Logic 56 (4):1243-1260.
Finite trees and the necessary use of large cardinals.Harvey Friedman - manuscript

Analytics

Added to PP
2009-01-28

Downloads
381 (#53,053)

6 months
14 (#181,672)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references