- un(it)ary operator
-
унарный [одноместный\] оператор
Англо-русский словарь технических терминов. 2005.
un(it)ary operator
Смотреть что такое "un(it)ary operator" в других словарях:
μ operator — In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Contents 1 Definition 2 Properties 3 Examples … Wikipedia
Μ operator — In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Definition Suppose that R( y, x1 , . . ., xk ) is a fixed k+1 ary relation on the natural… … Wikipedia
Minimal negation operator — In logic and mathematics, the minimal negation operator u! is a multigrade operator ( u {k}) {k in mathbb{N where each u {k}! is a k ary boolean function defined in such a way that u {k}(x 1, ldots , x k) = 1 if and only if exactly one of the… … Wikipedia
Hutchinson operator — In mathematics, in the study of fractals, a Hutchinson operator is a collection of functions on an underlying space E . The iteration on these functions gives rise to an iterated function system, for which the fixed set is self… … Wikipedia
Logical connective — This article is about connectives in classical logic. For connectors in natural languages, see discourse connective. For connectives and operators in other logics, see logical constant. For other logical symbols, see table of logic symbols. In… … Wikipedia
Semantics encoding — A semantics encoding is a translation between formal languages. For programmers, the most familiar form of encoding is the compilation of a programming language into machine code or byte code. Conversion between document formats are also forms of … Wikipedia
Arity — In logic, mathematics, and computer science, the arity i/ˈær … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Unicode-Block Mathematische Operatoren — Der Unicode Block Mathematical Operators (Mathematische Operatoren) (2200–22FF) enthält verschiedene in mathematischen Texten verwendete Zeichen, vor allem Symbole mathematischer Operatoren, unter anderem aus dem Bereich der Mengenlehre und der… … Deutsch Wikipedia
μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
