This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (March 2011) (Learn how and when to remove this message)

Bourbaki also defines an inductive set to be a partially ordered set that satisfies the hypothesis of Zorn's lemma when nonempty.

In descriptive set theory, an inductive set of real numbers (or more generally, an inductive subset of a Polish space) is one that can be defined as the least fixed point of a monotone operation definable by a positive Σ¹_n formula, for some natural number n, together with a real parameter.

The inductive sets form a boldface pointclass; that is, they are closed under continuous preimages. In the Wadge hierarchy, they lie above the projective sets and below the sets in L(R). Assuming sufficient determinacy, the class of inductive sets has the scale property and thus the prewellordering property.

The term can have a number of different meanings:^[1]

• Russell's definition, an inductive set is a nonempty partially ordered set in which every element has a successor. An example is the set of natural numbers N, where 0 is the first element, and the others are produced by adding 1 successively.^[2]
• Roitman considers the same construction in a more concrete form: the elements are sets, the empty set ${\displaystyle \emptyset }$ among them, and the successor of every element ${\displaystyle y}$ is the set ${\displaystyle y\cup \{y\}}$. In particular, every inductive set contains the sequence ${\displaystyle \emptyset ,\{\emptyset \},\{\emptyset ,\{\emptyset \}\},\{\emptyset ,\{\emptyset \},\{\emptyset ,\{\emptyset \}\}\},\dots }$.^[3]
• For many other authors (e.g., Bourbaki), an inductive set is a partially ordered set in which every totally ordered subset has an upper bound, i.e., it is a set fulfilling the assumption of Zorn's lemma.^[4]

This set theory-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e