Related papers: Enforceable operator algebras
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 following operator algebras have hyperarithmetic theory: the hyperfinite II$_1$ factor $\mathcal R$, $L(\Gamma)$ for $\Gamma$ a finitely generated group with solvable word problem, $C^*(\Gamma)$ for $\Gamma$ a finitely…
The Connes Embedding Problem (CEP) asks whether every separable II_1 factor embeds into an ultrapower of the hyperfinite II_1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II_1 von…
We study the question when for a given *-algebra $\mathcal{A}$ a sequence of cones $C_n\in M_n(\mathcal{A})$ can be realized as cones of positive operators in a faithful *-representation of $\mathcal{A}$ on a Hilbert space. A…
We provide an alternative proof for the extreme amenability of the unitary group of the hyperfinite II${}_1$-factor von Neumann algebra, endowed with the strong operator topology.
We prove that Connes' Embedding Conjecture holds for the von Neumann algebras of sofic groups, that is sofic groups are hyperlinear. Hence we provide some new examples of hyperlinearity. We also show that the Determinant Conjecture holds…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
An operator system modulo the kernel of a completely positive linear map of the operator system gives rise to an operator system quotient. In this paper, operator system quotients and quotient maps of certain matrix algebras are considered.…
We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
We study the *-double functor between the categories of associative and involutive algebras. It is proved that an associative algebra is isomorphic to a subalgebra of a $C\sp*$-algebra if and only if its *-double is *-isomorphic to a…
We consider various statements that characterize the hyperfinite II$_1$ factors amongst embeddable II$_1$ factors in the non-embeddable situation. In particular, we show that "generically" a II$_1$ factor has the Jung property (which states…
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…
We regard Forcing Notions P adding real numbers and the algebras of P-measurable sets. As for Cohen- and Random-Forcing we can show that each analytic set is P-measurable using Solovay's Unfolding Trick for infinite games. To show this we…
We propose a classification of group properties according to whether they can be deduced from the assumption that a group's subgroup lattice contains an interval isomorphic to some lattice. We are able to classify a few group properties as…