Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual (Q1354006): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 03:04, 5 March 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
13 May 1997
0 references
infinite-valued logic
0 references
combinatorial complexity
0 references
polynomial
0 references
\(\text{AF} C^*\)-algebras
0 references
