  Ladner’s proof method is called delayed diagonalization.  He generalized his result to show that for any two well-behaved complexity classes, C, E such that C is strictly contained in E, there is an intermediate class, D such that C is strictly contained in D and D is strictly contained in E.  Thus the ordering of complexity classes is dense. 