If is an equivalence relation on a standard Borel space , then we say that is Borel reducible to if there is a Borel function such that . An equivalence relation on a standard Borel space is Borel if its graph is a Borel subset of . It is countable if each of its equivalence classes is countable. We investigate the complexity of Borel reducibility of countable Borel equivalence relations on standard Borel spaces. We show that it is at least as complex as the relation of inclusion on the collection of Borel subsets of the real line. We also show that Borel reducibility is -complete. The proofs make use of the ergodic theory of linear algebraic groups, and more particularly the superrigidity theory of R. Zimmer.