A formal definition of what it means for a machine to learn a collection of concepts in an order determined by a finite acyclic digraph of recursive functions is presented. We show that given a labelled graph G = (V, E) representing the learning structure, there are sets S such that in order to learn a program corresponding to some node i, a machine must have precisely learned programs corresponding to all the predecessor nodes.