Structures exhibiting strong comprehension properties have been utiliz
ed in different fields of Mathematical Logic and Theoretical Computer
Science. Although the techniques employed and the intended application
s are quite different, these structures are essentially alike. Startin
g from a general definition of Hyperuniverse, we present here a compre
hensive framework for investigating these structures. We also give a p
rocedure for constructing Hyperuniverses which encompasses all known e
xamples and provides many new non-epsilon-isomorphic and even non-home
omorphic structures.