Induction is proving a statement is true for a set of inputs. It uses an initial condition and a special condition to prove that a statement is true for all inputs in the set.
Reduction is transforming a problem into another. This enables reusing existing solution.
Recursion is the same function called inside itself. This is like hierarchical reduction.