OurBigBook About$ Donate
 Sign in Sign up

Conditional modus ponens (Γ⊢A→B, A→(B→C)⟹Γ⊢A→C)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Mathematical logic Propositional logic Deduction theorem for propositional logic
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Conditional modus ponens derives A→C from A→B and A→(B→C). It is the step which translates a modus ponens rule inference when discharging a common assumption. In the case-elimination Hilbert calculus, the third scheme first gives A→(¬B→C); the second scheme combines the two conditionals to give A→C.

 Ancestors (7)

  1. Deduction theorem for propositional logic
  2. Propositional logic
  3. Mathematical logic
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Case-elimination Hilbert calculus
  • Conditional modus ponens
  • Past exam of the logic and set theory course of the University of Oxford / 2007 / A / 2 / iii / 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