(computing theory) A theorem that establishes a limit on the extent to which an algorithm can decide whether certain mathematical expressions are equal.

(mathematics) A theorem stating that, if S, is an IP set and S=C_1∪C_2∪...∪C_n, then at least one C_i, contains an IP set.

(graph theory) A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.

plural of Tauberian theorem

(mathematical analysis) Any of a class of theorems which, for a given Abelian theorem, specifies conditions such that any series whose Abel sums converge (as stipulated by the Abelian theorem) is in fact convergent.

(chiefly mathematics) A theorem (or, in non-mathematical fields, a commonly accepted hypothesis) considered to be of central importance to a specified field.

plural of fundamental theorem

(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.

(physics) A theorem stating that the energy eigenstates for an electron in a crystal can be written as Bloch waves.

(mathematics) A theorem that gives a lower bound on the size of a disc in which an inverse to a holomorphic function exists.