This is a list of symbols found within all branches of mathematics to express a formula or to represent a constant.When reading the list, it is important to recognize that a mathematical concept is in ...
Axiomatic set theoryIn 1931, Kurt G?del proved the first ZFC undecidability result, namely that the consistency of ZFC itself was undecidable in ZFC.Moreover the following statements are independent ...
Fundamental theorem of algebraFundamental theorem of algebraic K-theoryFundamental theorem of algebraic number theoryFundamental theorem of arithmeticFundamental theorem of calculusFundamental theorem ...
Fundamental lemma of calculus of variationsFundamental lemma of Langlands and ShelstadFundamental lemma of sieve theoryFeinstein's fundamental lemma (information theory)Fundamental lemma of interpolat ...
The fundamental theorem of a field of mathematics is the theorem considered central to that field. The naming of such a theorem is not necessarily based on how often it is used or the difficulty of it ...
Problems in logicHilbert's Entscheidungsproblem.Type inference and type checking for the second-order lambda calculus (or equivalent).Problems about abstract machinesThe halting problem (determining w ...
In computability theory, an undecidable problem is of a type of calculation which requires a yes/no answer, but where there can not possibly be any computer program that always gives the correct answe ...
Symbolin HTML Symbolin TEX Name Explanation ExamplesRead asCategory== equalityis equal to;equalseverywherex = y means x and y represent the same thing or value. 2 = 21 + 1 = 2≠\ne inequalityis not eq ...
This is a list of symbols found within all branches of mathematics to express a formula or to represent a constant.When reading the list, it is important to recognize that a mathematical concept is in ...
In 1931, Kurt G?del proved the first ZFC undecidability result, namely that the consistency of ZFC itself was undecidable in ZFC.Moreover the following statements are independent of ZFC (shown by Pau ...
The mathematical statements discussed below are provably undecidable in ZFC (the Zermelo–Fraenkel axioms plus the axiom of choice, the canonical axiomatic set theory of contemporary mathematics), ass ...
Graphs and hypergraphsGraphs occur frequently in everyday applications. Examples include biological or social networks, which contain hundreds, thousands and even billions of nodes in some cases (see ...
Theorems of which articles are primarily devoted to proving themSee also: Category:Article proofsBertrand's postulate and a proofEstimation of covariance matricesFermat's little theorem and some proof ...
This following is a list of lemmas (or, "lemmata", i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list of axioms, list of theorems and list of conje ...
