Search Results for ""

A system of equations is any set of simultaneous equations.

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

A collection B of subsets of a set X forming a topological basis.

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

An outer measure mu on R^n is Borel regular if, for each set X subset R^n, there exists a Borel set B superset X such that mu(B)=mu(X). The d-dimensional Hausdorff outer ...