display all the ideas for this combination of texts
4 ideas
| 10885 | Computer proofs don't provide explanations [Horsten] |
| Full Idea: Mathematicians are uncomfortable with computerised proofs because a 'good' proof should do more than convince us that a certain statement is true. It should also explain why the statement in question holds. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §5.3) |
| 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) |
| 10881 | The concept of 'ordinal number' is set-theoretic, not arithmetical [Horsten] |
| Full Idea: The notion of an ordinal number is a set-theoretic, and hence non-arithmetical, concept. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §2.3) |