Free variables and bound variables

Short description: Concept in mathematics or computer science

For bound variables in computer programming, see Name binding.

For free variables in systems of linear equations, see Free variables (system of linear equations).

"Free variable" redirects here. It is not to be confused with Free parameter or Dummy variable (statistics).

In mathematics, and in other disciplines involving formal languages, including mathematical logic and computer science, a variable may be said to be either free or bound. Some older books use the terms real variable and apparent variable for free variable and bound variable, respectively. A free variable is a notation (symbol) that specifies places in an expression where substitution may take place and is not a parameter of this or any container expression. The idea is related to a placeholder (a symbol that will later be replaced by some value), or a wildcard character that stands for an unspecified symbol.

In computer programming, the term free variable refers to variables used in a function that are neither local variables nor parameters of that function. The term non-local variable is often a synonym in this context.

An instance of a variable symbol is bound, in contrast, if the value of that variable symbol has been bound to a specific value or range of values in the domain of discourse or universe. This may be achieved through the use of logical quantifiers, variable-binding operators, or an explicit statement of allowed values for the variable (such as, "...where n is a positive integer".) A variable symbol overall is bound if at least one occurrence of it is bound.[1] Since the same variable symbol may appear in multiple places in an expression, some occurrences of the variable symbol may be free while others are bound,[1]: 78 hence "free" and "bound" are at first defined for occurrences and then generalized over all occurrences of said variable symbol in the expression. However it is done, the variable ceases to be an independent variable on which the value of the expression depends, whether that value be a truth value or the numerical result of a calculation, or, more generally, an element of an image set of a function.

While the domain of discourse in many contexts is understood, when an explicit range of values for the bound variable has not been given, it may be necessary to specify the domain in order to properly evaluate the expression. For example, consider the following expression in which both variables are bound by logical quantifiers:

∀y∃x(x=y)

This expression evaluates to false if the domain of x and y is the real numbers, but true if the domain is the complex numbers.

The term "dummy variable" is also sometimes used for a bound variable (more commonly in general mathematics than in computer science), but this should not be confused with the identically named but unrelated concept of dummy variable as used in statistics, most commonly in regression analysis.[2]p.17

## Contents

* 1 Examples
* 1.1 In proofs
* 1.2 Variable-binding operators
* 2 Formal explanation
* 2.1 Function definition and operators as binders
* 3 Natural language
* 3.1 Pronouns as free variables
* 3.2 Anaphors as bound variables
* 3.3 Binding theory
* 3.4 Quantificational noun phrases
* 3.5 Wh-questions and relative clauses
* 3.6 Sloppy versus strict identity in ellipsis
* 4 See also
* 5 References
* 6 Further reading

## Examples

Before stating a precise definition of free variable and bound variable, the following are some examples that perhaps make these two concepts clearer than the definition would:

* In the expression:

∑k=110f(k,n),
n is a free variable and k is a bound variable; consequently the value of this expression depends on the value of n, but there is nothing called k on which it could depend.

* In the expression:

∫0∞xy−1e−xdx,
y is a free variable and x is a bound variable; consequently the value of this expression depends on the value of y, but there is nothing called x on which it could depend.

* In the expression:

limh->0f(x+h)−f(x)h,
x is a free variable and h is a bound variable; consequently the value of this expression depends on the value of x, but there is nothing called h on which it could depend.

* In the expression:

∀x ∃y [φ(x,y,z)],
z is a free variable and x and y are bound variables, associated with logical quantifiers; consequently the logical value of this expression depends on the value of z, but there is nothing called x or y on which it could depend.

### In proofs

In a broader context, bound variables are fundamental to the structure of mathematical proofs. For example, the following proof shows that the square of any positive even integer is divisible by 4:

> Let n be an arbitrary positive even integer. By definition, there exists an integer k such that n=2k. Substituting this into the expression for the square gives n2=(2k)2=4k2. Since k is an integer, k2 is also an integer. Therefore, n2 is divisible by 4.

In this proof, both n and k function as bound variables, but they are bound in different ways.[3]

The variable n is introduced as an arbitrary but particular element of a set. The statement "Let n be..." implicitly functions as a universal quantifier, binding n for the scope of the proof. The proof establishes a property for this single, arbitrary n, which licenses the general conclusion that the property holds for all positive even integers.[4]

The variable k, on the other hand, is bound by an existential quantifier ("there exists an integer k"). It is introduced to represent a specific, though unnamed, integer whose existence is guaranteed by the definition of n being even. The scope of k is limited to the reasoning that follows its introduction.[5]

Thus, neither variable is free; their meaning is entirely determined by their role within the logical structure of the proof.

### Variable-binding operators

In mathematics and logic, a number of symbols function as variable-binding operators. These operators take a function or an open formula as an argument and bind a free variable within that expression to a specific domain or range of values, creating a new expression whose meaning does not depend on the bound variable.[6]

Common variable-binding operators include:

* The summation (Σ) and product (Π) operators, which bind a variable over a set or range of values.

∑x∈Sf(x)∏x∈Sf(x)

* The integral (∫) and limit (lim) operators, which bind a variable over a continuum or as it approaches a certain value.

∫abf(x)dxlimx->cf(x)

* The logical quantifiers, such as the universal quantifier (∀) and the existential quantifier (∃), which bind a variable over a domain of discourse.

∀x,P(x)∃x,P(x)

In each case, the variable x is bound within the expression that follows the operator (e.g., f(x) or P(x)). Many of these operators act on a function of the bound variable. While standard notation is often sufficient, complex expressions with nested operators can become ambiguous, particularly if the same variable name is reused. This can lead to a problem known as variable capture, where a variable intended to be free is incorrectly bound by an operator in a different scope.[7]

To avoid such ambiguity, it can be useful to switch to a notation that makes the binding explicit, treating the operators as higher-order functions. This approach, rooted in the principles of lambda calculus, clearly separates the function being operated on from the operator itself.[8]

For example:

* The summation ∑k=110f(k,n) can be written to make the functional argument explicit:

∑{1,…,10}(k↦f(k,n))

Here, the operator ∑Sf applies to the set S and the function f.

* The derivative operator can also be represented clearly as taking a function as its argument:

D(x↦x2+2x+1)

This notation clarifies that the operator D is applied to the entire function x↦x2+2x+1, rather than just an expression in which x happens to be a variable.

## Formal explanation

Tree summarizing the syntax of the expression ∀x((∃yA(x))∨B(z))

Variable-binding mechanisms occur in different contexts in mathematics, logic and computer science. In all cases, however, they are purely syntactic properties of expressions and variables in them. For this section we can summarize syntax by identifying an expression with a tree whose leaf nodes are variables, constants, function constants or predicate constants and whose non-leaf nodes are logical operators. This expression can then be determined by doing an in-order traversal of the tree. Variable-binding operators are logical operators that occur in almost every formal language. A binding operator Q takes two arguments: a variable v and an expression P, and when applied to its arguments produces a new expression Q(v,P). The meaning of binding operators is supplied by the semantics of the language and does not concern us here.

Variable binding relates three things: a variable v, a location a for that variable in an expression and a non-leaf node n of the form Q(v,P). It worth noting that we define a location in an expression as a leaf node in the syntax tree. Variable binding occurs when that location is below the node n.

In the lambda calculus, `x` is a bound variable in the term `M = λx. T` and a free variable in the term `T`. We say `x` is bound in `M` and free in `T`. If `T` contains a subterm `λx. U` then `x` is rebound in this term. This nested, inner binding of `x` is said to "shadow" the outer binding. Occurrences of `x` in `U` are free occurrences of the new `x`.[9]

Variables bound at the top level of a program are technically free variables within the terms to which they are bound but are often treated specially because they can be compiled as fixed addresses. Similarly, an identifier bound to a recursive function is also technically a free variable within its own body but is treated specially.

A closed term is one containing no free variables.

### Function definition and operators as binders

A clear example of a variable-binding operator from mathematics is function definition. An expression that defines a function, such as the right-hand side of:

f=[(x1,…,xn)↦t],

binds the variables x1,…,xn. The expression t, which forms the body of the function, may contain some, all, or none of the variables x1,…,xn, which are its formal parameters. Any occurrence of these variables within t is bound by the function definition. The body t may also contain other variables, which would be considered free variables whose values must be determined from a wider context.[6]

The expression [(x1,…,xn)↦t] is directly analogous to lambda expressions in lambda calculus, where the λ symbol is the fundamental variable-binding operator. For instance, the function definition (x↦x2) is equivalent to the lambda abstraction λx.x2.[8]

The same definition, binding the function being defined to the name f, is more commonly written in mathematical texts in the form

f(x1,…,xn)=t.

Other mathematical operators can be understood as higher-order functions that bind variables. For example, the summation operator, Σ, can be analyzed as an operator that takes a function and a set to evaluate that function over. The expression:

∑x∈Sx2

binds the variable x within the term x2. The scope of the binding is the term that follows the summation symbol. This expression can be treated as a more compact notation for:

∑S(x↦x2)

Here, ∑Sf is an operator with two parameters: a one-parameter function f (in this case, x↦x2) and a set S to evaluate that function over.

Other operators can be expressed in a similar manner. The universal quantifier ∀x∈S,P(x) can be understood as an operator that evaluates to the logical conjunction of the Boolean-valued function P applied to each element in the (possibly infinite) set S. Likewise, the product operator (∏), the limit operator (limn->∞), and the integral operator (∫abf(x)dx) all function as variable binders, binding the variables n and x respectively over a specified domain.[10]

## Natural language

When analyzed through the lens of formal semantics, natural languages exhibit a system of variable binding that is analogous to what is found in formal logic and computer science.[11] This system governs how referring expressions, particularly pronouns, are interpreted within a sentence or discourse.[12]

### Pronouns as free variables

In English, personal pronouns such as he, she, they, and their variants (e.g., her, him) can function as free variables.[13] A free variable is a term whose referent is not determined within the immediate syntactic structure of the sentence and must be identified by the broader context, which can be either linguistic or situational (pragmatic).[14]

Consider the following sentence:

> Lisa found her book.

The possessive pronoun her is a free variable. Its interpretation is flexible; it can refer to Lisa, an entity within the sentence, or to some other female individual salient in the context of the utterance.[12] This ambiguity leads to two primary interpretations, which can be formally represented using co-indexing subscripts.[15] An identical subscript indicates coreference, while different subscripts signal that the expressions refer to different entities.

1. Lisai found heri book.
* (This interpretation signifies coreference, where "her" refers to Lisa. This is often called an anaphoric reading, where "her" is an anaphor and "Lisa" is its antecedent.)
2. Lisai found herj book.
* (In this interpretation, "her" refers to a female individual who is not Lisa, for instance, a person named Jane who was mentioned earlier in the conversation.)

This distinction is not merely a theoretical exercise. Some languages have distinct pronominal forms to differentiate between these two readings. For example, Norwegian and Swedish use the reflexive possessive sin for the coreferential reading (heri) and a non-reflexive form like hennes (in Swedish) for the non-coreferential reading (herj).[16]

While English does not have this explicit distinction in its standard pronouns, it can force a coreferential reading by using the emphatic possessive own.[17]

* Lisai found heri own book. (Coreference is required)
* *Lisai found herj own book. (This interpretation is ungrammatical)

### Anaphors as bound variables

In contrast to personal pronouns, reflexive pronouns (e.g., himself, herself, themselves) and reciprocal pronouns (e.g., each other) act as bound variables, also known in linguistics as anaphors.[15] A bound variable is an expression that must be co-indexed with, and c-commanded by, an antecedent within a specific syntactic domain.[15]

Consider the sentence:

> Jane hurt herself.

The reflexive pronoun herself must refer to the subject of the clause, Jane. It cannot refer to any other individual.[12] This obligatory coreference is a hallmark of a bound variable.

* Janei hurt herselfi. (Grammatical interpretation: herself = Jane)
* *Janei hurt herselfj. (Ungrammatical interpretation: herself ≠ Jane)

This binding relationship can be formally captured using a lambda expression, a tool from lambda calculus used in formal semantics to model function abstraction and application.[18] The sentence can be represented as:

`(λx.x hurt x)(Jane)`

In this notation:

* `λx` is the lambda operator that binds the variable `x`.
* `x hurt x` is the predicate, a function that takes an argument and states that this argument hurt itself.
* `(Jane)` is the argument applied to the function.

The expression evaluates to "Jane hurt Jane," correctly capturing the fact that the subject and object of the verb are the same entity.[18]

### Binding theory

The distinct behavior of pronouns and anaphors is systematically explained by the binding theory, a central component of Noam Chomsky's Government and Binding Theory.[15] This theory proposes three principles that govern the interpretation of different types of noun phrases:

* Principle A: An anaphor (reflexive, reciprocal) must be bound in its governing category (roughly, the local clause).[15] This explains why herself in "Jane hurt herself" must be bound by Jane.

* Principle B: A pronoun must be free in its governing category.[15] This explains why a personal pronoun often cannot be bound by a local antecedent. For example, in "Ashley hit her," the pronoun her cannot refer to Ashley.[19]
* *Ashleyi hit heri. (Ungrammatical due to Principle B)
* Ashleyi hit herj. (Grammatical; her refers to someone other than Ashley)

* Principle C: An R-expression (a referring expression like a proper name, e.g., Jane, or a definite description, e.g., the woman) must be free everywhere.[15] This prevents an R-expression from being co-indexed with a c-commanding pronoun, as in *Hei said that Johni was tired*.[20]

### Quantificational noun phrases

The concept of variable binding is essential for understanding quantificational noun phrases (QNPs), such as every student, some politician, or no one.[18] Unlike proper names, these phrases do not refer to a specific entity. Instead, they express a quantity over a set of individuals.[18] A QNP can bind a pronoun that falls within its scope, making the pronoun a bound variable.

> Every studenti thinks hei is smart.

In this sentence, the pronoun he is most naturally interpreted as a bound variable.[21] Its reference co-varies with the individuals in the set denoted by "every student". The sentence does not mean that every student thinks a specific person (e.g., Peter) is smart; rather, it means that for each individual student x, x thinks that x is smart. In syntactic theories, this is often analyzed via a process of quantifier raising (QR), where the QNP moves at the abstract syntactic level of logical form to a position where it c-commands and binds the pronoun.[21]

### Wh-questions and relative clauses

Variable binding is also central to the analysis of wh-movement, which occurs in the formation of questions and relative clauses.[22] Wh-words like who, what, and which function as operators that bind a variable in the main clause.[23]

* Question: Whoi does John like ti?
* Relative Clause: The man [whoi Mary saw ti] is my brother.

In these structures, the wh-word is said to move from an underlying position, leaving behind a "trace" (t), which is treated as a bound variable.[15] The meaning of the question can be paraphrased as "For which person x, does John like x?".[18] Similarly, the relative clause denotes a set of individuals x such that "Mary saw x".[18]

### Sloppy versus strict identity in ellipsis

The distinction between free and bound variables provides a powerful explanation for certain ambiguities that arise under VP-ellipsis.[24][25] Consider the following sentence:

> John loves his mother, and Bill does too.

This sentence has two distinct interpretations:

1. Strict identity: Bill loves John's mother.
2. Sloppy identity: Bill loves Bill's mother.

This ambiguity can be explained by the status of the pronoun his in the first clause.[19]

* If his is treated as a free variable referring to John, the elided (or "missing") verb phrase is interpreted as "loves John's mother". When this is applied to Bill, the result is the strict reading.[19]
* If his is treated as a bound variable bound by the subject of its clause (i.e., John), the verb phrase is interpreted as a lambda-abstracted property: `λx.x loves x's mother`. When this property is applied to Bill, the result is the sloppy reading.[19]

The existence of the sloppy identity reading is considered strong evidence for the psychological reality of bound variable interpretations in the grammar of natural languages.[26]

Thus, the distribution and interpretation of pronouns and other referring expressions in natural languages are not random but are governed by a sophisticated syntactic and semantic system.[12]

The distinction between free and bound variables is a cornerstone of modern linguistic theory, providing the analytical tools necessary to account for coreference, quantification, question formation, and ellipsis.

## See also

* Closure (computer science)
* Combinatory logic
* Lambda lifting
* Name binding
* Scope (programming)
* Scope (logic)

## References

1. ↑ 1.0 1.1 Quine, Willard Van Orman (1982). Mathematical Logic (Revised ed.). Harvard University Press. pp. 142–143. ISBN 978-0674554511.
2. ↑ Robert S. Wolf (2005) A Tour through Mathematical Logic ISBN 978-0-88385-036-7
3. ↑ Velleman, Daniel J. (2006). How to Prove It: A Structured Approach (2nd ed.). Cambridge: Cambridge University Press. pp. 99–103, 129–131. ISBN 978-0-521-67599-4.
4. ↑ Hammack, Richard (2013). Book of Proof (2nd ed.). Richmond, VA: Virginia Commonwealth University. pp. 89–92. ISBN 978-0-9894721-0-4. https://www.people.vcu.edu/~rhammack/BookOfProof/.
5. ↑ Enderton, Herbert B. (2001). A Mathematical Introduction to Logic (2nd ed.). Burlington, MA: Harcourt/Academic Press. pp. 70–73. ISBN 978-0-12-238452-3.
6. ↑ 6.0 6.1 Forster, Thomas (2003). Logic, Induction and Sets. Cambridge: Cambridge University Press. pp. 13–15. ISBN 978-0-521-53361-4.
7. ↑ Pierce, Benjamin C. (2002). Types and Programming Languages. Cambridge, MA: MIT Press. pp. 59–62. ISBN 978-0-262-16209-8.
8. ↑ 8.0 8.1 Barendregt, Hendrik P. (1984). The Lambda Calculus: Its Syntax and Semantics. Amsterdam: North-Holland. pp. 26–28. ISBN 978-0-444-87508-2.
9. ↑ Thompson 1991, p. 33.
10. ↑ Frege, Gottlob (1893) (in de). Grundgesetze der Arithmetik. I. Jena: Verlag Hermann Pohle.
11. ↑ Heim, Irene; Kratzer, Angelika (1998). Semantics in Generative Grammar. Malden, MA: Blackwell. pp. 93–125. ISBN 978-0-631-19713-3.
12. ↑ 12.0 12.1 12.2 12.3 Büring, Daniel (2005). Binding Theory. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press. pp. 1–4. ISBN 9780521812801.
13. ↑ In the terminology of Heim and Kratzer (1998), pronouns that are not bound are associated with an assignment function g provided by the context, which assigns them a referent. See Heim, Irene; Kratzer, Angelika (1998). Semantics in Generative Grammar. Malden, MA: Blackwell. p. 243. ISBN 978-0-631-19713-3.
14. ↑ Partee, Barbara H. (1978). "Bound variables and other anaphors". Proceedings of the 2nd Conference on Theoretical Issues in Natural Language Processing: 79–85. doi:10.3115/980228.980245.
15. ↑ 15.0 15.1 15.2 15.3 15.4 15.5 15.6 15.7 Chomsky, Noam (1981). Lectures on Government and Binding. Dordrecht: Foris Publications. p. 188. ISBN 90-70176-28-9.
16. ↑ Haspelmath, Martin (2008). "Chapter 105: Ditransitive Constructions". in Haspelmath, Martin; Dryer, Matthew S.; Gil, David et al.. Leipzig: Max Planck Institute for Evolutionary Anthropology. https://wals.info/chapter/105.
17. ↑ Reinhart, Tanya; Reuland, Eric (1993). "Reflexivity". Linguistic Inquiry 24 (4): 657–720.
18. ↑ 18.0 18.1 18.2 18.3 18.4 18.5 Heim, Irene; Kratzer, Angelika (1998). Semantics in Generative Grammar. Malden, MA: Blackwell. pp. 184–186. ISBN 978-0-631-19713-3.
19. ↑ 19.0 19.1 19.2 19.3 Reinhart, Tanya (2016). Anaphora and Semantic Interpretation. London: Routledge. ISBN 9781134993604.
20. ↑ Lasnik, Howard (1989). Essays on Anaphora. Studies in Natural Language and Linguistic Theory. 16. Dordrecht: Springer Netherlands. pp. 100–104. ISBN 9781556080906.
21. ↑ 21.0 21.1 May, Robert (1985). Logical Form: Its Structure and Derivation. Linguistic inquiry monographs. 12. Cambridge, MA: MIT Press. pp. 64–70. ISBN 9780262631020.
22. ↑ Haegeman, Liliane (1994). Introduction to Government and Binding Theory (2nd ed.). Oxford: Blackwell. pp. 395–400. ISBN 978-0-631-19067-7.
23. ↑ Chomsky, Noam (1977). "On Wh-Movement". in Culicover, Peter W.; Wasow, Thomas; Akmajian, Adrian. Formal Syntax. New York: Academic Press. pp. 71–132. ISBN 978-0121992408.
24. ↑ Sag, Ivan (1976). Deletion and Logical Form. MIT dissertation.
25. ↑ Williams, Edwin S. (1977). "Discourse and Logical Form.". Linguistic Inquiry 8 (1): 101–39. http://www.jstor.org/stable/4177974.
26. ↑ Dalrymple, Mary; Shieber, Stuart M.; Pereira, Fernando C. N. (1991). "Ellipsis and Higher-Order Unification". Linguistics and Philosophy 14 (4): 399–452. doi:10.1007/BF00627759.

* Thompson, Simon (1991). Type theory and functional programming. Wokingham, England: Addison-Wesley. ISBN 0201416670. OCLC 23287456.
* Wolf, Robert S. (2005). A Tour through Mathematical Logic. 30. Mathematical Association of America. ISBN 978-0-88385-042-8.

## Further reading

* Template:Princeton Companion to Mathematics

* v
* t
* e

Calculus

Precalculus|

* Binomial theorem
* Concave function
* Continuous function
* Factorial
* Finite difference
* Free variables and bound variables
* Fundamental theorem
* Graph of a function
* Linear function
* Mean value theorem
* Radian
* Rolle's theorem
* Secant
* Slope
* Tangent

Limits|

* Indeterminate form
* Limit of a function
* One-sided limit
* Limit of a sequence
* Orders of approximation
* (ε, δ)-definition of limit

Differential calculus|

* Chain rule
* Derivative
* Differential
* Differential equation
* Differential operator
* Implicit differentiation
* Inverse functions and differentiation
* L'Hôpital's rule
* Leibniz's rule
* Logarithmic derivative
* Mean value theorem
* Newton's method
* Notation
* Leibniz's notation
* Newton's notation
* Product rule
* Quotient rule
* Regiomontanus' angle maximization problem
* Related rates
* Simplest rules
* Constant factor rule in differentiation
* Linearity of differentiation
* Power rule
* Sum rule in differentiation
* Stationary point
* First derivative test
* Second derivative test
* Extreme value theorem
* Maxima and minima
* Taylor's theorem

Integral calculus|

* Antiderivative
* Arc length
* Constant of integration
* Differentiation under the integral sign
* Fundamental theorem of calculus
* Integral of secant cubed
* Integral of the secant function
* Integration by parts
* Integration by substitution
* Tangent half-angle substitution
* Partial fractions in integration
* Quadratic integral
* Proof that 22/7 exceeds π
* Simplest rules
* Constant factor rule in integration
* Linearity of integration
* Sum rule in integration
* Trapezoidal rule
* Trigonometric substitution

Vector calculus|

* Curl
* Directional derivative
* Divergence
* Divergence theorem
* Gradient
* Gradient theorem
* Green's theorem
* Laplacian
* Stokes' theorem

Multivariable calculus|

* Curvature
* Disc integration
* Divergence theorem
* Exterior
* Gabriel's Horn
* Geometric
* Hessian matrix
* Jacobian matrix and determinant
* Line integral
* Matrix
* Multiple integral
* Partial derivative
* Shell integration
* Surface integral
* Tensor
* Volume integral

Series|

* Abel's test
* Alternating
* Alternating series test
* Arithmetico-geometric sequence
* Binomial
* Cauchy condensation test
* Direct comparison test
* Dirichlet's test
* Euler–Maclaurin formula
* Fourier
* Geometric
* Harmonic
* Infinite
* Integral test for convergence
* Limit comparison test
* Maclaurin
* Power
* Ratio test
* Root test
* Taylor
* Term test

Special functions and numbers|

* Bernoulli numbers
* e (mathematical constant)
* Exponential function
* Natural logarithm
* Stirling's approximation

History of calculus|

* Adequality
* Brook Taylor
* Colin Maclaurin
* Generality of algebra
* Gottfried Wilhelm Leibniz
* Infinitesimal
* Infinitesimal calculus
* Isaac Newton
* Fluxion
* Law of Continuity
* Leonhard Euler
* Method of Fluxions
* The Method of Mechanical Theorems

Lists|

* Differentiation rules
* List of integrals of exponential functions
* List of integrals of hyperbolic functions
* List of integrals of inverse hyperbolic functions
* List of integrals of inverse trigonometric functions
* List of integrals of irrational functions
* List of integrals of logarithmic functions
* List of integrals of rational functions
* List of integrals of trigonometric functions
* List of limits
* List of mathematical symbols
* Lists of integrals

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Free variables and bound variables. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Free_variables_and_bound_variables&oldid=4021716"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template