display all the ideas for this combination of texts
3 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) |
| 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'). |