I'm not really used to inductive proofs at all but I have to proof the associative property in logic inductively, a general description is as followed:
Is $A_l$ a left associative and $A_r$ a right associative form in $B = \bigvee_{i=1}^{n} p_i$ then: $A_l \equiv A_r$ or $((p \vee q) \vee r) \equiv (p \vee (q \vee r))$.
Or discribed more formal: $\bigvee_{i=1}^{n-1} p_i \equiv \bigvee_{i=1}^{n-1} p_{i+1}$
If someone knows how to solve it, it would be nice if I could get a description how to do induction in general with this as an example.