Basis theorem — can refer to:* Hilbert s basis theorem, in algebraic geometry * Low basis theorem, in computability theory … Wikipedia
Low (computability) — In computability theory, a Turing degree [ X ] is low if the Turing jump [ X prime;] is 0 prime;, which is the least possible degree in terms of Turing reducibility for the jump of a set. Since every set is computable from its jump, any low set… … Wikipedia
Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… … Wikipedia
Bell's theorem — is a theorem that shows that the predictions of quantum mechanics (QM) are not intuitive, and touches upon fundamental philosophical issues that relate to modern physics. It is the most famous legacy of the late physicist John S. Bell. Bell s… … Wikipedia
Coase theorem — In law and economics, the Coase theorem (pronounced /ˈkoʊs/), attributed to Ronald Coase, describes the economic efficiency of an economic allocation or outcome in the presence of externalities. The theorem states that if trade in an externality… … Wikipedia
Balian-Low theorem — In mathematics, the Balian Low theorem in Fourier analysis is named for Roger Balian and Francis E. Low.Suppose g is a square integrable function on the real line, and consider the so called Gabor system :g {m,n}(x) = e^{2pi i m x} g(x n),for… … Wikipedia
Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… … Wikipedia
PA degree — In recursion theory, a mathematical discipline, a PA degree is a Turing degree that computes a complete extension of Peano arithmetic (Jockusch 1987). These degrees are closely related to fixed point free (DNR) functions, and have been thoroughly … Wikipedia
