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] |
| 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) |
| 10735 | Abstraction from objects won't reveal an operation's being performed 'so many times' [Geach] |
| Full Idea: For an understanding of arithmetic the grasp of an operation's being performed 'so many times' is quite indispensable; and abstraction of a feature from groups of nuts cannot give us this grasp. | |
| From: Peter Geach (Abstraction Reconsidered [1983], p.170) | |
| A reaction: I end up defending the empirical approach to arithmetic because remarks like this are so patently false. Geach seems to think we arrive ready-made in the world, just raring to get on with some counting. He lacks the evolutionary perspective. |