In this paper we introduce a hierarchy of families which can be derived from the integers using countable collections. This hierarchy coincides with the von Neumann hierarchy of hereditary countable sets in the ZFC-theory with urelements from ℕ. The families from the hierarchy can be coded into countable algebraic structures preserving their algorithmic properties. We prove that there is no maximal level of the hierarchy and that the collection of non-lowα degrees for every computable ordinal ff is the enumeration spectrum of a family from the hierarchy. In particular, we show that the collection of non-lowα degrees for every computable limit ordinal α is a degree spectrum of some algebraic structure.

countable family, class of families, enumeration of family, degree spectra of structure, lowα degree