×

Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual. (English) Zbl 0865.03033

Summary: We prove that the combinatorial complexity of the \(C^*\)-algebras mentioned in the title is polynomial. We use our interpretation of \(\text{AF} C^*\)-algebras as theories in the infinite-valued calculus of Lukasiewicz.

MSC:

03D15 Complexity of computation (including implicit computational complexity)
46L89 Other “noncommutative” mathematics based on \(C^*\)-algebra theory
03B50 Many-valued logic
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] H. Behncke and H. Leptin,C *-algebras with a two-point dual, J. Functional Anal. 10 (1972) 330-335. · Zbl 0235.46089 · doi:10.1016/0022-1236(72)90031-6
[2] O. Bratteli, Inductive limits of finite dimensionalC *-algebras, Trans. Amer. Math. Soc. 171 (1972) 195-234. · Zbl 0264.46057
[3] C.C. Chang, Algebraic analysis of many valued logics, Trans. Amer. Math. Soc. 88 (1958) 467-490. · Zbl 0084.00704 · doi:10.1090/S0002-9947-1958-0094302-9
[4] C.C. Chang, A new proof of the completeness of the Lukasiewicz axioms, Trans. Amer. Math. Soc. 93 (1959) 74-90. · Zbl 0093.01104
[5] J. Dixmier,C *-algebras (North-Holland, Amsterdam, 1977).
[6] E.G. Effros, Dimensions andC *-algebras, CBMS Regional Conf. Series in Math., no. 46, Amer. Math. Soc., Providence, RI (1981).
[7] G.A. Elliott,On Totally Ordered Groups and K 0, Lecture Notes in Mathematics, vol. 734, (Springer, Berlin, 1979) pp. 1-49.
[8] L. Fuchs, Riesz groups, Ann. Scuola Norm. Sup. Pisa 19 (1965) 1-34. · Zbl 0125.28703
[9] K.R. Goodearl,Notes on Real and Complex C *-algebras, Shiva Math. Series, vol. 5 (Birkh?user, Boston, 1982).
[10] R. McNaughton, A theorem about infinite-valued sentential logic, J. Symbolic Logic 16 (1951) 1-13. · Zbl 0043.00901 · doi:10.2307/2268660
[11] D. Mundici, Satisfiability in many-valued sentential logic is NP-complete, Theor. Comput. Sci. 52 (1987) 145-153. · Zbl 0639.03042 · doi:10.1016/0304-3975(87)90083-1
[12] D. Mundici, Interpretation of AFC *-algebras in Lukasiewicz sentential calculus, J. Functional Anal. 65 (1986), 15-63. · Zbl 0597.46059 · doi:10.1016/0022-1236(86)90015-7
[13] D. Mundici,The Turing Complexity of AF C *-algebras with Lattice-ordered K 0, Lecture Notes in Computer Science, vol. 270, (Springer, Berlin, 1987) pp. 256-264. · Zbl 0639.03043
[14] C.L. Shen, On the classification of the ordered groups associated with the approximately finite dimensionalC *-algebras, Duke Math. J. 46 (1979) 613-633. · Zbl 0422.46046 · doi:10.1215/S0012-7094-79-04632-5
[15] A. Tarski and J. Lukasiewicz, Investigations into the sentential calculus, in:Logic, Semantics, Metamathematics (Oxford University Press, 1956) pp. 38-59.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.