(mathematics) A statement in algebraic geometry concerning the number of common zeros of n polynomials in n indeterminates. In its original form, the theorem states that in general the number of common zeros equals the product of the degrees of the polynomials.

Alternative form of Pythagorean theorem

Abbreviation of Kochen-Specker theorem.

(set theory) A theorem in set theory which states for any set A, the set of all subsets of A (the power set of A, denoted by 𝒫(A)) has a strictly greater cardinality than A itself.

(mathematics) A theorem proving that it is always possible to tile a chessboard with dominoes if two squares of opposite colors are first removed from the board.

(geometry) A theorem that states in a cyclic quadrilateral, the product of the lengths of its diagonals is equal to the sum of the products of the lengths of the two pairs of opposite sides.

(mathematics) A theorem about triangles in plane geometry, regards the ratio of the side lengths of a triangle divided by cevians.

(logic) A fundamental result of mathematical logic, essentially allowing a certain kind of reduction of first-order logic to propositional logic.

(mathematics) A theorem stating that every computably enumerable set is a Diophantine set, and the converse.

Synonym of Matiyasevich's theorem