(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

(number theory) A theorem stating that, given a fixed base b, the set of numbers that are the sum of a prime and a positive integer power of b has a positive lower asymptotic density.

A theorem stating that, for a thermodynamic system exchanging heat with external reservoirs and undergoing a thermodynamic cycle, ∮(𝛿Q)/(T_surr)≤0,, where 𝛿Q is the infinitesimal amount of heat absorbed by the system from the reservoir, and T_surr is the temperature of the external reservoir (surroundings) at a particular instant in time.

(geometry) A statement in Euclidean geometry that deals with the construction of a particular parallelogram (the Varignon parallelogram) from an arbitrary quadrilateral.

(mathematics) Any of a collection of theorems of finite group theory that give detailed information about the number of subgroups of fixed order that a given finite group contains.

plural of Sylow theorem

(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.

(mathematics) In additive combinatorics, a central result that indicates the approximate structure of sets whose sumset is small. It roughly states that if |A+A|/|A| is small, then A can be contained in a small generalized arithmetic progression.