We introduce a new approach to the model theory of metric structures by defining the notion of a metric abstract elementary class (MAEC) closely resembling the notion of an abstract elementary class. Further we define the framework of a homogeneous MAEC were we additionally assume the existence of arbitrarily large models, joint embedding, amalgamation, homogeneity and a property which we call the perturbation property. We also assume that the Löwenheim-Skolem number, which in this setting refers to the density character of (...) the set instead of the cardinality, is ${\aleph_0}$ . In these settings we prove an analogue of Morley’s categoricity transfer theorem. We also give concrete examples of homogeneous MAECs. (shrink)

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence, in terms of relatively simple invariants. Where this is impossible, it is useful to have concrete results saying so. In model theory and descriptive set theory, there is a large body of work showing that certain classes of mathematical structures admit classification while others do not. In the present paper, we (...) describe some recent work on classification in computable structure theory.Section 1 gives some background from model theory and descriptive set theory. From model theory, we give sample structure and non-structure theorems for classes that include structures of arbitrary cardinality. We also describe the notion of Scott rank, which is useful in the more restricted setting of countable structures. From descriptive set theory, we describe the basic Polish space of structures for a fixed countable language with fixed countable universe. We give sample structure and non-structure theorems based on the complexity of the isomorphism relation, and on Borel embeddings.Section 2 gives some background on computable structures. We describe three approaches to classification for these structures. The approaches are all equivalent. However, one approach, which involves calculating the complexity of the isomorphism relation, has turned out to be more productive than the others. Section 3 describes results on the isomorphism relation for a number of mathematically interesting classes—various kinds of groups and fields. In Section 4, we consider a setting similar to that in descriptive set theory. We describe an effective analogue of Borel embedding which allows us to make distinctions even among classes of finite structures. Section 5 gives results on computable structures of high Scott rank. Some of these results make use of computable embeddings. Finally, in Section 6, we mention some open problems and possible directions for future work. (shrink)

Certain basic concepts of geometrical stability theory are generalized to a class of closure operators containing algebraic closure. A specific case of a generalized closure operator is developed which is relevant to Vaught's conjecture. As an application of the methods, we prove THEOREM A. Let G be a superstable group of U-rank ω such that the generics of G are locally modular and Th(G) has few countable models. Let G - be the group of nongeneric elements of G, G + (...) = G o + G - . Let Π= {q ∈ S( $\emptyset$ ): U(q) $A \subset M$ such that M is almost atomic over A ∪ (G + ∩ M) $\cup \bigcup_{p\in \Pi}$ p(M). (shrink)

Let G be a countable group. We prove that there is a model companion for the theory of Hilbert spaces with a group G of automorphisms. We use a theorem of Hulanicki to show that G is amenable if and only if the structure induced by countable copies of the regular representation of G is existentially closed.

We interpret the algebra of finite rank operators as imaginaries inside a Hilbert space. We prove that the Hilbert space enlarged with these imaginaries has built-in canonical bases.

We study Hilbert spaces expanded with a unitary operator with a countable spectrum. We show that the theory of such a structure is ω -stable and admits quantifier elimination.