Search Results for ""
261 - 270 of 13134 for Naive set theorySearch Results
A set of four, also called a tetrad.
A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.
An open connected set is called a region (sometimes also called a domain).
An infinite set, such as the real numbers, which is not countably infinite.
The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...
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.
A set U has compact closure if its set closure is compact. Typically, compact closure is equivalent to the condition that U is bounded.
Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...
A set in R^d formed by translating an affine subspace or by the intersection of a set of hyperplanes.
The Cantor diagonal method, also called the Cantor diagonal argument or Cantor's diagonal slash, is a clever technique used by Georg Cantor to show that the integers and ...
...
View search results from all Wolfram sites (53007 matches)

