Search Results for ""
351 - 360 of 3024 for Well Ordered SetSearch Results
A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...
A distance graph with distance set (0,1].
A mathematical object (such as a set or function) is said to bounded if it possesses a bound, i.e., a value which all members of the set, functions, etc., are less than.
The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).
A set U has compact closure if its set closure is compact. Typically, compact closure is equivalent to the condition that U is bounded.
The term annihilator is used in several different ways in various aspects of mathematics. It is most commonly used to mean the set of all functions satisfying a given set of ...
A collection B of subsets of a set X forming a topological basis.
A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...
A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.
A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.
...
View search results from all Wolfram sites (37299 matches)

