Skip to main content
SpringerLink
Log in

Turing complexity of Behncke-LeptinC *-algebras with a two-point dual

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We prove that the combinatorial complexity of theC *-algebras mentioned in the title is polynomial. We use our interpretation of AFC *-algebras as theories in the infinite-valued calculus of Lukasiewicz.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Behncke and H. Leptin,C *-algebras with a two-point dual, J. Functional Anal. 10 (1972) 330–335.

    Google Scholar 

  2. O. Bratteli, Inductive limits of finite dimensionalC *-algebras, Trans. Amer. Math. Soc. 171 (1972) 195–234.

    Google Scholar 

  3. C.C. Chang, Algebraic analysis of many valued logics, Trans. Amer. Math. Soc. 88 (1958) 467–490.

    Google Scholar 

  4. C.C. Chang, A new proof of the completeness of the Lukasiewicz axioms, Trans. Amer. Math. Soc. 93 (1959) 74–90.

    Google Scholar 

  5. J. Dixmier,C *-algebras (North-Holland, Amsterdam, 1977).

    Google Scholar 

  6. E.G. Effros, Dimensions andC *-algebras, CBMS Regional Conf. Series in Math., no. 46, Amer. Math. Soc., Providence, RI (1981).

    Google Scholar 

  7. G.A. Elliott,On Totally Ordered Groups and K 0, Lecture Notes in Mathematics, vol. 734, (Springer, Berlin, 1979) pp. 1–49.

    Google Scholar 

  8. L. Fuchs, Riesz groups, Ann. Scuola Norm. Sup. Pisa 19 (1965) 1–34.

    Google Scholar 

  9. K.R. Goodearl,Notes on Real and Complex C *-algebras, Shiva Math. Series, vol. 5 (Birkhäuser, Boston, 1982).

    Google Scholar 

  10. R. McNaughton, A theorem about infinite-valued sentential logic, J. Symbolic Logic 16 (1951) 1–13.

    Google Scholar 

  11. D. Mundici, Satisfiability in many-valued sentential logic is NP-complete, Theor. Comput. Sci. 52 (1987) 145–153.

    Google Scholar 

  12. D. Mundici, Interpretation of AFC *-algebras in Lukasiewicz sentential calculus, J. Functional Anal. 65 (1986), 15–63.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  15. A. Tarski and J. Lukasiewicz, Investigations into the sentential calculus, in:Logic, Semantics, Metamathematics (Oxford University Press, 1956) pp. 38–59.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Milan, Via Comelico 39, 20135, Milan, Italy

    Daniele Mundici

Authors
  1. Daniele Mundici
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mundici, D. Turing complexity of Behncke-LeptinC *-algebras with a two-point dual. Ann Math Artif Intell 6, 287–293 (1992). https://doi.org/10.1007/BF01531034

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01531034

Keywords

Search

Navigation