COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM

DOI10.1017/bsl.2016.5zbMath1404.03037OpenAlexW2468512922MaRDI QIDQ5346695

Bradd Hart, Isaac Goldbring

Publication date: 26 May 2017

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/bsl.2016.5

zbMATH Keywords

computabilityConnes embedding problem\(\mathrm{II}_1\) factors

Mathematics Subject Classification ID

General theory of von Neumann algebras (46L10) Models of other mathematical theories (03C65) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Continuous theory of operator expansions of finite dimensional Hilbert spaces and decidability ⋮ \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ Factorial relative commutants and the generalized Jung property for \(\mathrm{II}_1\) factors ⋮ The Connes embedding problem: A guided tour

Cites Work

• Unnamed Item
• Unnamed Item
• Model theory of operator algebras. II: Model theory
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• The analogues of entropy and of Fisher's information measure in free probability theory. II
• On rings of operators
• Existentially closed ${\rm II}_1$ factors
• The Theory of Tracial Von Neumann Algebras Does Not Have A Model Companion
• A proof of completeness for continuous first-order logic
• Global weak solution for a singular two-component reaction-diffusion system
• Hyperlinear and Sofic Groups: A Brief Guide

This page was built for publication: COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM