Search Results for ""

The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...

Let G be a group and S be a set. Then S is called a left G-set if there exists a map phi:G×S->S such that phi(g_1,phi(g_2,s))=phi(g_1g_2,s) for all s in S and all g_1,g_2 in ...

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

The name for the set of integers modulo m, denoted Z/mZ. If m is a prime p, then the modulus is a finite field F_p=Z/pZ.

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

The nth Suzanne set S_n is defined as the set of composite numbers x for which n|S(x) and n|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) = ...

One of the disjoint subsets making up a set partition. A block containing n elements is called an n-block. The partitioning of sets into blocks can be denoted using a ...

A recursively enumerable set A is creative if its complement is productive. Creative sets are not recursive. The property of creativeness coincides with completeness. Namely, ...

A set in which no element divides the sum of any nonempty subset of the other elements. For example, {2,3,5} is dividing, since 2|(3+5) (and 5|(2+3)), but {4,6,7} is ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...