A hierarchy of sets of infinite trees

A hierarchy of sets of infinite (valued) trees is introduced which has no counterpart in the theory of sets of infinite strings ("ω-languages"). As a consequence we obtain that for sets of infinite trees an analogue of McNaughton's fundamental theorem on ω-languages does not hold.