Properties of uniformly hard languages

Uniformly hard languages are languages that do not contain too many easy instances. We show that certain problems are uniformly hard, prove the uniformly hard analog of the Time Hierarchy Theorem, and explore the properties of the polynomial hierarchy with respect to uniform hardness.