**impredicative definitions** — impredicative definition … Philosophy dictionary

**impredicative** — … Useful english dictionary

**impredicative definition** — Term coined by Poincaré ; for a kind of definition in which a member of a set is defined in a way that presupposes the set taken as a whole. Poincaré believed that paradoxes like those of Russell and the barber were due to such definitions, and… … Philosophy dictionary

**Impredicativity** — In mathematics and logic, impredicativity is the property of a self referencing definition. More precisely, a definition is said to be impredicative if it invokes another set which contains the thing being defined.Russell s paradox is a famous… … 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

**Type polymorphism** — In computer science, polymorphism is a programming language feature that allows values of different data types to be handled using a uniform interface. The concept of parametric polymorphism applies to both data types and functions. A function… … Wikipedia

**mathematics, foundations of** — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium

**Morse–Kelley set theory** — In the foundation of mathematics, Morse–Kelley set theory (MK) or Kelley–Morse set theory (KM) is a first order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory … Wikipedia

**Ordinal collapsing function** — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger … 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