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) |
| 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) |
| 14534 | Shoemaker moved from properties as powers to properties bestowing powers [Shoemaker, by Mumford/Anjum] |
| Full Idea: Shoemaker ventured the theory in 1980 that properties just are clusters of powers, but he has subsequently abandoned this, and now thinks properties bestow their bearers with causal powers. | |
| From: report of Sydney Shoemaker (Self, Body and Coincidence [1999], p.297) by S.Mumford/R.Lill Anjum - Getting Causes from Powers 1.1 | |
| A reaction: Like Mumford and Anjum, I prefer the earlier theory. I think taking powers as basic is the only story that really makes sense. A power is intrinsic and primitive, whereas properties are complex, messy, partly subjective, and higher level. |
| 22908 | When one element contains the grounds of the other, the first one is prior in time [Leibniz] |
| Full Idea: When one of two non-contemporaneous elements contains the grounds for the other, the former is regarded as the antecedent, and the latter as the consequence | |
| From: Gottfried Leibniz (Metaphysical Foundations of Mathematics [1715], p.201) | |
| A reaction: Bardon cites this passage of Leibniz as the origin of the idea that time's arrow is explained by the direction of causation. Bardon prefers it to the psychological and entropy accounts. |