Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual (Q1354006): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01531034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025945874 / rank | |||
Normal rank | |||
Latest revision as of 11:00, 30 July 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
