We prove that the classes of UHF algebras and AF algebras, while not axiomatizable, can be characterized as those C*-algebras that omit certain types in the logic of metric structures.

We show that the universal theory of the hyperfinite II $_1$ factor is not computable. The proof uses the recent result that MIP*=RE. Combined with an earlier observation of the authors, this yields a proof that the Connes Embedding Problem has a negative solution that avoids the equivalences with Kirchberg’s QWEP Conjecture and Tsirelson’s Problem.

We realize the Jiang-Su algebra, all UHF algebras, and the hyperfinite II1factor as Fraïssé limits of suitable classes of structures. Moreover by means of Fraïssé theory we provide new examples of AF algebras with strong homogeneity properties. As a consequence of our analysis we deduce Ramsey-theoretic results about the class of full-matrix algebras.

The Connes Embedding Problem asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.

Shelah, S., C. Laflamme and B. Hart, Models with second order properties V: A general principle, Annals of Pure and Applied Logic 64 169–194. We present a general framework for carrying out the construction in [2-10] and others of the same type. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which would be much easier in a generic extension of the (...) universe, and the second player cheats with the aid of ♦. Section 1 contains an axiomatic framework suitable for the description of a number of related constructions, and the statement of the main theorem 1.9 in terms of this framework. In Section 2 we illustrate the use of our combinatorial principle. The proof of the main result is then carried out in Sections 3–5. (shrink)

A countable unidimensional theory without the omitting types order property (OTOP) has prime models over pairs and is hence classifiable. We show that this is not true for uncountable unidimensional theories.

Let T be simple, work in Ceq over a boundedly closed set. Let p ∈ S(θ) be internal in a quasi-stably-embedded type-definable set Q (e.g., Q is definable or stably-embedded) and suppose (p, Q) is ACL-embedded in Q (see definitions below). Then Aut(p/Q) with its action on pC is type-definable in Ceq over θ. In particular, if p ∈ S(θ) is internal in a stably-embedded type-definable set Q, and pC υ Q is stably-embedded, then Aut(p/Q) is type-definable with its action (...) on pC. (shrink)

We answer a question of Cassidy and Kolchin about the universality of the constrained closure of a differential field by working in a larger category of models.