Search Results for ""

A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...

A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A coordinate system obtained by inversion of the bicyclide coordinates. They are given by the transformation equations x = Lambda/(aUpsilon)snmudnnucospsi (1) y = ...

The symbol intersection , used for the intersection of sets, and sometimes also for the logical connective AND instead of the symbol ^ (wedge). In fact, for any two sets A ...

Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...

For any sets A and B, their cardinal numbers satisfy |A|<=|B| iff there is a one-to-one function f from A into B (Rubin 1967, p. 266; Suppes 1972, pp. 94 and 116). It is easy ...

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 ...

Let g:R->R be a function and let h>0, and define the cardinal series of g with respect to the interval h as the formal series sum_(k=-infty)^inftyg(kh)sinc((x-kh)/h), where ...

Let A and B be any sets. Then the product of |A| and |B| is defined as the Cartesian product |A|*|B|=|A×B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; Moore 1982, p. 37; ...