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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 15:14, 31 January 2024

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