display all the ideas for this combination of texts
4 ideas
| 17890 | There are at least eleven types of large cardinal, of increasing logical strength [Koellner] |
| Full Idea: Some of the standard large cardinals (in order of increasing (logical) strength) are: inaccessible, Mahlo, weakly compact, indescribable, Erdös, measurable, strong, Wodin, supercompact, huge etc. (...and ineffable). | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) | |
| A reaction: [I don't understand how cardinals can have 'logical strength', but I pass it on anyway] |
| 18760 | The culmination of Euclidean geometry was axioms that made all models isomorphic [McGee] |
| Full Idea: One of the culminating achievements of Euclidean geometry was categorical axiomatisations, that describe the geometric structure so completely that any two models of the axioms are isomorphic. The axioms are second-order. | |
| From: Vann McGee (Logical Consequence [2014], 7) | |
| A reaction: [He cites Veblen 1904 and Hilbert 1903] For most mathematicians, categorical axiomatisation is the best you can ever dream of (rather than a single true axiomatisation). |
| 17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner] |
| Full Idea: To the extent that we are justified in accepting Peano Arithmetic we are justified in accepting its consistency, and so we know how to expand the axiom system so as to overcome the limitation [of Gödel's Second Theorem]. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.1) | |
| A reaction: Each expansion brings a limitation, but then you can expand again. |
| 17891 | Arithmetical undecidability is always settled at the next stage up [Koellner] |
| Full Idea: The arithmetical instances of undecidability that arise at one stage of the hierarchy are settled at the next. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) |