Ladder

Proof systems — the ladder

One essay so far against this idea. A ladder is the distinct arguments that stand against one idea, and this one has room to grow.
  1. ¬(((p → q) ∧ (q → r)) → (p → r))(p → q) ∧ (q → r)¬(p → r)p → qq → rp¬r¬p×q¬q×r×assume the formula false, then take it apart: ((p → q) ∧ (q → r)) → (p → r)every branch closes, so the assumption is impossible — the formula is valid

    The tree that closes

    To prove a formula, assume it false and take it apart. Every branch ends in a contradiction, or one of them describes exactly how it could have been false — and either way the tree is the answer, drawn.

    rung 1 · logic

All ladders