Search Results for ""
2081 - 2090 of 13134 for Graph TheorySearch Results
If f is a continuous real-valued function on [a,b] and if any epsilon>0 is given, then there exists a polynomial p on [a,b] such that |f(x)-P(x)|<epsilon for all x in [a,b]. ...
Every nonempty set of positive integers contains a smallest member.
Let phi(x_1,...,x_m) be an L_(exp) formula, where L_(exp)=L union {e^x} and L is the language of ordered rings L={+,-,·,<,0,1}. Then there exist n>=m and f_1,...,f_s in ...
A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.
The axiom of Zermelo-Fraenkel set theory which asserts the existence of a set containing all the natural numbers, exists x(emptyset in x ^ forall y in x(y^' in x)), where ...
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; ...
A Dedekind ring is a commutative ring in which the following hold. 1. It is a Noetherian ring and a integral domain. 2. It is the set of algebraic integers in its field of ...
A Lie group is a group with the structure of a manifold. Therefore, discrete groups do not count. However, the most useful Lie groups are defined as subgroups of some matrix ...
A field which is complete with respect to a discrete valuation is called a local field if its field of residue classes is finite. The Hasse principle is one of the chief ...
A normalizer of a nontrivial Sylow p-subgroup of a group G.
...
View search results from all Wolfram sites (33872 matches)

