In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Philosophia Mathematica. Association for Symbolic Logic. pp. 153-188 (2010)

Authors
Peter Koellner
Harvard University
Abstract
The paper begins with an examination of Gödel's views on absolute undecidability and related topics in set theory. These views are sharpened and assessed in light of recent developments. It is argued that a convincing case can be made for axioms that settle many of the questions undecided by the standard axioms and that in a precise sense the program for large cardinals is a complete success “below” CH. It is also argued that there are reasonable scenarios for settling CH and that there is not currently a convincing case to the effect that a given statement is absolutely undecidable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/philmat/nkj009
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,342
Through your library

References found in this work BETA

The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
From Frege to Gödel.Jean Van Heijenoort (ed.) - 1967 - Cambridge: Harvard University Press.

View all 14 references / Add more references

Citations of this work BETA

On Reflection Principles.Peter Koellner - 2009 - Annals of Pure and Applied Logic 157 (2-3):206-219.
Strong Logics of First and Second Order.Peter Koellner - 2010 - Bulletin of Symbolic Logic 16 (1):1-36.

View all 16 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2010-07-14

Total views
96 ( #94,856 of 2,326,053 )

Recent downloads (6 months)
8 ( #87,101 of 2,326,053 )

How can I increase my downloads?

Downloads

My notes