From hierarchies to well-foundedness

We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies (of various complexity) have been extensively studied, we point out that (if parameters are allowed) well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting (Π01−CA0)α⊢wf(α)where(Π01−CA0)α stands for the iteration of Π01 comprehension (with parameters) along some ordinal α and wf(α) stands for the well-foundedness of α.