Borel ideals vs. Borel sets of countable relations and trees

For every μ < ω₁, let I_μ be the ideal of all sets S ω^μ whose order type is <ω^μ. If μ = 1, then I₁ is simply the ideal of all finite subsets of ω, which is known to be Σ⁰₂-complete. We show that for every μ < ω₁, I_μ is Σ⁰_2μ-complete. As corollaries to this theorem, we prove that the set WO_ωμ of well orderings Rω × ω of order type <ω^μ is Σ⁰_2μ-complete, the set LP_μ of linear orderings R ω × ω that have a μ-limit point is Σ⁰_2μ+1-complete. Similarly, we determine the exact complexity of the set LT_μ of trees T ^<ωω of Luzin height <μ, the set WR_μ of well-founded partial orderings of height <μ, the set LR_μ of partial orderings of Luzin height <μ, the set WF_μ of well-founded trees T ^<ωω of height <μ(the latter is an old theorem of Luzin). The proofs use the notions of Wadge reducibility and Wadge games. We also present a short proof to a theorem of Luzin and Garland about the relation between the height of ‘the shortest tree’ representing a Borel set and the complexity of the set.