Search Results for ""

A group set is a set whose elements are acted on by a group. If the group G acts on the set S, then S is called a G-set. Let G be a group and let S be a G-set. Then for every ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

A set S and a binary operator * are said to exhibit closure if applying the binary operator to two elements S returns a value which is itself a member of S. The closure of a ...

The index set for the collection of submodules in a graded module.

The continuous image of a Polish space, also called an analytic set.

A partially ordered set is defined as an ordered pair P=(X,<=). Here, X is called the ground set of P and <= is the partial order of P.

Given a set S with a subset E, the complement (denoted E^' or E^_) of E with respect to S is defined as E^'={F:F in S,F not in E}. (1) Using set difference notation, the ...

Set theory is the mathematical theory of sets. Set theory is closely associated with the branch of mathematics known as logic. There are a number of different versions of set ...

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...