I analyze the hierarchies of the bounded resurrection axioms and their “virtual” versions, the virtual bounded resurrection axioms, for several classes of forcings (the emphasis being on the subcomplete forcings). I analyze these axioms in terms of implications and consistency strengths. For the virtual hierarchies, I provide level-by-level equiconsistencies with an appropriate hierarchy of virtual partially super-extendible cardinals. I show that the boldface resurrection axioms for subcomplete or countably closed forcing imply the failure of Todorčević’s square at the appropriate level. I also establish connections between these hierarchies and the hierarchies of bounded and weak bounded forcing axioms.

I analyze the hierarchies of the bounded and the weak bounded forcing axioms, with a focus on their versions for the class of subcomplete forcings, in terms of implications and consistency strengths. For the weak hierarchy, I provide level-by-level equiconsistencies with an appropriate hierarchy of partially remarkable cardinals. I also show that the subcomplete forcing axiom implies Larson’s ordinal reflection principle at ω2, and that its effect on the failure of weak squares is very similar to that of Martin’s Maximum.