display all the ideas for this combination of texts
3 ideas
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) |
14247 | Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley] |
Full Idea: Identifying numbers with sets may mean one of three quite different things: 1) the sets represent the numbers, or ii) they are the numbers, or iii) they replace the numbers. | |
From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 5.2) | |
A reaction: Option one sounds the most plausible to me. I will take numbers to be patterns embedded in nature, and sets are one way of presenting them in shorthand form, in order to bring out what is repeated. |