Related papers: A computability-theoretic reformulation of the Con…

The Connes Embedding Problem (CEP) is a problem in the theory of tracial von Neumann algebras and asks whether or not every tracial von Neumann algebra embeds into an ultrapower of the hyperfinite II$_1$ factor. The CEP has had interactions…

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In an effort to provide a negative solution to the KEP and motivated by the recent refutation of the Connes…

We use continuous model theory to obtain several results concerning isomorphisms and embeddings between II_1 factors and their ultrapowers. Among other things, we show that for any II_1 factor M, there are continuum many nonisomorphic…

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…

We show that Tsirelson's problem concerning the set of quantum correlations and Connes' embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg's QWEP conjecture) are essentially equivalent.…

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\cal O_2$. Motivated by the recent refutation of the Connes Embedding Problem using the quantum complexity result MIP*=RE, we…

A II_1 factor embeds into the ultraproduct of the hyperfinite II_1 factor if and only if it satisfies the W*-analogue of Lance's weak expectation property. This note gives a self contained proof of this fact.

We show that any II$_1$ factor that has the same 4-quantifier theory as the hyperfinite II$_1$ factor $\mathcal{R}$ satisfies the conclusion of the Popa Factorial Commutant Embedding Problem (FCEP) and has the Brown property. These results…

Kirchberg's Embedding Problem (KEP) asks whether every separable C$^*$ algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In this paper, we use model theory to show that this conjecture is equivalent to a local…

We show that Connes' embedding problem for II_1-factors is equivalent to a statement about distributions of sums of self-adjoint operators with matrix coefficients. This is an application of a linearization result for finite von Neumann…

We prove that every separable tracial von Neumann algebra embeds into a II$_1$ factor with property (T) which can be taken to have trivial outer automorphism and fundamental groups. We also establish an analogous result for the trivial…

Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable…

We define the notion of self-tracial stability for tracial von Neumann algebras and show that a tracial von Neumann algebra satisfying the Connes Embedding Problem is self-tracially stable if and only if it is amenable. We then generalize a…

We adapt the classical notion of building models by games to the setting of continuous model theory. As an application, we study to what extent canonical operator algebras are enforceable models. For example, we show that the hyperfinite…

We introduce "embedding dimensions" of a family of generators of a finite von Neumann algebra when the von Neumann algebra can be faithfully embedded into the ultrapower of the hyperfinite II$_1$ factor. These embedding dimensions are von…

We give a modification of I. Klep and M. Schweighofer algebraic reformulation of Connes' embedding problem by considering *-algebra of the countably generated free group. This allows to consider only quadratic polynomials in unitary…

We show that Connes' embedding conjecture (CEC) is equivalent to a real version of the same (RCEC). Moreover, we show that RCEC is equivalent to a real, purely algebraic statement concerning trace positive polynomials. This purely algebraic…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…

A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…