display all the ideas for this combination of texts
3 ideas
| 17627 | It seems absurd to prove 2+2=4, where the conclusion is more certain than premises [Russell] |
| Full Idea: It is an apparent absurdity in proceeding ...through many rather recondite propositions of symbolic logic, to the 'proof' of such truisms as 2+2=4: for it is plain that the conclusion is more certain than the premises, and the supposed proof seems futile. | |
| From: Bertrand Russell (Regressive Method for Premises in Mathematics [1907], p.272) | |
| A reaction: Famously, 'Principia Mathematica' proved this fact at enormous length. I wonder if this thought led Moore to his common sense view of his own hand - the conclusion being better than the sceptical arguments? |
| 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) |