Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual (Q1354006)

From MaRDI portal
Revision as of 12:25, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual
scientific article

    Statements

    Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual (English)
    0 references
    0 references
    0 references
    13 May 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    infinite-valued logic
    0 references
    combinatorial complexity
    0 references
    polynomial
    0 references
    \(\text{AF} C^*\)-algebras
    0 references