Search Results for ""
271 - 280 of 865 for Goedels Incompleteness TheoremsSearch Results
van der Waerden's theorem is a theorem about the existence of arithmetic progressions in sets. The theorem can be stated in four equivalent forms. 1. If N=C_1 union C_2 union ...
The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...
If X and Y are independent variates and X+Y is a normal distribution, then both X and Y must have normal distributions. This was proved by Cramér in 1936.
Let f(z) be an analytic function in |z-a|<R. Then f(z)=1/(2pi)int_0^(2pi)f(z+re^(itheta))dtheta for 0<r<R.
Let K_1^n and K_2^n be disjoint bicollared knots in R^(n+1) or S^(n+1) and let U denote the open region between them. Then the closure of U is a closed annulus S^n×[0,1]. ...
A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...
A line segment joining the midpoints of opposite sides of a quadrilateral or tetrahedron. Varignon's theorem states that the bimedians of a quadrilateral bisect each other ...
The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...
Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...
Relates invariants of a curve defined over the integers. If this inequality were proven true, then Fermat's last theorem would follow for sufficiently large exponents. ...
...
View search results from all Wolfram sites (3664 matches)

