more from this thinker | more from this text
Full Idea
The Axiom of Reducibility states that every propositional function is extensionally equivalent to some predicative proposition function.
Gist of Idea
Axiom of Reducibility: propositional functions are extensionally predicative
Source
Penelope Maddy (Naturalism in Mathematics [1997], I.1)
Book Ref
Maddy,Penelope: 'Naturalism in Mathematics' [OUP 2000], p.11
Related Idea
Idea 18168 'Propositional functions' are propositions with a variable as subject or predicate [Maddy]
| 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] |