OurBigBook About$ Donate
 Sign in Sign up

Existential quantifier introduction rule

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Mathematical logic Propositional logic Natural deduction
2026-10-25  0 By others on same topic  0 Discussions Create my own version
From A(t), infer ∃xA(x) when the substitution is capture-free. The term t supplies a witness.

 Ancestors (7)

  1. Natural deduction
  2. Propositional logic
  3. Mathematical logic
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Existential quantification over a finitely named domain
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof resit / 8 / b / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof resit / 8 / c / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Digital systems, linear algebra, introduction to formal proof / 8 / a / i / Solution

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook