9 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) |
| 23304 | The ancient Memorists said virtually all types of thinking could be done simply by memory [Sorabji] |
| Full Idea: The ancient medical Memorists said that ordinary thinking, inferring, reflecting, believing, assuming, examining, generalising and knowing can all be done simply on the basis of memory. | |
| From: Richard Sorabji (Rationality [1996], 'Inference') | |
| A reaction: The think there is a plausible theory that all neurons do is remember, and are mainly distinguished by the duration of their memories. We might explain these modes of thinking in terms of various combinations of the fast and the slow. |
| 23303 | Stoics say true memory needs reflection and assent, but animals only have perceptual recognition [Sorabji] |
| Full Idea: Stoics say memory proper involves reflection and assent. Animal memory, by contrast, is not memory proper, but mere perceptual recognition. The horse remembers the road when he is on it, but not when he is in the stable. | |
| From: Richard Sorabji (Rationality [1996], 'Other') | |
| A reaction: An interesting distinction. Do I remember something if I can never recall it, and yet recognise it when it reappears, such as a person I knew long ago? 'Memory' is ambiguous, between lodged in the mind, and recallable. Unfair to horses, this. |
| 1513 | The Egyptians were the first to say the soul is immortal and reincarnated [Herodotus] |
| Full Idea: The Egyptians were the first to claim that the soul of a human being is immortal, and that each time the body dies the soul enters another creature just as it is being born. | |
| From: Herodotus (The Histories [c.435 BCE], 2.123.2) |