display all the ideas for this combination of texts
5 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) |
| 21695 | The set scheme discredited by paradoxes is actually the most natural one [Quine] |
| Full Idea: Each proposed revision of set theory is unnatural, because the natural scheme is the unrestricted one that the antinomies discredit. | |
| From: Willard Quine (The Ways of Paradox [1961], p.16) | |
| A reaction: You can either takes this free-far-all version of set theory, and gradually restrain it for each specific problem, or start from scratch and build up in safe steps. The latter is (I think) the 'iterated' approach. |
| 21693 | Russell's antinomy challenged the idea that any condition can produce a set [Quine] |
| Full Idea: In the case of Russell's antinomy, the tacit and trusted pattern of reasoning that is found wanting is this: for any condition you can formulate, there is a class whose members are the things meeting the condition. | |
| From: Willard Quine (The Ways of Paradox [1961], p.11) | |
| A reaction: This is why Russell's Paradox is so important for set theory, which in turn makes it important for the foundations of mathematics. |
| 11064 | Classes can be reduced to propositional functions [Russell, by Hanna] |
| Full Idea: Russell held that classes can be reduced to propositional functions. | |
| From: report of Bertrand Russell (Mathematical logic and theory of types [1908]) by Robert Hanna - Rationality and Logic 2.4 | |
| A reaction: The exact nature of a propositional function is disputed amongst Russell scholars (though it is roughly an open sentence of the form 'x is red'). |