# On the Question of Absolute Undecidability

@inproceedings{Koellner2006OnTQ, title={On the Question of Absolute Undecidability}, author={Peter Koellner}, year={2006} }

- Published 2006
DOI:10.1093/philmat/nkj009

The incompleteness theorems show that for every sufficiently strong consistent formal system of mathematics there are mathematical statements undecided relative to the system. A natural and intriguing question is whether there are mathematical statements that are in some sense absolutely undecidable, that is, undecidable relative to any set of axioms that are justified. Gödel was quick to point out that his original incompleteness theorems did not produce instances of absolute undecidability… CONTINUE READING