In mathematics, a function associates one quantity, the ''argument'' of the function, also known as the ''input'', with another quantity, the ''value'' of the function, also known as the ''output''. A function assigns exactly one output to each input. The argument and the value may be real numbers, but they can also be elements from any given set. An example of a function is ''f''(''x'') = 2''x'', a function which associates with every number the number twice as large. Thus, with the argument 5 the value 10 is associated, and this is written ''f''(5) = 10.

The input to a function need not be a number, it can be any well defined object. For example, a function might associate the letter A with the number 1, the letter B with the number 2, and so on. There are many ways to describe or represent a function, such as a formula or algorithm that computes the output for a given input, a graph that gives a picture of the function, or a table of values that gives the output for certain specified inputs. Tables of values are especially common in statistics, science, and engineering.

The set of all inputs to a particular function is called the domain. In modern mathematics functions are normally defined to have a codomain associated with them which is some fixed set which includes all possible outputs, for instance real valued functions have a codomain which includes all the real numbers even though each particular real valued function may not include every real number as an output. The set of all the ordered pairs or inputs and outputs (''x'', ''f''(''x'')) of a function is called its graph. A common way to define a function is as the triple (domain, codomain, graph), that is as the input set, the possible outputs and the mapping for each input to its output.

The set of all outputs of a particular function is called its image. The word range is used in some texts to refer to the image and in others to the codomain, in particular in computing it often refers to the codomain. The domain and codomain are often "understood." Thus for the example given above, ''f''(''x'') = 2''x'', the domain and codomain were not stated explicitly. They might both be the set of all real numbers, but they might also be the set of integers. If the domain is the set of integers, then image consists of just the even integers.

A function may sometimes be described through its relationship to other functions, for example, as the inverse function of a given function, or as a solution of a differential equation. Functions can be added, multiplied, or combined in other ways to produce new functions. An important operation on functions, which distinguishes them from numbers, is the composition of functions. There are uncountably many different functions, most of which cannot be expressed with a formula or an algorithm.

Collections of functions with certain properties, such as continuous functions and differentiable functions, are called function spaces and are studied as objects in their own right, in such mathematical disciplines as real analysis and complex analysis.

Overview

Because functions are so widely used, many traditions have grown up around their use. The symbol for the input to a function is often called the independent variable or argument and is often represented by the letter ''x'' or, if the input is a particular time, by the letter ''t''. The symbol for the output is called the dependent variable or value and is often represented by the letter ''y''. The function itself is most often called ''f'', and thus the notation ''y'' = ''f''(''x'') indicates that a function named ''f'' has an input named ''x'' and an output named ''y''.

The set of all permitted inputs to a given function is called the domain of the function. The set of all resulting outputs is called the image or range of the function. The image is often a subset of some larger set, called the codomain of a function. Thus, for example, the function ''f''(''x'') = ''x''² could take as its domain the set of all real numbers, as its image the set of all non-negative real numbers, and as its codomain the set of all real numbers. In that case, we would describe ''f'' as a real-valued function of a real variable. Sometimes, especially in computer science, the term "range" refers to the codomain rather than the image, so care needs to be taken when using the word.

It is usual practice in mathematics to introduce functions with temporary names like ƒ. For example, ƒ(''x'') = 2''x''+1, implies ƒ(3) = 7; when a name for the function is not needed, the form ''y'' =  may be used. If a function is often used, it may be given a more permanent name as, for example, :$\backslash operatorname\{Square\}(x)\; =\; x^2\; .\; \backslash ,\backslash !$

Functions need not act on numbers: the domain and codomain of a function may be arbitrary sets. One example of a function that acts on non-numeric inputs takes English words as inputs and returns the first letter of the input word as output. Furthermore, functions need not be described by any expression, rule or algorithm: indeed, in some cases it may be impossible to define such a rule. For example, the association between inputs and outputs in a choice function often lacks any fixed rule, although each input element is still associated to one and only one output.

A function of two or more variables is considered in formal mathematics as having a domain consisting of ordered pairs or tuples of the argument values. For example Sum(''x'',''y'') = ''x''+''y'' operating on integers is the function Sum with a domain consisting of pairs of integers. Sum then has a domain consisting of elements like (3,4), a codomain of integers, and an association between the two that can be described by a set of ordered pairs like ((3,4), 7). Evaluating Sum(3,4) then gives the value 7 associated with the pair (3,4).

A family of objects indexed by a set is equivalent to a function. For example, the sequence ''1, 1/2, 1/3, ..., 1/n, ...'' can be written as the ordered sequence ''<1/n>'' where ''n'' is a natural number, or as a function f(n) = 1/n from the set of natural numbers into the set of rational numbers.

Definition

One precise definition of a function is an ordered triple of sets, written (''X'', ''Y'', ''F''), where ''X'' is the domain, ''Y'' is the codomain, and ''F'' is a set of ordered pairs (''a'', ''b''). In each of the ordered pairs, the first element ''a'' is from the domain, the second element ''b'' is from the codomain, and a necessary condition is that every element in the domain is the first element in exactly one ordered pair. The set of all ''b'' is known as the image of the function, and need not be the whole of the codomain. Most authors use the term "range" to mean the image, while some use "range" to mean the codomain.

The notation ƒ:''X''→''Y'' indicates that ƒ is a function with domain ''X'' and codomain ''Y'', and the function ''f'' is said to ''map'' or ''associate'' elements of ''X'' to elements of ''Y''.

If the domain and codomain are both the set of real numbers, using the ordered triple scheme we can, for example, write the function $y\; =\; x^2$ as :$\backslash left(\; \backslash mathbb\{R\},\; \backslash mathbb\{R\},\; \backslash left\backslash \{\; \backslash left(\; x,\; x^2\backslash right)\; :\; x\; \backslash in\; \backslash mathbb\{R\}\; \backslash right\backslash \}\; \backslash right)$, In most situations, the domain and codomain are understood from context, and only the relationship between the input and output is given.

In set theory especially, a function ''f'' is often defined as a set of ordered pairs, with the property that if $(x,a)$ and $(x,b)$ are in ''f'', then $a\; =\; b$. In this case statements such as $(2,3)$ є ''f'' are appropriate when, say, ''f'' is defined by $f(x)\; =\; x\; +\; 1$, for all x є R.

The graph of a function is its set of ordered pairs. Part of such a set can be plotted on a pair of coordinate axes; for example, (3, 9), the point above 3 on the horizontal axis and to the right of 9 on the vertical axis, lies on the graph of $y\; =\; x^2$.

A specific input in a function is called an argument of the function. For each argument value ''x'', the corresponding unique ''y'' in the codomain is called the function value at ''x'', output of ƒ for an argument ''x'', or the image of ''x'' under ƒ. The image of ''x'' may be written as ƒ(''x'') or as ''y''.

A function can also be called a map or a mapping. Some authors, however, use the terms "function" and "map" to refer to different types of functions. Other specific types of functions include functionals and operators.

A function is a special case of a more general mathematical concept, the relation, for which the restriction that each element of the domain appear as the first element in one and only one ordered pair is removed. In other words, an element of the domain may not be the first element of any ordered pair, or may be the first element of two or more ordered pairs. A relation is "single-valued" when if an element of the domain is the first element of one ordered pair, it is not the first element of any other ordered pair. A relation is "left-total" or simply "total" if every element of the domain is the first element of some ordered pair. Thus a function is a total, single-valued relation.

In some parts of mathematics, including recursion theory and functional analysis, it is convenient to study partial functions in which some values of the domain have no association in the graph; i.e., single-valued relations. For example, the function ''f'' such that ''f''(''x'') = 1/''x'' does not define a value for ''x'' = 0, and so is only a partial function from the real line to the real line. The term ''total function'' can be used to stress the fact that every element of the domain does appear as the first element of an ordered pair in the graph. In other parts of mathematics, non-single-valued relations are similarly conflated with functions: these are called multivalued functions, with the corresponding term single-valued function for ordinary functions.

Many operations in set theory, such as the power set, have the class of all sets as their domain, and therefore, although they are informally described as functions, they do not fit the set-theoretical definition outlined above, because a class is not necessarily a set.

Notation

Formal description of a function typically involves the function's name, its domain, its codomain, and a rule of correspondence. Thus we frequently see a two-part notation, an example being : where the first part is read:

"ƒ is a function from N to R" (one often writes informally "Let ƒ: ''X'' → ''Y''" to mean "Let ƒ be a function from ''X'' to ''Y''"), or

"ƒ is a function on N into R", or

"ƒ is an R-valued function of an N-valued variable",

and the second part is read:

$n\; \backslash ,$ maps to $\backslash frac\{n\}\{\backslash pi\}.\; \backslash ,\backslash !$

Here the function named "ƒ" has the natural numbers as domain, the real numbers as codomain, and maps ''n'' to itself divided by π. Less formally, this long form might be abbreviated : $f(n)\; =\; \backslash frac\{n\}\{\backslash pi\}\; ,\; \backslash ,\backslash !$ where ''f''(''n'') is read as "f as function of n" or "f of n". There is some loss of information: we no longer are explicitly given the domain N and codomain R.

It is common to omit the parentheses around the argument when there is little chance of confusion, thus: sin ''x''; this is known as prefix notation. Writing the function after its argument, as in ''x'' ƒ, is known as postfix notation; for example, the factorial function is customarily written ''n''!, even though its generalization, the gamma function, is written Γ(''n''). Parentheses are still used to resolve ambiguities and denote precedence, though in some formal settings the consistent use of either prefix or postfix notation eliminates the need for any parentheses.

Functions with multiple inputs and outputs

The concept of function can be extended to an object that takes a combination of two (or more) argument values to a single result. This intuitive concept is formalized by a function whose domain is the Cartesian product of two or more sets.

For example, consider the function that associates two integers to their product: ƒ(''x'', ''y'') = ''x''·''y''. This function can be defined formally as having domain Z×Z , the set of all integer pairs; codomain Z; and, for graph, the set of all pairs ((''x'',''y''), ''x''·''y''). Note that the first component of any such pair is itself a pair (of integers), while the second component is a single integer.

The function value of the pair (''x'',''y'') is ƒ((''x'',''y'')). However, it is customary to drop one set of parentheses and consider ƒ(''x'',''y'') a function of two variables, ''x'' and ''y''. Functions of two variables may be plotted on the three-dimensional Cartesian as ordered triples of the form (''x'',''y'',''f''(''x'',''y'')).

The concept can still further be extended by considering a function that also produces output that is expressed as several variables. For example, consider the integer divide function, with domain Z×N and codomain Z×N. The resultant (quotient, remainder) pair is a single value in the codomain seen as a Cartesian product.

Currying

An alternative approach to handling functions with multiple arguments is to transform them into a chain of functions that each takes a single argument. For instance, one can interpret Add(3,5) to mean "first produce a function that adds 3 to its argument, and then apply the 'Add 3' function to 5". This transformation is called currying: Add 3 is curry(Add) applied to 3. There is a bijection between the function spaces ''C''^''A''×''B'' and (''C''^''B'')^''A''.

When working with curried functions it is customary to use prefix notation with function application considered left-associative, since juxtaposition of multiple arguments—as in (ƒ ''x'' ''y'')—naturally maps to evaluation of a curried function. Conversely, the → and ⟼ symbols are considered to be right-associative, so that curried functions may be defined by a notation such as ƒ: Z → Z → Z = ''x'' ⟼ ''y'' ⟼ ''x''·''y''

Binary operations

The familiar binary operations of arithmetic, addition and multiplication, can be viewed as functions from R×R to R. This view is generalized in abstract algebra, where ''n''-ary functions are used to model the operations of arbitrary algebraic structures. For example, an abstract group is defined as a set ''X'' and a function ƒ from ''X''×''X'' to ''X'' that satisfies certain properties.

Traditionally, addition and multiplication are written in the infix notation: ''x''+''y'' and ''x''×''y'' instead of +(''x'', ''y'') and ×(''x'', ''y'').

Injective and surjective functions

Three important kinds of function are the injections (or one-to-one functions), which have the property that if ƒ(''a'') = ƒ(''b'') then ''a'' must equal ''b''; the surjections (or onto functions), which have the property that for every ''y'' in the codomain there is an ''x'' in the domain such that ƒ(''x'') = ''y''; and the bijections, which are both one-to-one and onto. This nomenclature was introduced by the Bourbaki group.

When the definition of a function by its graph only is used, since the codomain is not defined, the "surjection" must be accompanied with a statement about the set the function maps onto. For example, we might say ƒ maps onto the set of all real numbers.

Function composition

The function composition of two or more functions takes the output of one or more functions as the input of others. The functions ƒ: ''X'' → ''Y'' and ''g'': ''Y'' → ''Z'' can be ''composed'' by first applying ƒ to an argument ''x'' to obtain ''y'' = ƒ(''x'') and then applying ''g'' to ''y'' to obtain ''z'' = ''g''(''y''). The composite function formed in this way from general ƒ and ''g'' may be written :

This notation follows the form such that :$(g\backslash circ\; f)(x)\; =\; g(f(x)).\backslash$

The function on the right acts first and the function on the left acts second, reversing English reading order. We remember the order by reading the notation as "''g'' of ƒ". The order is important, because rarely do we get the same result both ways. For example, suppose ƒ(''x'') = ''x''² and ''g''(''x'') = ''x''+1. Then ''g''(ƒ(''x'')) = ''x''²+1, while ƒ(''g''(''x'')) = (''x''+1)², which is ''x''²+2''x''+1, a different function.

In a similar way, the function given above by the formula ''y'' = 5''x''−20''x''³+16''x''⁵ can be obtained by composing several functions, namely the addition, negation, and multiplication of real numbers.

An alternative to the colon notation, convenient when functions are being composed, writes the function name above the arrow. For example, if ƒ is followed by ''g'', where ''g'' produces the complex number ''e''^i''x'', we may write : $\backslash mathbb\{N\}\; \backslash xrightarrow\{f\}\; \backslash mathbb\{R\}\; \backslash xrightarrow\{g\}\; \backslash mathbb\{C\}\; .\; \backslash ,\backslash !$ A more elaborate form of this is the commutative diagram.

Identity function

The unique function over a set ''X'' that maps each element to itself is called the identity function for ''X'', and typically denoted by id_''X''. Each set has its own identity function, so the subscript cannot be omitted unless the set can be inferred from context. Under composition, an identity function is "neutral": if ƒ is any function from ''X'' to ''Y'', then :

===Restrictions and extensions=== Informally, a restriction of a function ƒ is the result of trimming its domain.

More precisely, if ƒ is a function from a ''X'' to ''Y'', and ''S'' is any subset of ''X'', the restriction of ƒ to ''S'' is the function ƒ|_''S'' from ''S'' to ''Y'' such that ƒ|_''S''(''s'') = ƒ(''s'') for all ''s'' in ''S''.

If ''g'' is a restriction of ƒ, then it is said that ƒ is an extension of ''g''.

The overriding of ''f'': ''X'' → ''Y'' by ''g'': ''W'' → ''Y'' (also called overriding union) is an extension of ''g'' denoted as (''f'' ⊕ ''g''): (''X'' ∪ ''W'') → Y. Its graph is the set-theoretical union of the graphs of ''g'' and ''f''|_{''X'' \ ''W''}. Thus, it relates any element of the domain of ''g'' to its image under ''g'', and any other element of the domain of ''f'' to its image under ''f''. Overriding is an associative operation; it has the empty function as an identity element. If ''f''|_{''X'' ∩ ''W''} and ''g''|_{''X'' ∩ ''W''} are pointwise equal (e.g., the domains of ''f'' and ''g'' are disjoint), then the union of ''f'' and ''g'' is defined and is equal to their overriding union. This definition agrees with the definition of union for binary relations.

Inverse function

If ƒ is a function from ''X'' to ''Y'' then an inverse function for ƒ, denoted by ƒ⁻¹, is a function in the opposite direction, from ''Y'' to ''X'', with the property that a round trip (a composition) returns each element to itself. Not every function has an inverse; those that do are called invertible. The inverse function exists if and only if ƒ is a bijection.

As a simple example, if ƒ converts a temperature in degrees Celsius ''C'' to degrees Fahrenheit ''F'', the function converting degrees Fahrenheit to degrees Celsius would be a suitable ƒ⁻¹. :

The notation for composition is similar to multiplication; in fact, sometimes it is denoted using juxtaposition, ''g''ƒ, without an intervening circle. With this analogy, identity functions are like the multiplicative identity, 1, and inverse functions are like reciprocals (hence the notation).

For functions that are injections or surjections, generalized inverse functions can be defined, called left and right inverses respectively. Left inverses map to the identity when composed to the left; right inverses when composed to the right.

Image of a set

The concept of the ''image'' can be extended from the image of a point to the image of a set. If ''A'' is any subset of the domain, then ƒ(''A'') is the subset of im ƒ consisting of all images of elements of A. We say the ƒ(''A'') is the image of A under f.

Use of ƒ(''A'') to denote the image of a subset ''A''⊆''X'' is consistent so long as no subset of the domain is also an element of the domain. In some fields (e.g., in set theory, where ordinals are also sets of ordinals) it is convenient or even necessary to distinguish the two concepts; the customary notation is ƒ[''A''] for the set { ƒ(''x''): x ∈ ''A'' }.

Notice that the image of ƒ is the image ƒ(''X'') of its domain, and that the image of ƒ is a subset of its codomain.

Inverse image

The inverse image (or preimage, or more precisely, complete inverse image) of a subset ''B'' of the codomain ''Y'' under a function ƒ is the subset of the domain ''X'' defined by :$f^\{-1\}(B)\; =\; \backslash \{x\; \backslash in\; X\; :\; f(x)\; \backslash in\; B\backslash \}.$ So, for example, the preimage of {4, 9} under the squaring function is the set {−3,−2,2,3}.

In general, the preimage of a singleton set (a set with exactly one element) may contain any number of elements. For example, if ƒ(''x'') = 7, then the preimage of {5} is the empty set but the preimage of {7} is the entire domain. Thus the preimage of an element in the codomain is a subset of the domain. The usual convention about the preimage of an element is that ƒ⁻¹(''b'') means ƒ⁻¹({''b''}), i.e :$f^\{-1\}(b)\; =\; \backslash \{x\; \backslash in\; X\; :\; f(x)\; =\; b\backslash \}.$

In the same way as for the image, some authors use square brackets to avoid confusion between the inverse image and the inverse function. Thus they would write ƒ⁻¹[''B''] and ƒ⁻¹[''b''] for the preimage of a set and a singleton.

The preimage of a singleton set is sometimes called a fiber. The term ''kernel'' can refer to a number of related concepts.

Specifying a function

A function can be defined by any mathematical condition relating each argument to the corresponding output value. If the domain is finite, a function ƒ may be defined by simply tabulating all the arguments ''x'' and their corresponding function values ƒ(''x''). More commonly, a function is defined by a formula, or (more generally) an algorithm — a recipe that tells how to compute the value of ƒ(''x'') given any ''x'' in the domain.

There are many other ways of defining functions. Examples include piecewise definitions, induction or recursion, algebraic or analytic closure, limits, analytic continuation, infinite series, and as solutions to integral and differential equations. The lambda calculus provides a powerful and flexible syntax for defining and combining functions of several variables.

Computability

Functions that send integers to integers, or finite strings to finite strings, can sometimes be defined by an algorithm, which gives a precise description of a set of steps for computing the output of the function from its input. Functions definable by an algorithm are called computable functions. For example, the Euclidean algorithm gives a precise process to compute the greatest common divisor of two positive integers. Many of the functions studied in the context of number theory are computable.

Fundamental results of computability theory show that there are functions that can be precisely defined but are not computable. Moreover, in the sense of cardinality, almost all functions from the integers to integers are not computable. The number of computable functions from integers to integers is countable, because the number of possible algorithms is. The number of all functions from integers to integers is higher: the same as the cardinality of the real numbers. Thus most functions from integers to integers are not computable. Specific examples of uncomputable functions are known, including the busy beaver function and functions related to the halting problem and other undecidable problems.

Function spaces

The set of all functions from a set ''X'' to a set ''Y'' is denoted by ''X'' → ''Y'', by [''X'' → ''Y''], or by ''Y''^''X''.

The latter notation is motivated by the fact that, when ''X'' and ''Y'' are finite and of size |''X''| and |''Y''|, then the number of functions ''X'' → ''Y'' is |''Y''^''X''| = |''Y''|^|''X''|. This is an example of the convention from enumerative combinatorics that provides notations for sets based on their cardinalities. Other examples are the multiplication sign ''X''×''Y'' used for the Cartesian product, where |''X''×''Y''| = |''X''|·|''Y''|; the factorial sign ''X''!, used for the set of permutations where |''X''!| = |''X''|!; and the binomial coefficient sign $\backslash begin\{pmatrix\}\; X\backslash \backslash \; n\backslash end\{pmatrix\}$, used for the set of ''n''-element subsets where $\backslash left|\; \backslash begin\{pmatrix\}\; X\; \backslash \backslash \; n\; \backslash end\{pmatrix\}\; \backslash right|\; =\; \backslash begin\{pmatrix\}\; |X|\; \backslash \backslash \; n\; \backslash end\{pmatrix\}.$

If ƒ: ''X'' → ''Y'', it may reasonably be concluded that ƒ ∈ [''X'' → ''Y''].

Pointwise operations

Pointwise operations inherit properties from the corresponding operations on the codomain. For example if ƒ: ''X'' → ''R'' and ''g'': ''X'' → ''R'' are functions with a common domain of ''X'' and common codomain of a ring ''R'', then the sum function ƒ + ''g'': ''X'' → ''R'' and the product function ƒ ⋅ ''g'': ''X'' → ''R'' can be defined as follows:

:

Other properties

There are many other special classes of functions that are important to particular branches of mathematics, or particular applications. Here is a partial list:

bijection, injection and surjection, or singularly:

* injective,

* surjective, and

* bijective function

continuous

differentiable, integrable

linear, polynomial, rational

algebraic, transcendental

trigonometric

fractal

odd or even

convex, monotonic, unimodal

holomorphic, meromorphic, entire

vector-valued

computable

History

Functions prior to Leibniz

:''Historically, some mathematicians can be regarded as having foreseen and come close to a modern formulation of the concept of function. Among them is Oresme (1323–1382) . . . In his theory, some general ideas about independent and dependent variable quantities seem to be present.'' Ponte further notes that "The emergence of a notion of function as an individualized mathematical entity can be traced to the beginnings of infinitesimal calculus".

The notion of "function" in analysis

As a mathematical term, "function" was coined by Gottfried Leibniz, in a 1673 letter, to describe a quantity related to a curve, such as a curve's slope at a specific point. The functions Leibniz considered are today called differentiable functions. For this type of function, one can talk about limits and derivatives; both are measurements of the output or the change in the output as it depends on the input or the change in the input. Such functions are the basis of calculus.

Johann Bernoulli "by 1718, had come to regard a function as any expression made up of a variable and some constants", and Leonhard Euler during the mid-18th century used the word to describe an expression or formula involving variables and constants e.g., .

Alexis Claude Clairaut (in approximately 1734) and Euler introduced the familiar notation " f(x) ". but Dirichlet's claim to this formalization is disputed by Imre Lakatos:

:There is no such definition in Dirichlet's works at all. But there is ample evidence that he had no idea of this concept. In his [1837], for instance, when he discusses piecewise continuous functions, he says that at points of discontinuity the function ''has two values'': ... :(''Proofs and Refutations'', 151, Cambridge University Press 1976.)

In the context of "the Differential Calculus" George Boole defined (circa 1849) the notion of a function as follows: :"That quantity whose variation is uniform . . . is called the independent variable. That quantity whose variation is referred to the variation of the former is said to be a ''function'' of it. The Differential calculus enables us in every case to pass from the function to the limit. This it does by a certain Operation. But in the very Idea of an Operation is . . . the idea of an inverse operation. To effect that inverse operation in the present instance is the business of the Int[egral] Calculus."

The logician's "function" prior to 1850

Logicians of this time were primarily involved with analyzing syllogisms (the 2000 year-old Aristotelian forms and otherwise), or as Augustus De Morgan (1847) stated it: "the examination of that part of reasoning which depends upon the manner in which inferences are formed, and the investigation of general maxims and rules for constructing arguments". At this time the notion of (logical) "function" is not explicit, but at least in the work of De Morgan and George Boole it is implied: we see abstraction of the argument forms, the introduction of variables, the introduction of a symbolic algebra with respect to these variables, and some of the notions of set theory.

De Morgan's 1847 "FORMAL LOGIC OR, The Calculus of Inference, Necessary and Probable" observes that "[a] logical truth depends upon the ''structure of the statement'', and not upon the particular matters spoken of"; he wastes no time (preface page i) abstracting: "In the form of the proposition, the copula is made as absract as the terms". He immediately (p. 1) casts what he calls "the proposition" (present-day propositional ''function'' or ''relation'') into a form such as "X is Y", where the symbols X, "is", and Y represent, respectively, the ''subject'', ''copula'', and ''predicate.'' While the word "function" does not appear, the notion of "abstraction" is there, "variables" are there, the notion of inclusion in his symbolism “all of the Δ is in the О” (p. 9) is there, and lastly a new symbolism for logical analysis of the notion of "relation" (he uses the word with respect to this example " X)Y " (p. 75) ) is there: :" A₁ X)Y To take an X it is necessary to take a Y" [or To be an X it is necessary to be a Y] :" A¹ Y)X To take an Y it is sufficient to take a X" [or To be a Y it is sufficient to be an X], etc.

In his 1848 ''The Nature of Logic'' Boole asserts that "logic . . . is in a more especial sense the science of reasoning by signs", and he briefly discusses the notions of "belonging to" and "class": "An individual may possess a great variety of attributes and thus belonging to a great variety of different classes" . Like De Morgan he uses the notion of "variable" drawn from analysis; he gives an example of "represent[ing] the class oxen by ''x'' and that of horses by ''y'' and the conjunction ''and'' by the sign + . . . we might represent the aggregate class oxen and horses by ''x + y''".

The logicians' "function" 1850–1950

Eves observes "that logicians have endeavored to push down further the starting level of the definitional development of mathematics and to derive the theory of sets, or classes, from a foundation in the logic of propositions and propositional functions". But by the late 19th century the logicians' research into the foundations of mathematics was undergoing a major split. The direction of the first group, the Logicists, can probably be summed up best by Bertrand Russell 1903:9 – "to fulfil two objects, first, to show that all mathematics follows from symbolic logic, and secondly to discover, as far as possible, what are the principles of symbolic logic itself."

The second group of logicians, the set-theorists, emerged with Georg Cantor's "set theory" (1870–1890) but were driven forward partly as a result of Russell's discovery of a paradox that could be derived from Frege's conception of "function", but also as a reaction against Russell's proposed solution. Zermelo's set-theoretic response was his 1908 ''Investigations in the foundations of set theory I'' – the first axiomatic set theory; here too the notion of "propositional function" plays a role.

George Boole's ''The Laws of Thought'' 1854; John Venn's ''Symbolic Logic'' 1881

In his ''An Investigation into the laws of thought'' Boole now defined a function in terms of a symbol ''x'' as follows: :"8. Definition. – Any algebraic expression involving symbol ''x'' is termed a function of x, and may be represented by the abbreviated form f(x)" Boole then used ''algebraic'' expressions to define both algebraic and ''logical'' notions, e.g., 1−''x'' is logical NOT(''x''), ''xy'' is the logical AND(''x'',''y''), ''x + y'' is the logical OR(''x'', ''y''), ''x''(''x''+''y'') is ''xx''+''xy'', and "the special law" ''xx'' = ''x''² = ''x''.

In his 1881 ''Symbolic Logic'' Venn was using the words "logical function" and the contemporary symbolism ( x = f(y), y = f⁻¹(x), cf page xxi) plus the circle-diagrams historically associated with Venn to describe "class relations", the notions "'quantifying' our predicate", "propositions in respect of their extension", "the relation of inclusion and exclusion of two classes to one another", and "propositional function" (all on p. 10), the bar over a variable to indicate not-x (page 43), etc. Indeed he equated unequivocally the notion of "logical function" with "class" [modern "set"]: "... on the view adopted in this book, f(x) never stands for anything but a logical class. It may be a compound class aggregated of many simple classes; it may be a class indicated by certain inverse logical operations, it may be composed of two groups of classes equal to one another, or what is the same thing, their difference declared equal to zero, that is, a logical equation. But however composed or derived, f(x) with us will never be anything else than a general expression for such logical classes of things as may fairly find a place in ordinary Logic".

Frege's ''Begriffsschrift'' 1879

Gottlob Frege's Begriffsschrift (1879) preceded Giuseppe Peano (1889), but Peano had no knowledge of Frege 1879 until after he had published his 1889. Both writers strongly influenced Bertrand Russell (1903). Russell in turn influenced much of 20th-century mathematics and logic through his ''Principia Mathematica'' (1913) jointly authored with Alfred North Whitehead.

At the outset Frege abandons the traditional "concepts ''subject'' and ''predicate''", replacing them with ''argument'' and ''function'' respectively, which he believes "will stand the test of time. It is easy to see how regarding a content as a function of an argument leads to the formation of concepts. Furthermore, the demonstration of the connection between the meanings of the words ''if, and, not, or, there is, some, all,'' and so forth, deserves attention".

Frege begins his discussion of "function" with an example: Begin with the expression "Hydrogen is lighter than carbon dioxide". Now remove the sign for hydrogen (i.e., the word "hydrogen") and replace it with the sign for oxygen (i.e., the word "oxygen"); this makes a second statement. Do this again (using either statement) and substitute the sign for nitrogen (i.e., the word "nitrogen") and note that "This changes the meaning in such a way that "oxygen" or "nitrogen" enters into the relations in which "hydrogen" stood before". There are three statements:

"Hydrogen is lighter than carbon dioxide."

"Oxygen is lighter than carbon dioxide."

"Nitrogen is lighter than carbon dioxide."

Now observe in all three a "stable component, representing the totality of [the] relations"; call this the function, i.e., : "... is lighter than carbon dioxide", is the function. Frege calls the argument of the function "[t]he sign [e.g., hydrogen, oxygen, or nitrogen], regarded as replaceable by others that denotes the object standing in these relations". He notes that we could have derived the function as "Hydrogen is lighter than . . .." as well, with an argument position on the ''right''; the exact observation is made by Peano (see more below). Finally, Frege allows for the case of two (or more arguments). For example, remove "carbon dioxide" to yield the invariant part (the function) as:

"... is lighter than ... "

The one-argument function Frege generalizes into the form Φ(A) where A is the argument and Φ( ) represents the function, whereas the two-argument function he symbolizes as Ψ(A, B) with A and B the arguments and Ψ( , ) the function and cautions that "in general Ψ(A, B) differs from Ψ(B, A)". Using his unique symbolism he translates for the reader the following symbolism: :"We can read |--- Φ(A) as "A has the property Φ. |--- Ψ(A, B) can be translated by "B stands in the relation Ψ to A" or "B is a result of an application of the procedure Ψ to the object A".

Peano 1889 ''The Principles of Arithmetic'' 1889

Peano defined the notion of "function" in a manner somewhat similar to Frege, but without the precision. First Peano defines the sign "K means ''class'', or aggregate of objects", the objects of which satisfy three simple equality-conditions, ''a = a'', (''a = b'') = (''b = a''), IF ((''a = b'') AND (''b = c'')) THEN (''a = c''). He then introduces φ, "a sign or an aggregate of signs such that if ''x'' is an object of the class ''s'', the expression φx denotes a new object". Peano adds two conditions on these new objects: First, that the three equality-conditions hold for the objects φx; secondly, that "if ''x'' and ''y'' are objects of class ''s'' and if ''x'' = ''y'', we assume it is possible to deduce ''φx = φy''". Given all these conditions are met, φ is a "function presign". Likewise he identifies a "function postsign". For example if ''φ'' is the function presign ''a''+, then ''φx'' yields ''a''+''x'', or if ''φ'' is the function postsign +''a'' then ''xφ'' yields ''x''+''a''.

Bertrand Russell's ''The Principles of Mathematics'' 1903

While the influence of Cantor and Peano was paramount, in Appendix A "The Logical and Arithmetical Doctrines of Frege" of ''The Principles of Mathematics'', Russell arrives at a discussion of Frege's notion of ''function'', "...a point in which Frege's work is very important, and requires careful examination". In response to his 1902 exchange of letters with Frege about the contradiction he discovered in Frege's ''Begriffsschrift'' Russell tacked this section on at the last moment.

For Russell the bedeviling notion is that of "variable": "6. Mathematical propositions are not only characterized by the fact that they assert implications, but also by the fact that they contain ''variables''. The notion of the variable is one of the most difficult with which logic has to deal. For the present, I openly wish to make it plain that there are variables in all mathematical propositions, even where at first sight they might seem to be absent. . . . We shall find always, in all mathematical propositions, that the words ''any'' or ''some'' occur; and these words are the marks of a variable and a formal implication".

As expressed by Russell "the process of transforming constants in a proposition into variables leads to what is called generalization, and gives us, as it were, the formal essence of a proposition ... So long as any term in our proposition can be turned into a variable, our proposition can be generalized; and so long as this is possible, it is the business of mathematics to do it"; these generalizations Russell named ''propositional functions''". Indeed he cites and quotes from Frege's ''Begriffsschrift'' and presents a vivid example from Frege's 1891 ''Function und Begriff'': That "the essence of the arithmetical function 2''x''³ + ''x'' is what is left when the x is taken away, i.e., in the above instance 2( )³ + ( ). The argument ''x'' does not belong to the function but the two taken together make the whole".

Propositional functions: Because his terminology is different from the contemporary, the reader may be confused by Russell's "propositional function". An example may help. Russell writes a propositional function in its raw form, e.g., as ''φŷ'': "''ŷ'' is hurt". (Observe the circumflex or "hat" over the variable ''y''). For our example, we will assign just 4 values to the variable ''ŷ'': "Bob", "This bird", "Emily the rabbit", and "''y''". Substitution of one of these values for variable ''ŷ'' yields a proposition; this proposition is called a "value" of the propositional function. In our example there are four values of the propositional function, e.g., "Bob is hurt", "This bird is hurt", "Emily the rabbit is hurt" and "''y'' is hurt." A proposition, if it is significant—i.e., if its truth is determinate—has a truth-value of ''truth'' or ''falsity''. If a proposition's truth value is "truth" then the variable's value is said to satisfy the propositional function. Finally, per Russell's definition, "a ''class'' [set] is all objects satisfying some propositional function" (p. 23). Note the word "all'" – this is how the contemporary notions of "For all ∀" and "there exists at least one instance ∃" enter the treatment (p. 15).

To continue the example: Suppose (from outside the mathematics/logic) one determines that the propositions "Bob is hurt" has a truth value of "falsity", "This bird is hurt" has a truth value of "truth", "Emily the rabbit is hurt" has an indeterminate truth value because "Emily the rabbit" doesn't exist, and "''y'' is hurt" is ambiguous as to its truth value because the argument ''y'' itself is ambiguous. While the two propositions "Bob is hurt" and "This bird is hurt" are ''significant'' (both have truth values), only the value "This bird" of the ''variable'' ''ŷ'' ''satisfies''' the propositional function ''φŷ'': "''ŷ'' is hurt". When one goes to form the class α: ''φŷ'': "''ŷ'' is hurt", only "This bird" is included, given the four values "Bob", "This bird", "Emily the rabbit" and "''y''" for variable ''ŷ'' and their respective truth-values: falsity, truth, indeterminate, ambiguous.

Russell defines functions of propositions with arguments, and truth-functions ''f(p)''. For example, suppose one were to form the "function of propositions with arguments" p₁: "NOT(p) AND q" and assign its variables the values of ''p'': "Bob is hurt" and ''q'': "This bird is hurt". (We are restricted to the logical linkages NOT, AND, OR and IMPLIES, and we can only assign "significant" propositions to the variables ''p'' and ''q''). Then the "function of propositions with arguments" is p₁: NOT("Bob is hurt") AND "This bird is hurt". To determine the truth value of this "function of propositions with arguments" we submit it to a "truth function", e.g., ''f(p₁)'': ''f''( NOT("Bob is hurt") AND "This bird is hurt" ), which yields a truth value of "truth".

The notion of a "many-one" functional relation": Russell first discusses the notion of "identity", then defines a descriptive function (pages 30ff) as the unique value ''ιx'' that satisfies the (2-variable) propositional function (i.e., "relation") ''φŷ''. :''N.B. The reader should be warned here that the order of the variables are reversed! ''y'' is the independent variable and ''x'' is the dependent variable, e.g., x = sin(y)''. Russell symbolizes the descriptive function as "the object standing in relation to ''y''": R'y =_DEF (''ιx'')(''x R y''). Russell repeats that "''R'y'' is a function of ''y'', but not a propositional function [sic]; we shall call it a ''descriptive'' function. All the ordinary functions of mathematics are of this kind. Thus in our notation "sin ''y''" would be written " sin '' 'y'' ", and "sin" would stand for the relation sin '' 'y'' has to ''y''".

Hardy 1908

defined a function as a relation between two variables ''x'' and ''y'' such that "to some values of ''x'' at any rate correspond values of ''y''." He neither required the function to be defined for all values of ''x'' nor to associate each value of ''x'' to a single value of ''y''. This broad definition of a function encompasses more relations than are ordinarily considered functions in contemporary mathematics.

The Formalist's "function": David Hilbert's axiomatization of mathematics (1904–1927)

David Hilbert set himself the goal of "formalizing" classical mathematics "as a formal axiomatic theory, and this theory shall be proved to be consistent, i.e., free from contradiction" . In his 1927 ''The Foundations of Mathematics'' Hilbert frames the notion of function in terms of the existence of an "object": : 13. A(a) --> A(ε(A)) Here ε(A) stands for an object of which the proposition A(a) certainly holds if it holds of any object at all; let us call ε the logical ε-function". [The arrow indicates “implies”.] Hilbert then illustrates the three ways how the ε-function is to be used, firstly as the "for all" and "there exists" notions, secondly to represent the "object of which [a proposition] holds", and lastly how to cast it into the choice function.

Recursion theory and computability: But the unexpected outcome of Hilbert's and his student Bernays's effort was failure; see Gödel's incompleteness theorems of 1931. At about the same time, in an effort to solve Hilbert's Entscheidungsproblem, mathematicians set about to define what was meant by an "effectively calculable function" (Alonzo Church 1936), i.e., "effective method" or "algorithm", that is, an explicit, step-by-step procedure that would succeed in computing a function. Various models for algorithms appeared, in rapid succession, including Church's lambda calculus (1936), Stephen Kleene's μ-recursive functions(1936) and Alan Turing's (1936–7) notion of replacing human "computers" with utterly-mechanical "computing machines" (see Turing machines). It was shown that all of these models could compute the same class of computable functions. Church's thesis holds that this class of functions exhausts all the number-theoretic functions that can be calculated by an algorithm. The outcomes of these efforts were vivid demonstrations that, in Turing's words, "there can be no general process for determining whether a given formula ''U'' of the functional calculus K [''Principia Mathematica''] is provable"; see more at Independence (mathematical logic) and Computability theory.

Development of the set-theoretic definition of "function"

Set theory began with the work of the logicians with the notion of "class" (modern "set") for example De Morgan (1847), Jevons (1880), Venn 1881, Frege 1879 and Peano (1889). It was given a push by Georg Cantor's attempt to define the infinite in set-theoretic treatment (1870–1890) and a subsequent discovery of an antinomy (contradiction, paradox) in this treatment (Cantor's paradox), by Russell's discovery (1902) of an antinomy in Frege's 1879 (Russell's paradox), by the discovery of more antinomies in the early 20th century (e.g., the 1897 Burali-Forti paradox and the 1905 Richard paradox), and by resistance to Russell's complex treatment of logic and dislike of his axiom of reducibility (1908, 1910–1913) that he proposed as a means to evade the antinomies.

Russell's paradox 1902

In 1902 Russell sent a letter to Frege pointing out that Frege's 1879 ''Begriffsschrift'' allowed a function to be an argument of itself: "On the other hand, it may also be that the argument is determinate and the function indeterminate . . .." From this unconstrained situation Russell was able to form a paradox: :"You state ... that a function, too, can act as the indeterminate element. This I formerly believed, but now this view seems doubtful to me because of the following contradiction. Let ''w'' be the predicate: to be a predicate that cannot be predicated of itself. Can ''w'' be predicated of itself?" Frege responded promptly that "Your discovery of the contradiction caused me the greatest surprise and, I would almost say, consternation, since it has shaken the basis on which I intended to build arithmetic".

From this point forward development of the foundations of mathematics became an exercise in how to dodge "Russell's paradox", framed as it was in "the bare [set-theoretic] notions of set and element".

Zermelo's set theory (1908) modified by Skolem (1922)

The notion of "function" appears as Zermelo's axiom III—the Axiom of Separation (Axiom der Aussonderung). This axiom constrains us to use a propositional function Φ(x) to "separate" a subset M_Φ from a previously formed set M: : "AXIOM III. (Axiom of separation). Whenever the propositional function Φ(x) is definite for all elements of a set M, M possesses a subset M_Φ containing as elements precisely those elements x of M for which Φ(x) is true".

As there is no universal set—sets originate by way of Axiom II from elements of (non-set) ''domain B'' – "...this disposes of the Russell antinomy so far as we are concerned". But Zermelo's "definite criterion" is imprecise, and is fixed by Weyl, Fraenkel, Skolem, and von Neumann.

In fact Skolem in his 1922 referred to this "definite criterion" or "property" as a "definite proposition": :"... a finite expression constructed from elementary propositions of the form ''a'' ε ''b'' or ''a'' = ''b'' by means of the five operations [logical conjunction, disjunction, negation, universal quantification, and existential quantification].

van Heijenoort summarizes: :"A property is definite in Skolem's sense if it is expressed . . . by a well-formed formula in the simple predicate calculus of first order in which the sole predicate constants are ε and possibly, =. ... Today an axiomatization of set theory is usually embedded in a logical calculus, and it is Weyl's and Skolem's approach to the formulation of the axiom of separation that is generally adopted.

In this quote the reader may observe a shift in terminology: nowhere is mentioned the notion of "propositional function", but rather one sees the words "formula", "predicate calculus", "predicate", and "logical calculus." This shift in terminology is discussed more in the section that covers "function" in contemporary set theory.

The Wiener–Hausdorff–Kuratowski "ordered pair" definition 1914–1921

The history of the notion of "ordered pair" is not clear. As noted above, Frege (1879) proposed an intuitive ordering in his definition of a two-argument function Ψ(A, B). Norbert Wiener in his 1914 (see below) observes that his own treatment essentially "revert(s) to Schröder's treatment of a relation as a class of ordered couples". Russell (1903) considered the definition of a relation (such as Ψ(A, B)) as a "class of couples" but rejected it: :"There is a temptation to regard a relation as definable in extension as a class of couples. This is the formal advantage that it avoids the necessity for the primitive proposition asserting that every couple has a relation holding between no other pairs of terms. But it is necessary to give sense to the couple, to distinguish the referent [''domain''] from the relatum [''converse domain'']: thus a couple becomes essentially distinct from a class of two terms, and must itself be introduced as a primitive idea. . . . It seems therefore more correct to take an intensional view of relations, and to identify them rather with class-concepts than with classes."

By 1910–1913 and ''Principia Mathematica'' Russell had given up on the requirement for an intensional definition of a relation, stating that "mathematics is always concerned with extensions rather than intensions" and "Relations, like classes, are to be taken in ''extension''". To demonstrate the notion of a relation in extension Russell now embraced the notion of ''ordered couple'': "We may regard a relation ... as a class of couples ... the relation determined by φ(''x, y'') is the class of couples (''x, y'') for which φ(''x, y'') is true". In a footnote he clarified his notion and arrived at this definition: :"Such a couple has a ''sense'', i.e., the couple (''x, y'') is different from the couple (''y, x'') unless ''x = y''. We shall call it a "couple with sense," ... it may also be called an ''ordered couple''. In a few years he would refine this notion and propose in his 1908 ''The Theory of Types'' two axioms of reducibility, the purpose of which were to reduce (single-variable) propositional functions and (dual-variable) relations to a "lower" form (and ultimately into a completely extensional form); he and Alfred North Whitehead would carry this treatment over to ''Principia Mathematica'' 1910–1913 with a further refinement called "a matrix". The first axiom is *12.1; the second is *12.11. To quote Wiener the second axiom *12.11 "is involved only in the theory of relations". Both axioms, however, were met with skepticism and resistance; see more at Axiom of reducibility. By 1914 Norbert Wiener, using Whitehead and Russell's symbolism, eliminated axiom *12.11 (the "two-variable" (relational) version of the axiom of reducibility) by expressing a relation as an ordered pair "using the null set. At approximately the same time, Hausdorff (1914, p. 32) gave the definition of the ordered pair (a, b) as { {a,1}, {b, 2} }. A few years later Kuratowski (1921) offered a definition that has been widely used ever since, namely { {a, b}, {a} }". As noted by Suppes (1960) "This definition . . . was historically important in reducing the theory of relations to the theory of sets.

Observe that while Wiener "reduced" the relational *12.11 form of the axiom of reducibility he ''did not'' reduce nor otherwise change the propositional-function form *12.1; indeed he declared this "essential to the treatment of identity, descriptions, classes and relations".

Schönfinkel's notion of "function" as a many-one "correspondence" 1924

Where exactly the ''general'' notion of "function" as a many-one relationship derives from is unclear. Russell in his 1920 ''Introduction to Mathematical Philosophy'' states that "It should be observed that all mathematical functions result form one-many [sic – contemporary usage is many-one] relations . . . Functions in this sense are ''descriptive'' functions". A reasonable possibility is the ''Principia Mathematica'' notion of "descriptive function" – ''R 'y'' =_DEF (ι''x'')(''x R y''): "the singular object that has a relation ''R'' to ''y''". Whatever the case, by 1924, Moses Schonfinkel expressed the notion, claiming it to be "well known": :"As is well known, by function we mean in the simplest case a correspondence between the elements of some domain of quantities, the argument domain, and those of a domain of function values ... such that to each argument value there corresponds at most one function value".

According to Willard Quine, Schönfinkel's 1924 "provide[s] for ... the whole sweep of abstract set theory. The crux of the matter is that Schönfinkel lets functions stand as arguments. ¶ For Schönfinkel, substantially as for Frege, classes are special sorts of functions. They are propositional functions, functions whose values are truth values. All functions, propositional and otherwise, are for Schönfinkel one-place functions". Remarkably, Schönfinkel reduces all mathematics to an extremely compact ''functional calculus'' consisting of only three functions: Constancy, fusion (i.e., composition), and mutual exclusivity. Quine notes that Haskell Curry (1958) carried this work forward "under the head of combinatory logic".

Von Neumann's set theory 1925

By 1925 Abraham Fraenkel (1922) and Thoralf Skolem (1922) had amended Zermelo's set theory of 1908. But von Neumann was not convinced that this axiomatization could not lead to the antinomies. So he proposed his own theory, his 1925 ''An axiomatization of set theory''. It explicitly contains a "contemporary", set-theoretic version of the notion of "function": :"[Unlike Zermelo's set theory] [w]e prefer, however, to axiomatize not "set" but "function". The latter notion certainly includes the former. (More precisely, the two notions are completely equivalent, since a function can be regarded as a set of pairs, and a set as a function that can take two values.)".

His axiomatization creates two "domains of objects" called "arguments" (I-objects) and "functions" (II-objects); where they overlap are the "argument functions" (I-II objects). He introduces two "universal two-variable operations" – (i) the operation [x, y]: ". . . read 'the value of the function ''x'' for the argument ''y'') and (ii) the operation (x, y): ". . . (read 'the ordered pair x, y'") whose variables ''x'' and ''y'' must both be arguments and that itself produces an argument (''x,y'')". To clarify the function pair he notes that "Instead of ''f''(''x'') we write [''f,x''] to indicate that ''f'', just like ''x'', is to be regarded as a variable in this procedure". And to avoid the "antinomies of naive set theory, in Russell's first of all . . . we must forgo treating certain functions as arguments". He adopts a notion from Zermelo to restrict these "certain functions"

Since 1950

Notion of "function" in contemporary set theory

Both axiomatic and naive forms of Zermelo's set theory as modified by Fraenkel (1922) and Skolem (1922) ''define'' "function" as a relation, ''define'' a relation as a set of ordered pairs, and ''define'' an ordered pair as a set of two "dissymetric" sets.

While the reader of Suppes (1960) ''Axiomatic Set Theory'' or Halmos (1970) ''Naive Set Theory'' observes the use of function-symbolism in the ''axiom of separation'', e.g., φ(x) (in Suppes) and S(x) (in Halmos), they will see no mention of "proposition" or even "first order predicate calculus". In their place are "''expressions'' of the object language", "atomic formulae", "primitive formulae", and "atomic sentences".

Kleene 1952 defines the words as follows: "In word languages, a proposition is expressed by a sentence. Then a 'predicate' is expressed by an incomplete sentence or sentence skeleton containing an open place. For example, "___ is a man" expresses a predicate ... The predicate is a ''propositional function of one variable''. Predicates are often called 'properties' ... The predicate calculus will treat of the logic of predicates in this general sense of 'predicate', i.e., as propositional function".

The reason for the disappearance of the words "propositional function" e.g., in Suppes (1960), and Halmos (1970), is explained by Alfred Tarski 1946 together with further explanation of the terminology: :"An expression such as ''x is an integer'', which contains variables and, on replacement of these variables by constants becomes a sentence, is called a SENTENTIAL [i.e., propositional cf his index] FUNCTION. But mathematicians, by the way, are not very fond of this expression, because they use the term "function" with a different meaning. ... sentential functions and sentences composed entirely of mathematical symbols (and not words of everyday languange), such as: ''x + y = 5'' are usually referred to by mathematicians as FORMULAE. In place of "sentential function" we shall sometimes simply say "sentence" – but only in cases where there is no danger of any misunderstanding". For his part Tarski calls the relational form of function a "FUNCTIONAL RELATION or simply a FUNCTION" . After a discussion of this "functional relation" he asserts that: :"The concept of a function which we are considering now differs essentially from the concepts of a sentential [propositional] and of a designatory function .... Strictly speaking ... [these] do not belong to the domain of logic or mathematics; they denote certain categories of expressions which serve to compose logical and mathematical statements, but they do not denote things treated of in those statements... . The term "function" in its new sense, on the other hand, is an expression of a purely logical character; it designates a certain type of things dealt with in logic and mathematics." See more about "truth under an interpretation" at Alfred Tarski.

Further developments

The idea of structure-preserving functions, or homomorphisms, led to the abstract notion of morphism, the key concept of category theory. More recently, the concept of functor has been used as an analogue of a function in category theory.

See also

Functional

Function composition

Functional decomposition

Functional predicate

Functional programming

Functor

Generalized function

Implicit function

List of mathematical functions

Parametric equation

Plateau

Proportionality

Vertical line test

Notes

References

. . . . . . .

Boole, George (1854), ''An Investigation into the Laws of Thought on which are founded the Laws of Thought and Probabilities'', Walton and Marberly, London UK; Macmillian and Company, Cambridge UK. Republished as a googlebook.

Halmos, Paul R. (1970) ''Naive Set Theory'', Springer-Verlag, New York, ISBN 0-387-90092-6.

Reichenbach, Hans (1947) ''Elements of Symbolic Logic'', Dover Publishing Inc., New York NY, ISBN 0-486-24004-5.

Russell, Bertrand (1903) ''The Principles of Mathematics: Vol. 1'', Cambridge at the University Press, Cambridge, UK, republished as a googlebook.

Russell, Bertrand (1920) ''Introduction to Mathematical Philosophy'' (second edition), Dover Publishing Inc., New York NY, ISBN 0-486-27724-0 (pbk).

Suppes, Patrick (1960) ''Axiomatic Set Theory'', Dover Publications, Inc, New York NY, ISBN 0-486-61630-4. cf his ''Chapter 1 Introduction''.

Tarski, Alfred (1946) ''Introduction to Logic and to the Methodolgy of Deductive Sciences'', republished 1195 by Dover Publications, Inc., New York, NY ISBN 0-486-28462-x

Venn, John (1881) ''Symbolic Logic'', Macmillian and Co., London UK. Republished as a googlebook.

van Heijenoort, Jean (1967, 3rd printing 1976), ''From Frege to Godel: A Source Book in Mathematical Logic, 1879–1931'', Harvard University Press, Cambridge, MA, ISBN 0-674-32449-8 (pbk)

* Gottlob Frege (1879) ''Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought'' with commentary by van Heijenoort, pages 1–82

* Giuseppe Peano (1889) ''The principles of arithmetic, presented by a new method'' with commentary by van Heijenoort, pages 83–97

* Bertrand Russell (1902) ''Letter to Frege'' with commentary by van Heijenoort, pages 124–125. Wherein Russell announces his discovery of a "paradox" in Frege's work.

* Gottlob Frege (1902) ''Letter to Russell'' with commentary by van Heijenoort, pages 126–128.

* David Hilbert (1904) ''On the foundations of logic and arithmetic'', with commentary by van Heijenoort, pages 129–138.

* Jules Richard (1905) ''The principles of mathematics and the problem of sets'', with commentary by van Heijenoort, pages 142–144. The Richard paradox.

* Bertrand Russell (1908a) ''Mathematical logic as based on the theory of types'', with commentary by Willard Quine, pages 150–182.

* Ernst Zermelo (1908) ''A new proof of the possibility of a well-ordering'', with commentary by van Heijenoort, pages 183–198. Wherein Zermelo rails against Poincaré's (and therefore Russell's) notion of impredicative definition.

* Ernst Zermelo (1908a) ''Investigations in the foundations of set theory I'', with commentary by van Heijenoort, pages 199–215. Wherein Zermelo attempts to solve Russell's paradox by structuring his axioms to restrict the universal domain B (from which objects and sets are pulled by ''definite properties'') so that it itself cannot be a set, i.e., his axioms disallow a universal set.

* Norbert Wiener (1914) ''A simplification of the logic of relations'', with commentary by van Heijenoort, pages 224–227

* Thoralf Skolem (1922) ''Some remarks on axiomatized set theory'', with commentary by van Heijenoort, pages 290–301. Wherein Skolem defines Zermelo's vague "definite property".

* Moses Schönfinkel (1924) ''On the building blocks of mathematical logic'', with commentary by Willard Quine, pages 355–366. The start of ''combinatory logic''.

* John von Neumann (1925) ''An axiomatization of set theory'', with commentary by van Heijenoort , pages 393–413. Wherein von Neumann creates "classes" as distinct from "sets" (the "classes" are Zermelo's "definite properties"), and now there is a universal set, etc.

* David Hilbert (1927) ''The foundations of mathematics'' by van Heijenoort, with commentary, pages 464–479.

Whitehead, Alfred North and Russell, Bertrand (1913, 1962 edition), ''Principia Mathematica to *56'', Cambridge at the University Press, London UK, no ISBN or US card catalog number.

External links

The Wolfram Functions Site gives formulae and visualizations of many mathematical functions.

Shodor: Function Flyer, interactive Java applet for graphing and exploring functions.

xFunctions, a Java applet for exploring functions graphically.

Draw Function Graphs, online drawing program for mathematical functions.

Functions from cut-the-knot.

Function at ProvenMath.

Comprehensive web-based function graphing & evaluation tool.

FunctionGame, an educational interactive function guessing game.

Category:Functions and mappings Category:Basic concepts in set theory Category:Elementary mathematics Category:Mathematical relations

af:Funksie ar:دالة رياضية an:Función matematica az:Funksiya (riyaziyyat) bn:ফাংশন (গণিত) be:Функцыя be-x-old:Функцыя (матэматыка) bar:Funktion bs:Funkcija (matematika) bg:Функция ca:Funció matemàtica cs:Funkce (matematika) da:Funktion (matematik) de:Funktion (Mathematik) et:Funktsioon (matemaatika) el:Συνάρτηση es:Función matemática eo:Funkcio (matematiko) eu:Funtzio (matematika) fa:تابع fr:Application (mathématiques) ga:Feidhm gl:Función gan:函數 xal:Даалһвр ko:함수 hi:फलन hr:Funkcija (matematika) io:Funciono id:Fungsi (matematika) is:Fall (stærðfræði) it:Funzione (matematica) he:פונקציה ka:ფუნქცია (მათემატიკა) kk:Функция аргументі lo:ຕຳລາ (ຄະນິດສາດ) la:Functio lv:Funkcija lt:Funkcija (matematika) jbo:fancu lmo:Funziú (matemàtega) hu:Függvény (matematika) mk:Функција (математика) ml:ഫലനം mt:Funzjonijiet (matematika) ms:Fungsi mn:Функц (математик) nl:Functie (wiskunde) ja:関数 (数学) nap:Funzione (matematica) no:Funksjon (matematikk) nn:Matematisk funksjon oc:Aplicacion (matematicas) pms:Fonsion pl:Funkcja pt:Função ro:Funcție qu:Kinraysuyu ru:Функция (математика) scn:Funzioni simple:Function (mathematics) sk:Zobrazenie (matematika) sl:Funkcija sr:Функција (математика) sh:Funkcija su:Fungsi (matematika) fi:Funktio sv:Funktion ta:சார்பு th:ฟังก์ชัน (คณิตศาสตร์) tr:Fonksiyon uk:Функція (математика) ur:دالہ (ریاضیات) ug:فۇنكسىيە vi:Hàm số zh-classical:映射 war:Funcion matematica yi:פונקציע zh:函数