TOPICS
Search

Search Results for ""


471 - 480 of 13134 for Naive set theorySearch Results
A ring of fractions that coincides with the localization with respect to the set of all non-zero divisors.
Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...
The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...
Let R be a ring, and let I be an ideal of R. The correspondence A<->A/I is an inclusion preserving bijection between the set of subrings A of R that contain I and the set of ...
The set of all centroid points in a weighted tree (Harary 1994, p. 36).
Let q be a positive integer, then Gamma_0(q) is defined as the set of all matrices [a b; c d] in the modular group Gamma Gamma with c=0 (mod q). Gamma_0(q) is a subgroup of ...
Let X be a set of urelements that contains the set N of natural numbers, and let V(X) be a superstructure whose individuals are in X. Let V(^*X) be an enlargement of V(X), ...
A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...
If S is an infinite set, then the collection F_S={A subset= S:S-A is finite} is a filter called the cofinite (or Fréchet) filter on S.
A group G is said to be finitely generated if there exists a finite set of group generators for G.
1 ... 45|46|47|48|49|50|51 ... 1314 Previous Next

...