# Is any computational complexity question solved by injury priority method except Post problem?

As we know, there are many questions of Turing Degree closed by injury priority method. Is any computational complexity question solved by injury priority method except Post problem or Turing Degree?

I'm curious about how to solve by same or similiar methods the parallel questions up and down the computational hierarchy

BTW，any question in computer science is solved by forcing except continuum hypothesis?

Buhrman and Torenvliet use a resource-bounded priority method to build an oracle $$A$$ such that $$NEXP^A \subseteq P^{NP^A}$$.