We consider the complexity of the isomorphism relation on countable first-order structures with transitive automorphism groups. We use the theory of Borel reducibility of equivalence relations to show that the isomorphism problem for vertex-transitive graphs is as complicated as the isomorphism problem for arbitrary graphs and determine for which first-order languages the isomorphism problem for transitive countable structures is as complicated as it is for arbitrary countable structures. We then use these results to characterize the complexity of the isometry relation (...) for certain classes of homogeneous and ultrahomogeneous metric spaces. (shrink)

§1. Introduction. Ideals and filters of subsets of natural numbers have been studied by set theorists and topologists for a long time. There is a vast literature concerning various kinds of ultrafilters. There is also a substantial interest in nicely definable ideals—these by old results of Sierpiński are very far from being maximal— and the structure of such ideals will concern us in this announcement. In addition to being interesting in their own right, Borel and analytic ideals occur naturally in (...) the investigations of compact subsets of the space of all Baire class 1 functions on a Polish space, see [12, 18]. Also, certain objects associated with such ideals are of considerable interest and were quite extensively studied by several authors. Let us list here three examples; in all three of them I stands for an analytic or Borel ideal.1. The partial order induced by I on P: X ≥I Y iff X \ Y ϵ I and the partial order.2. Boolean algebras of the form P/I and their automorphisms.3. The equivalence relation associated with I: XEI Y iff X Δ ϵ I.In Section 4, we will have an opportunity to state some consequences of our results for equivalence relations as in 3. (shrink)

We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to class). Though we sometimes work in a slightly larger context, we are principally concerned with the case where each class is an invariant Borel class (i.e. the class of all models, with underlying set $= \omega$, of an $L_{\omega_1\omega}$ sentence; from this point of view, the reducibility can be thought of as a (...) (rather weak) sort of $L_{\omega_1\omega}$-interpretability notion). We prove a number of general results about this notion, but our main thrust is to situate various mathematically natural classes with respect to the preordering, most notably classes of algebraic structures such as groups and fields. (shrink)