Search Results for ""

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).

The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers aleph_0 and the "large" ...

The set theory symbol aleph_0 refers to a set having the same cardinal number as the "small" infinite set of integers. The symbol aleph_0 is often pronounced "aleph-null" ...

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...

The Zermelo-Fraenkel axioms are the basis for Zermelo-Fraenkel set theory. In the following (Jech 1997, p. 1), exists stands for exists, forall means for all, in stands for ...

Informally, the sample space for a given set of events is the set of all possible values the events may assume. Formally, the set of possible events for a given random ...

An "area" which can be defined for every set--even those without a true geometric area--which is rigid and finitely additive.

A puzzle in logic in which one or more facts must be inferred from a set of given facts.

S_n=sum_(i)eta_imu(E_i), where mu(E_i) is the measure of the set E_i of points on the x-axis for which f(x) approx eta_i.