**reducibility** — reducibility, axiom of … Philosophy dictionary

**Axiom of reducibility** — The axiom of reducibility was introduced by Bertrand Russell as part of his ramified theory of types, an attempt to ground mathematics in first order logic.The axiom of reducibility is introduced in number (chapter) *12 of Principia Mathematica… … Wikipedia

**reducible** — reducibility, axiom of … Philosophy dictionary

**List of mathematics articles (A)** — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A … Wikipedia

**List of philosophy topics (A-C)** — 110th century philosophy 11th century philosophy 12th century philosophy 13th century philosophy 14th century philosophy 15th century philosophy 16th century philosophy 17th century philosophy 18th century philosophy 19th century philosophy220th… … Wikipedia

**аксиома сходимости** — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN reducibility axiom … Справочник технического переводчика

**Function (mathematics)** — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia

**Logicism** — is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.[1] Bertrand Russell and Alfred North Whitehead… … Wikipedia

**Principia Mathematica** — For Isaac Newton s book containing basic laws of physics, see Philosophiæ Naturalis Principia Mathematica. The title page of the shortened version of the Principia Mathematica to *56. The Principia Mathematica is a three volume work on the… … Wikipedia

**Computability theory** — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia