Find link

language:

Find link is a tool written by Edward Betts.

searching for Unary function 31 found (43 total)

FOSD origami (1,234 words) [view diff] no match in snippet view article find links to article

implements a parser for Java, PG is a unary-function that extends a Java parser to parse generics, and PS is a unary-function that extends a Java parser to parse

Extension by definitions (1,453 words) [view diff] exact match in snippet view article find links to article

⊆{\displaystyle \subseteq }, the constant ∅{\displaystyle \emptyset }, the unary function symbol P (the power set operation), etc. All of these symbols belong

Decidability (logic) (1,901 words) [view diff] exact match in snippet view article

first-order logical validities in a signature with equality and one unary function, established by Ehrenfeucht in 1959. The first-order theory of the natural

Axiom of global choice (458 words) [view diff] exact match in snippet view article find links to article

choice (in fact, [ZFC proves that] in the language extended by the unary function symbol τ, the axiom of constructibility implies that if τ is said explicitly

Herbrand structure (495 words) [view diff] exact match in snippet view article find links to article

theory T is called a Herbrand model of T. For a constant symbol c and a unary function symbol f(.) we have the following interpretation: U = {c, fc, ffc, fffc

Term (logic) (2,807 words) [view diff] exact match in snippet view article

function symbol sets Fn are inhabited. Well-known examples are the unary function symbols sin, cos ∈ F1, and the binary function symbols +, −, ⋅, / ∈

Structure (mathematical logic) (5,097 words) [view diff] exact match in snippet view article

\mathbf {\times } } where additional symbols can be derived, such as a unary function symbol − {\displaystyle \mathbf {-} } (uniquely determined by + {\displaystyle

Ground expression (660 words) [view diff] exact match in snippet view article find links to article

0} and 1 {\displaystyle 1} for the numbers 0 and 1, respectively, a unary function symbol s {\displaystyle s} for the successor function and a binary function

Tarski's exponential function problem (541 words) [view diff] exact match in snippet view article find links to article

\varphi .} He then asked whether this was still the case if one added a unary function exp to the language that was interpreted as the exponential function

Formula (1,306 words) [view diff] exact match in snippet view article find links to article

Q(f(y),x,z)))} is a formula, provided that f {\displaystyle f} is a unary function symbol, P {\displaystyle P} a unary predicate symbol, and Q {\displaystyle

Spectrum of a sentence (1,332 words) [view diff] exact match in snippet view article find links to article

periodic sets is the set of spectra of monadic second-order logic with a unary function. It is also the set of spectra of monadic second-order logic with the

Grzegorczyk hierarchy (1,578 words) [view diff] exact match in snippet view article find links to article

E_{0}} is the addition function, and E 1 {\displaystyle E_{1}} is a unary function which squares its argument and adds two. Then, for each n greater than

Hylomorphism (computer science) (716 words) [view diff] exact match in snippet view article

catamorphic parts. The anamorphic part can be defined in terms of a unary function g : A → B × A {\displaystyle g:A\rightarrow B\times A} defining the

Arity (1,278 words) [view diff] exact match in snippet view article find links to article

function takes no arguments. Example: f ( ) = 2 {\displaystyle f()=2} A unary function takes one argument. Example: f ( x ) = 2 x {\displaystyle f(x)=2x} A

Subsumption lattice (703 words) [view diff] exact match in snippet view article find links to article

no infinite ascending ones. If f is a binary function symbol, g is a unary function symbol, and x and y denote variables, then the terms f(x,y), f(g(x)

First-order logic (13,173 words) [view diff] exact match in snippet view article find links to article

y(P(f(x))\rightarrow \neg (P(x)\rightarrow Q(f(y),x,z)))} is a formula, if f is a unary function symbol, P a unary predicate symbol, and Q a ternary predicate symbol

Axiomatic system (1,936 words) [view diff] exact match in snippet view article find links to article

Giuseppe Peano in 1889. He chose the axioms, in the language of a single unary function symbol S (short for "successor"), for the set of natural numbers to

Equivalent definitions of mathematical structures (3,272 words) [view diff] exact match in snippet view article find links to article

of the same signature (0,S) consisting of a constant symbol 0 and a unary function S. An ordered semiring structure (N, +, ·, ≤) has another signature

Differentially closed field (1,092 words) [view diff] exact match in snippet view article find links to article

eliminates quantifiers in the language of differential fields with a unary function r added that is the pth root of all constants, and is 0 on elements

Comparison of programming languages (functional programming) (275 words) [view diff] exact match in snippet view article

the same as func1, also known as a projection in many languages. pred Unary function returning a Boolean value. (ML type: 'a -> bool) (C-like type: bool

Polish notation (2,434 words) [view diff] exact match in snippet view article find links to article

(here the "−" denotes the binary operation of subtraction, not the unary function of sign-change), any well-formed prefix representation is unambiguous

Second-order arithmetic (3,801 words) [view diff] exact match in snippet view article find links to article

individual variables. Individual terms are formed from the constant 0, the unary function S (the successor function), and the binary operations + and ⋅{\displaystyle

Rewriting (4,374 words) [view diff] exact match in snippet view article find links to article

undecidable. Termination is also undecidable for systems using only unary function symbols; however, it is decidable for finite ground systems. The following

Ordinal notation (1,860 words) [view diff] exact match in snippet view article find links to article

zero can be described. The most obvious next step would be to define a unary function, "S", which takes an ordinal to the smallest ordinal greater than it;

Peano axioms (6,324 words) [view diff] exact match in snippet view article find links to article

non-logical symbols for the axioms consist of a constant symbol 0 and a unary function symbol S. The first axiom states that the constant 0 is a natural number:

Primitive recursive function (6,152 words) [view diff] exact match in snippet view article find links to article

primitive recursive. Suppose ev were primitive recursive, then the unary function g defined by g(i) = S(ev(i,i)) would also be primitive recursive, as

Rice–Shapiro theorem (2,353 words) [view diff] exact match in snippet view article find links to article

we have φp = U(k), and we know that (U(k) ∈ P) ≠ B. For any finite unary function θ{\displaystyle \theta } on integers, let C(θ){\displaystyle C(\theta

Automatic differentiation (6,047 words) [view diff] exact match in snippet view article find links to article

the adjoint; fanout in the primal causes addition in the adjoint; a unary function y = f(x) in the primal causes x̄ = ȳ f′(x) in the adjoint; etc. Reverse

Proof sketch for Gödel's first incompleteness theorem (2,995 words) [view diff] exact match in snippet view article find links to article

collection of 15 (and only 15) symbols: A constant symbol 0 for zero. A unary function symbol S for the successor operation and two binary function symbols

C++11 (13,071 words) [view diff] no match in snippet view article find links to article

been superseded by std::unique_ptr. Function object base classes (std::unary_function, std::binary_function), adapters to pointers to functions and adapters

Construction of t-norms (3,442 words) [view diff] exact match in snippet view article find links to article

The method of constructing t-norms by generators consists in using a unary function (generator) to transform some known binary function (most often, addition