 Fixed-point logic In a more technical perspective, Backward Induction strategies can be defined as largest subrelation of the total \(\move\) relation that has at least one successor at each non-terminal node, while satisfying a confluence property between action and preference: