We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and word problems for C*-algebras, and show some analogous results hold in this setting. Famously, every finitely generated group with a computable presentation is computably categorical, but we provide a counterexample in the case of C*-algebras. On the other hand, we show every finite-dimensional C*-algebra is computably categorical.
Non-computability of $K$-theory for computably presented C*-algebras
University of Victoria(维多利亚大学);University of California, Irvine(加州大学尔湾分校);Iowa State University(爱荷华州立大学);Queens College(皇后学院);CUNY Graduate Center(纽约市立大学研究生院)
Computability for tree presentations of continuum-size structures
0.1in Department of Mathematics, College of William \& Mary, 200 Ukrop Way, Williamsburg, VA 23185 USA;0.1in Department of Mathematics, Queens College -- City University of New York, 65-30 Kissena Blvd., Flushing, NY 11367 USA;Computer Science, Graduate Center - City University of New York, 365 Fifth Avenue, New York, NY 10016 USA
Computably totally disconnected locally compact groups
School of Mathematics and Statistics, Victoria University of Wellington(维多利亚大学惠灵顿校区数学与统计学院);School of Computer Science, The University of Auckland(奥克兰大学计算机科学学院)
An alternative axiomatic presentation of Nelson algebras
纳尔逊代数是在[Diana Brignole和António Monteiro。纳尔逊·阿尔赫布里斯被平等对待。{I},{II}.日本科学院,43:279- 283; 284- 285,1967.]在语言$\langle \land,\lor,\to,\sim,1\rangle$方面。1962年,戴安娜·布里格诺尔(Diana Brignole)Axiomatización de un $N$ -reticulado. Revista de la Unión Matemática Argentina,XXI(3):147- 148,1965.],解决了Antonio Monteiro提出的用连接词$\rightarrowtail$、$\land$和常数$0=\sim 1$给出Nelson代数公理化的问题。在这项工作中,我们第一次提出了一个完整的证明这一事实,也显示了依赖性和独立性的一些公理提出的Brignole。