Predicativity

Get Predicativity essential facts below. View Videos or join the Predicativity discussion. Add Predicativity to your PopFlock.com topic list for future reference or share this resource on social media.
## History

## See also

## Notes

## References

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Predicativity

In mathematics, logic and philosophy of mathematics, something that is **impredicative** is a self-referencing definition. Roughly speaking, a definition is impredicative if it invokes (mentions or quantifies over) the set being defined, or (more commonly) another set that contains the thing being defined. There is no generally accepted precise definition of what it means to be predicative or impredicative. Authors have given different but related definitions.

The opposite of impredicativity is predicativity, which essentially entails building stratified (or ramified) theories where quantification over lower levels results in variables of some new type, distinguished from the lower types that the variable ranges over. A prototypical example is intuitionistic type theory, which retains ramification so as to discard impredicativity.

Russell's paradox is a famous example of an impredicative construction--namely the set of all sets that do not contain themselves. The paradox is that such a set cannot exist: If it would exist, the question could be asked whether it contains itself or not -- if it does then by definition it should not, and if it does not then by definition it should.

The greatest lower bound of a set `X`, glb(`X`), also has an impredicative definition: `y` = glb(`X`) if and only if for all elements `x` of `X`, `y` is less than or equal to `x`, and any `z` less than or equal to all elements of `X` is less than or equal to `y`. This definition quantifies over the set (potentially infinite, depending on the order in question) whose members are the lower bounds of `X`, one of which being the glb itself. Hence **predicativism** would reject this definition.^{[1]}

Norms (containing one variable) which do not define classes I propose to call *non-predicative*;
those which do define classes I shall call *predicative*.

(Russell 1907, p.34) (Russell used "norm" to mean a proposition: roughly something that can take the values "true" or "false".)

The terms "predicative" and "impredicative" were introduced by Russell (1907), though the meaning has changed a little since then.

Solomon Feferman provides a historical review of predicativity, connecting it to current outstanding research problems.^{[2]}

The vicious circle principle was suggested by Henri Poincaré (1905-6, 1908)^{[3]} and Bertrand Russell in the wake of the paradoxes as a requirement on legitimate set specifications. Sets that do not meet the requirement are called *impredicative*.

The first modern paradox appeared with Cesare Burali-Forti's 1897 *A question on transfinite numbers*^{[4]} and would become known as the Burali-Forti paradox. Cantor had apparently discovered the same paradox in his (Cantor's) "naive" set theory and this become known as Cantor's paradox. Russell's awareness of the problem originated in June 1901^{[5]} with his reading of Frege's treatise of mathematical logic, his 1879 *Begriffsschrift*; the offending sentence in Frege is the following:

On the other hand, it may also be that the argument is determinate and the function indeterminate.

^{[6]}

In other words, given `f`(`a`) the function `f` is the variable and `a` is the invariant part. So why not substitute the value `f`(`a`) for `f` itself? Russell promptly wrote Frege a letter pointing out that:

You state ... that a function too, can act as the indeterminate element. This I formerly believed, but now this view seems doubtful to me because of the following contradiction. Let

wbe the predicate: to be a predicate that cannot be predicated of itself. Canwbe predicated of itself? From each answer its opposite follows. There we must conclude thatwis not a predicate. Likewise, there is no class (as a totality) of those classes which each taken as a totality, do not belong to themselves. From this I conclude that under certain circumstances a definable collection does not form a totality.^{[7]}

Frege promptly wrote back to Russell acknowledging the problem:

Your discovery of the contradiction caused me the greatest surprise and, I would almost say, consternation, since it has shaken the basis on which I intended to build arithmetic.

^{[8]}

While the problem had adverse personal consequences for both men (both had works at the printers that had to be emended), van Heijenoort observes that "The paradox shook the logicians' world, and the rumbles are still felt today. ... Russell's paradox, which uses the bare notions of set and element, falls squarely in the field of logic. The paradox was first published by Russell in *The principles of mathematics* (1903) and is discussed there in great detail ...".^{[9]} Russell, after six years of false starts, would eventually answer the matter with his 1908 theory of types by "propounding his *axiom of reducibility*. It says that any function is coextensive with what he calls a *predicative* function: a function in which the types of apparent variables run no higher than the types of the arguments".^{[10]} But this "axiom" was met with resistance from all quarters.

The rejection of impredicatively defined mathematical objects (while accepting the natural numbers as classically understood) leads to the position in the philosophy of mathematics known as predicativism, advocated by Henri Poincaré and Hermann Weyl in his *Das Kontinuum*. Poincaré and Weyl argued that impredicative definitions are problematic only when one or more underlying sets are infinite.

Ernst Zermelo in his 1908 "A new proof of the possibility of a well-ordering"^{[full ]} presents an entire section "b. *Objection concerning nonpredicative definition*" where he argued against "Poincaré (1906, p. 307) [who states that] a definition is 'predicative' and logically admissible only if it *excludes* all objects that are dependent upon the notion defined, that is, that can in any way be determined by it".^{[11]} He gives two examples of impredicative definitions – (i) the notion of Dedekind chains and (ii) "in analysis wherever the maximum or minimum of a previously defined "completed" set of numbers `Z` is used for further inferences. This happens, for example, in the well-known Cauchy proof...".^{[12]} He ends his section with the following observation: "A definition may very well rely upon notions that are equivalent to the one being defined; indeed, in every definition *definiens* and *definiendum* are equivalent notions, and the strict observance of Poincaré's demand would make every definition, hence all of science, impossible".^{[13]}

Zermelo's example of minimum and maximum of a previously defined "completed" set of numbers reappears in Kleene 1952:42-42 where Kleene uses the example of least upper bound in his discussion of impredicative definitions; Kleene does not resolve this problem. In the next paragraphs he discusses Weyl's attempt in his 1918 *Das Kontinuum* (*The Continuum*) to eliminate impredicative definitions and his failure to retain the "theorem that an arbitrary non-empty set M of real numbers having an upper bound has a least upper bound (cf. also Weyl 1919)".^{[14]}

Ramsey argued that "impredicative" definitions can be harmless: for instance, the definition of "tallest person in the room" is impredicative, since it depends on a set of things of which it is an element, namely the set of all persons in the room. Concerning mathematics, an example of an impredicative definition is the smallest number in a set, which is formally defined as: `y` = min(`X`) if and only if for all elements `x` of `X`, `y` is less than or equal to `x`, and `y` is in `X`.

Burgess (2005) discusses predicative and impredicative theories at some length, in the context of Frege's logic, Peano arithmetic, second order arithmetic, and axiomatic set theory.

**^**Kleene 1952:42-43**^**Solomon Feferman, "Predicativity" (2002)**^**dates derived from Kleene 1952:42**^**van Heijenoort's commentary before Burali-Forti's (1897)*A question on transfinite numbers*in van Heijenoort 1967:104; see also his commentary before Georg Cantor's (1899)*Letter to Dedekind*in van Heijenoort 1967:113**^**Commentary by van Heijenoort before Bertrand Russell's*Lettern to Frege*in van Heijenoort 1967:124**^**Gottlob Frege (1879)*Begriffsschrift*in van Heijenoort 1967:23**^**Bertrand Russell's 1902*Letter to Frege*in van Heijenoort 1967:124-125**^**Gottlob Frege's (1902)*Letter to Russell*in van Hiejenoort 1967:127**^**Van Heijenoort's commentary before Bertrand Russell's (1902)*Letter to Frege*1967:124**^**Willard V. Quine's commentary before Bertrand Russell's 1908*Mathematical logic as based on the theory of types***^**van Heijenoort 1967:190**^**van Heijenoort 1967:190-191**^**van Heijenoort 1967:191**^**Kleene 1952:43

- "Predicative and Impredicative Definitions".
*Internet Encyclopedia of Philosophy*. - PlanetMath article on predicativism
- John Burgess, 2005.
*Fixing Frege*. Princeton Univ. Press. - Solomon Feferman, 2005, "Predicativity" in
*The Oxford Handbook of Philosophy of Mathematics and Logic*. Oxford University Press: 590-624. - Russell, B. (1907), "On Some Difficulties in the Theory of Transfinite Numbers and Order Types",
*Proc. London Math. Soc.*, s2-4 (1): 29-53, doi:10.1112/plms/s2-4.1.29 - Stephen C. Kleene 1952 (1971 edition),
*Introduction to Metamathematics*, North-Holland Publishing Company, Amsterdam NY, ISBN 0-7204-2103-9. In particular cf. his*§11 The Paradoxes*(pp. 36-40) and*§12 First inferences from the paradoxes*IMPREDICATIVE DEFINITION (p. 42). He states that his 6 or so (famous) examples of paradoxes (antinomies) are all examples of impredicative definition, and says that Poincaré (1905-6, 1908) and Russell (1906, 1910) "enunciated the cause of the paradoxes to lie in these impredicative definitions" (p. 42), however, "parts of mathematics we want to retain, particularly analysis, also contain impredicative definitions." (ibid). Weyl in his 1918 ("Das Kontinuum") attempted to derive as much of analysis as was possible without the use of impredicative definitions, "but not the theorem that an arbitrary non-empty set M of real numbers having an upper bound has a least upper bound (CF. also Weyl 1919)" (p. 43). - Hans Reichenbach 1947,
*Elements of Symbolic Logic*, Dover Publications, Inc., NY, ISBN 0-486-24004-5. Cf. his*§40. The antinomies and the theory of types*(pp. 218 -- wherein he demonstrates how to create antinomies, including the definition of*impredicable*itself ("Is the definition of "impredicable" impredicable?"). He claims to show methods for eliminating the "paradoxes of syntax" ("logical paradoxes") -- by use of the theory of types -- and "the paradoxes of semantics" -- by the use of metalanguage (his "theory of levels of language"). He attributes the suggestion of this notion to Russell and more concretely to Ramsey. - Jean van Heijenoort 1967, third printing 1976,
*From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931*, Harvard University Press, Cambridge MA, ISBN 0-674-32449-8 (pbk.)

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Popular Products

Music Scenes

Popular Artists