An occurrence of a variable is free when it is outside the scope of a quantifier binding that variable.
The distinction belongs to free variables and bound variables; an occurrence bound by an enclosing quantifier is not free.
Ancestors (6)
Incoming links (54)
- Assignment in a first-order structure
- Bounded arithmetic sentence
- Combinator
- Complete one-type
- Complete two-type
- Composition of lambda terms
- Countable infinitary logic
- Countermodel
- First-order clause
- First-order variable assignment
- Free for substitution
- Free variable in a linear system
- Free variables and bound variables
- Logical formula
- Matrix rank
- N-variable Lindenbaum algebra
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 1 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 1 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 2 / b / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / A / 3 / i / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / A / 4 / i / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 3 / a / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 3 / b / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 4 / b / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2009 / A / 3 / c / ii / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2011 / A / 2 / c / ii / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2011 / A / 3 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 5 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 6 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 87 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 21 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 135 / 5 / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2007 / A / 1 / c / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2007 / B / 5 / ii / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2007 / B / 7 / i / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2008 / B / 5 / i / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 5 / b / Solution
- Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 5 / c / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 2 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 2 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 2 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof resit / 8 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Digital systems, linear algebra and introduction to formal proof / 8 / c / Solution
- Quantifier
- Solvable lambda term
- Universal generalization rule
- Universal typing axiom
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.