Math 2.0

concept

Modus ponens

Summary

Modus ponens is the rule of inference that gets qq from the two premises pp and p→qp \to q. pp→qq\frac{p \qquad p \to q}{q} It is valid: when the two premises are true, the conclusion qq is true.

Remarks

Most proof systems for propositional logic use modus ponens as a rule. Its partner modus tollens gets ¬p\neg p from ¬q\neg q and p→qp \to q.

Explanations

L1 human

Modus ponens is the most common step in a proof. If you know that nn is divisible by 44, and that each number divisible by 44 is even, then you know that nn is even.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Implication definition
  3. Modus ponens concept

What depends on this

7 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Modus_ponens, lead section