In this paper, we study the complexity of sets formed by boolean operations (, , and complementation) on NP sets. These are the sets accepted by trees of hardware with NP predictates as leaves, and together form the boolean hierarchy. We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and D^P in a richer perspective. Throughout, we emphasize the structure of the boolean hierarchy and its relations with more common classes.