TOPICS
Search

Search Results for ""


691 - 700 of 1780 for SetsSearch Results
A sentence is a logic formula in which every variable is quantified. The concept of a sentence is important because formulas with variables that are not quantified are ...
An array B=b_(ij), i,j>=1 of positive integers is called a dispersion if 1. The first column of B is a strictly increasing sequence, and there exists a strictly increasing ...
A sheaf is a presheaf with "something" added allowing us to define things locally. This task is forbidden for presheaves in general. Specifically, a presheaf F on a ...
Let f_1(z), ..., f_m(z) for m>=1 be a set of E-functions that (1) form a solution of the system of differential equations y_k^'=q_(k0)+sum_(j=1)^mq_(kj)y_j for q_(kj) in C(z) ...
Let X be a set. Then a sigma-algebra F is a nonempty collection of subsets of X such that the following hold: 1. X is in F. 2. If A is in F, then so is the complement of A. ...
Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n, {w_1,...,w_n} and each women has done ...
The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...
An ultrametric is a metric which satisfies the following strengthened version of the triangle inequality, d(x,z)<=max(d(x,y),d(y,z)) for all x,y,z. At least two of d(x,y), ...
Let L be a language of first-order predicate logic, let I be an indexing set, and for each i in I, let A_i be a structure of the language L. Let u be an ultrafilter in the ...
There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...
1 ... 67|68|69|70|71|72|73 ... 178 Previous Next

...