8 ideas
| 17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
| Full Idea: There are many coherent stopping points in the hierarchy of increasingly strong mathematical systems, starting with strict finitism, and moving up through predicativism to the higher reaches of set theory. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], Intro) |
| 17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
| Full Idea: Roughly speaking, 'reflection principles' assert that anything true in V [the set hierarchy] falls short of characterising V in that it is true within some earlier level. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 2.1) |
| 14235 | Saying 'they can become a set' is a tautology, because reference to 'they' implies a collection [Cargile] |
| Full Idea: If the rule is asserted 'Given any well-determined objects, they can be collected into a set by an application of the 'set of' operation', then on the usual account of 'they' this is a tautology. Collection comes automatically with this form of reference. | |
| From: James Cargile (Paradoxes: Form and Predication [1979], p.115), quoted by Oliver,A/Smiley,T - What are Sets and What are they For? Intro | |
| A reaction: Is this a problem? Given they are well-determined (presumably implying countable) there just is a set of them. That's what set theory is, I thought. Of course, the iterative view talks of 'constructing' the sets, but the construction looks unstoppable. |
| 17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
| Full Idea: There is at present no solid argument to the effect that a given statement is absolutely undecidable. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 5.3) |
| 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) |
| 7294 | No crime and no punishment without a law [Roman law] |
| Full Idea: An ancient principle of Roman law states, nullum crimen et nulla poene sine lege, - there is no crime and no punishment without a law. | |
| From: [Roman law] (Roman Law [c.100]), quoted by A.C. Grayling - Among the Dead Cities Ch.6 | |
| A reaction: That there is no 'punishment' without law seems the basis of civilization. Suppose a strong person imposed firm punishment in order to forestall more brutal revenge by others? What motivates the creation of criminal laws? |