A variable occurrence in a first-order formula is bound when it lies in the scope of a quantifier binding that name. The same name can have both bound and free occurrences in one formula. A first-order substitution replaces only free occurrences; a fresh renaming of bound occurrences and their binder preserves the formula up to alpha equivalence.

Ancestors (6)

  1. First-order logic
  2. Mathematical logic
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (13)

View article source

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.
See all articles in the same topic Create my own version