more from this thinker | more from this text
Full Idea
Russell's Axiom of Reducibility states that to any propositional function of any order in a given level, there corresponds another which is of the lowest possible order in the level. There corresponds what he calls a 'predicative' function of that level.
Gist of Idea
Axiom of Reducibility: there is always a function of the lowest possible order in a given level
Source
report of Bertrand Russell (Substitutional Classes and Relations [1906]) by David Bostock - Philosophy of Mathematics 8.2
Book Ref
Bostock,David: 'Philosophy of Mathematics: An Introduction' [Wiley-Blackwell 2009], p.238
| 14459 | Reducibility: a family of functions is equivalent to a single type of function [Russell] |
| 21720 | Russell saw Reducibility as legitimate for reducing classes to logic [Linsky,B on Russell/Whitehead] |
| 18130 | Axiom of Reducibility: there is always a function of the lowest possible order in a given level [Russell, by Bostock] |
| 13428 | Reducibility: to every non-elementary function there is an equivalent elementary function [Ramsey] |
| 21716 | In simple type theory the axiom of Separation is better than Reducibility [Gödel, by Linsky,B] |
| 18170 | The Axiom of Reducibility is self-effacing: if true, it isn't needed [Quine] |
| 21717 | Reducibility undermines type ramification, and is committed to the existence of functions [Quine, by Linsky,B] |
| 18169 | Axiom of Reducibility: propositional functions are extensionally predicative [Maddy] |
| 21705 | Reducibility says any impredicative function has an appropriate predicative replacement [Linsky,B] |
| 17900 | The Axiom of Reducibility made impredicative definitions possible [George/Velleman] |