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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: \(C^ *\)-algebras with a two-point dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Limits of Finite Dimensional C ∗ -Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Analysis of Many Valued Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Proof of the Completeness of the Lukasiewicz Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5330684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem about infinite-valued sentential logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability in many-valued sentential logic is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of the ordered groups associated with the approximately finite dimensional C*-algebras / rank
 
Normal rank
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 12: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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references