- representable function
- мат. представимая функция
Большой англо-русский и русско-английский словарь. 2001.
representable function
Смотреть что такое "representable function" в других словарях:
Representable functor — In mathematics, especially in category theory, a representable functor is a functor of a special form from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i … Wikipedia
representable functor — noun Given a category C, a covariant representable functor h sends each object X in category C to C(A,X), the set of arrows from A to X, and sends each arrow f:X rarr; Y to a function from C(A,X) to C(A,Y) which maps each element s of C(A,X) to… … Wiktionary
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
Polygamma function — In mathematics, the polygamma function of order m is defined as the ( m + 1)th derivative of the logarithm of the gamma function::psi^{(m)}(z) = left(frac{d}{dz} ight)^m psi(z) = left(frac{d}{dz} ight)^{m+1} lnGamma(z).Here :psi(z) =psi^{(0)}(z) … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Floating point — In computing, floating point describes a method of representing real numbers in a way that can support a wide range of values. Numbers are, in general, represented approximately to a fixed number of significant digits and scaled using an exponent … Wikipedia
Rounding — This article is about numerical rounding. For lip rounding in phonetics, see Labialisation. For other uses, see Rounding (disambiguation). Rounding a numerical value means replacing it by another value that is approximately equal but has a… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
