display all the ideas for this combination of texts
3 ideas
| 17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
| Full Idea: There are many coherent stopping points in the hierarchy of increasingly strong mathematical systems, starting with strict finitism, and moving up through predicativism to the higher reaches of set theory. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], Intro) |
| 17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
| Full Idea: Roughly speaking, 'reflection principles' assert that anything true in V [the set hierarchy] falls short of characterising V in that it is true within some earlier level. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 2.1) |
| 18189 | ZFC could contain a contradiction, and it can never prove its own consistency [MacLane] |
| Full Idea: We have at hand no proof that the axioms of ZFC for set theory will never yield a contradiction, while Gödel's second theorem tells us that such a consistency proof cannot be conducted within ZFC. | |
| From: Saunders MacLane (Mathematics: Form and Function [1986], p.406), quoted by Penelope Maddy - Naturalism in Mathematics | |
| A reaction: Maddy quotes this, while defending set theory as the foundation of mathematics, but it clearly isn't the most secure foundation that could be devised. She says the benefits of set theory do not need guaranteed consistency (p.30). |