Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-22T14:07:15.539Z Has data issue: false hasContentIssue false
  • English
  • Français

COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM

Published online by Cambridge University Press:  05 July 2016

ISAAC GOLDBRING  and
BRADD HART
ISAAC GOLDBRING
Affiliation:
DEPARTMENT OF MATHEMATICS, STATISTICS, AND COMPUTER SCIENCE UNIVERSITY OF ILLINOIS AT CHICAGO SCIENCE AND ENGINEERING OFFICES M/C 249 851 S. MORGAN ST., CHICAGO, IL, 60607-7045, USAE-mail: [email protected]: http://www.math.uic.edu/∼isaac
BRADD HART
Affiliation:
DEPARTMENT OF MATHEMATICS AND STATISTICS, MCMASTER UNIVERSITY1280MAIN STREET W., HAMILTON, ONTARIO L8S 4K1, CANADAE-mail: [email protected]: http://www.math.mcmaster.ca/∼bradd
Get access Rights & Permissions [Opens in a new window]

Abstract

The Connes Embedding Problem (CEP) 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.

Keywords

46L1003C6503D45computabilityII1 factorsConnes Embedding Problem
Type
Articles
Information
Bulletin of Symbolic Logic , Volume 22 , Issue 2 , June 2016 , pp. 238 - 248
Copyright
Copyright © The Association for Symbolic Logic 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Ben Yaacov, I., Berenstein, A., Henson, C. W., and Usvyatsov, A., Model theory for metric structures, Model Theory with Applications to Algebra and Analysis, vol. 2, pp. 315–427, London Mathematical Society Lecture Note Series, vol. 350, Cambridge University Press, Cambridge, 2008.Google Scholar
Ben Yaacov, I. and Pedersen, A. P., A proof of completeness for continuous first order logic, this Journal, vol. 75 (2010), pp. 68–190.Google Scholar
Capraro, V., A survey on Connes’ Embedding Conjecture, arXiv 1003.2076.Google Scholar
Connes, A., Classification of injective factors. Annals of Mathematics, vol. 104 (1976), pp. 73–115.Google Scholar
Eagle, C., Farah, I., Kirchberg, E. and Vignati, A., Quantifier elimination in C*-algebras.Google Scholar
Goldbring, I., A gentle introduction to von Neumann algebras for model theorists, notes available at http://homepages.math.uic.edu/∼isaac/vNanotes.pdf.Google Scholar
Goldbring, I., Hart, B., and Sinclair, T., The theory of tracial von Neumann algebras does not have a model companion, this Journal, vol. 78 (2013), pp. 1000–1004.Google Scholar
Farah, I., Goldbring, I., Hart, B., and Sherman, D., Existentially closed II 1factors. Fundamenta Mathematicae, vol. 233 (2016), pp. 173–196.Google Scholar
Murray, F. and von Neumann, J., On rings of operators. Annals of Mathematics, vol. 37 (1936), pp. 116–229.Google Scholar
Farah, I., Hart, B., Lupini, M., Robert, L., Tikuisis, A., Vignati, A., and Winter, W., The Model Theory of Nuclear C*-algebras, preprint.Google Scholar
Farah, I., Hart, B., and Sherman, D., Model theory of operator algebras II: Model theory. Israel Journal of Mathematics, vol. 201 (2014), pp. 477–505.Google Scholar
Farah, I., Hart, B., and Sherman, D., Model theory of operator algebras III: Elementary equivalence and II 1factors. Bulletin of London Mathematical Society, vol. 46 (2014), pp. 1–20.CrossRefGoogle Scholar
Henson, C. W. and Iovino, J., Ultraproducts in analysis, Analysis and Logic (Mons, 1997), London Mathematical Society Lecture Note Series, vol. 262, Cambridge University Press, Cambridge, 2002, pp. 1–110.Google Scholar
Pestov, V., Hyperlinear and sofic groups: a brief guide. Bulletin of Symbolic Logic, vol. 14 (2008), pp. 449–480.Google Scholar
Voiculescu, D., The analogues of entropy and of Fisher’s information measure in free probability theory II. Inventiones mathematicae, vol. 118 (1994), pp. 411–440.Google Scholar