2006 | On the Question of Absolute Undecidability |
Intro | p.2 | 17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism |
1.1 | p.4 | 17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations |
1.2 | p.7 | 17889 | CH: An infinite set of reals corresponds 1-1 either to the naturals or to the reals |
1.4 | p.10 | 17890 | There are at least eleven types of large cardinal, of increasing logical strength |
1.4 | p.10 | 17891 | Arithmetical undecidability is always settled at the next stage up |
2.1 | p.13 | 17893 | 'Reflection principles' say the whole truth about sets can't be captured |
5.3 | p.37 | 17894 | We have no argument to show a statement is absolutely undecidable |