Editing Richard's paradox (section)

== Relation to predicativism ==

Another opinion concerning Richard's paradox relates to mathematical [[predicativism]]. By this view, the real numbers are defined in stages, with each stage only making reference to previous stages and other things that have already been defined. From a predicative viewpoint it is not valid to quantify over ''all'' real numbers in the process of generating a new real number, because this is believed to result in a circularity problem in the definitions. Set theories such as ZFC are not based on this sort of predicative framework, and allow impredicative definitions.

Richard (1905) presented a solution to the paradox from the viewpoint of predicativism. Richard claimed that the flaw of the paradoxical construction was that the expression for the construction of the real number ''r'' does not actually define a real number unambiguously, because the statement refers to the construction of an infinite set of real numbers, of which ''r'' itself is a part. Thus, Richard says, the real number ''r'' will not be included as any ''r''<sub>''n''</sub>, because the definition of ''r'' does not meet the criteria for being included in the sequence of definitions used to construct the sequence ''r''<sub>''n''</sub>.  Contemporary mathematicians agree that the definition of ''r'' is invalid, but for a different reason. They believe the definition of ''r'' is invalid because there is no well-defined notion of when an English phrase defines a real number, and so there is no unambiguous way to construct the sequence ''r''<sub>''n''</sub>.

Although Richard's solution to the paradox did not gain favor with mathematicians, predicativism is an important part of the study of the [[foundations of mathematics]]. Predicativism was first studied in detail by [[Hermann Weyl]] in ''Das Kontinuum'', wherein he showed that much of elementary [[real analysis]] can be conducted in a predicative manner starting with only the [[natural number]]s.  More recently, predicativism has been studied by [[Solomon Feferman]], who has used [[proof theory]] to explore the relationship between predicative and impredicative systems.<ref>Solomon Feferman, "[https://math.stanford.edu/~feferman/papers/predicativity.pdf Predicativity]" (2002)</ref>