# function, logical

- In logic and mathematics a function, also known as a map or mapping, is a relation that associates members of one class X with some unique member
*y*of another class Y. The association is written as*y*= f(*x*). The class X is called the domain of the function, and Y its range. Thus ‘the father of*x*’ is a function whose domain includes all people, and whose range is the class of male parents. But the relation ‘son of*x*’ is not a function, because a person can have more than one son. ‘Sine*x*’ is a function from angles onto real numbers; the length of the perimeter of a circle, π*x*, is a function of its diameter*x*; and so on. Functions may take sequences <*x*_{1}…*x*_{n}> as their arguments, in which case they may be thought of as associating a unique member of Y with any ordered n-tuple as argument. Given the equation*y*= f(*x*_{1}…*x*_{n}),*x*_{1}…*x*_{n}are called the independent variables, or arguments of the function, and*y*the dependent variable or value. Functions may be many-one, meaning that different members of X may take the same member of Y as their value, or one-one, when to each member of X there corresponds a distinct member of Y. A function with domain X and range Y is also called a mapping from X to Y, written f X → Y. If the function is such that(i) if*x*,*y*∈ X and f(*x*) = f(*y*) then*x*=*y*, then the function is an injection from X to Y. If also(ii) if*y*∈ Y, then (∃*x*)(*x*∈ X &*y*= f(*x*)) then the function is a bijection of X onto Y. A bijection is also known as a one-one correspondence. A bijection is both an injection and a surjection where a surjection is any function whose domain is X and whose range is the whole of Y. Since functions are relations a function may be defined as a set of ordered pairs <*x*,*y*> where*x*is a member of X and*y*of Y.One of Frege's logical insights was that a concept is analagous to a function, and a predicate analagous to the expression for a function (a functor). Just as ‘the square root of*x*’ takes us from one number to another, so ‘*x*is a philosopher’ refers to a function that takes us from persons to truth-values: true for values of*x*who are philosophers, and false otherwise.

*Philosophy dictionary.
Academic.
2011.*

### Look at other dictionaries:

**function (logical)**— function, logical … Philosophy dictionary**function**— function, logical … Philosophy dictionary**logical function**— loginė funkcija statusas T sritis informatika apibrėžtis ↑Funkcija, kurios rezultatas – ↑loginė reikšmė: ↑tiesa arba ↑netiesa. Logines funkcijas galima rašyti programose, jų būna ↑kompiliatorių ir ↑taikomųjų programų bibliotekose. atitikmenys:… … Enciklopedinis kompiuterijos žodynas**Logical positivism**— (also known as logical empiricism, scientific philosophy, and neo positivism) is a philosophy that combines empiricism the idea that observational evidence is indispensable for knowledge with a version of rationalism incorporating mathematical… … Wikipedia**Logical truth**— is one of the most fundamental concepts in logic, and there are different theories on its nature. A logical truth is a statement which is true and remains true under all reinterpretations of its components other than its logical constants. It is… … Wikipedia**logical positivism**— logical positivist. a philosophical movement that stresses the function of philosophy as a method of criticizing and analyzing science and that rejects all transcendental metaphysics, statements of fact being held to be meaningful only if they… … Universalium**Logical security**— consists of software safeguards for an organization’s systems, including user ID and password access, authentication, access rights and authority levels. These measures are to ensure that only authorized users are able to perform actions or… … Wikipedia**Function (mathematics)**— f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … 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**Logical implication**— In logic and mathematics, logical implication is a logical relation that holds between a set T of formulae and a formula B when every model (or interpretation or valuation) of T is also a model of B . In symbols,# T models B, # T Rightarrow B # T … Wikipedia