On the question of absolute undecidability

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

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,649

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-07-14

Downloads
126 (#98,098)

6 months
9 (#87,632)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Koellner
Harvard University

Citations of this work

Mathematics and Metaphilosophy.Justin Clarke-Doane - 2022 - Cambridge: Cambridge University Press.
(Probably) Not Companions in Guilt.Sharon Berry - 2018 - Philosophical Studies 175 (9):2285-2308.

View all 28 citations / Add more citations

References found in this work

What is Cantor's Continuum Problem?Kurt Gödel - 1947 - Journal of Symbolic Logic 13 (2):176--187.
The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
From Frege to Gödel.Jean van Heijenoort - 1968 - Philosophy of Science 35 (1):72-72.

View all 13 references / Add more references