Search Results for ""

A graph that is not finite is called infinite.

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

A product involving an infinite number of terms. Such products can converge. In fact, for positive a_n, the product product_(n=1)^(infty)a_n converges to a nonzero number iff ...

One of the most useful tools in nonstandard analysis is the concept of a hyperfinite set. To understand a hyperfinite set, begin with an arbitrary infinite set X whose ...

A set P is called perfect if P=P^', where P^' is the derived set of P.

A definable set which is the complement of an analytic set.

A set whose members index (label) members of another set. For example, in the set A= union _(k in K)A_k, the set K is an index set of the set A.

A definable set, also called a Souslin set.

The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...

A hom-set of a category C is a set of morphisms of C.