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

DOI10.1007/BF01531034zbMath0865.03033OpenAlexW2025945874MaRDI QIDQ1354006

Daniele Mundici

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531034

zbMATH Keywords

polynomialcombinatorial complexityinfinite-valued logic\(\text{AF} C^*\)-algebras

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other ``noncommutative mathematics based on (C^*)-algebra theory (46L89) Many-valued logic (03B50)

Related Items (2)

Logic of infinite quantum systems ⋮ The Algebras of Łukasiewicz Many-Valued Logic: A Historical Overview

Cites Work

• Unnamed Item
• Unnamed Item
• Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus
• Satisfiability in many-valued sentential logic is NP-complete
• On the classification of the ordered groups associated with the approximately finite dimensional C*-algebras
• \(C^ *\)-algebras with a two-point dual
• Algebraic Analysis of Many Valued Logics
• A New Proof of the Completeness of the Lukasiewicz Axioms
• Inductive Limits of Finite Dimensional C ∗ -Algebras
• A theorem about infinite-valued sentential logic

This page was built for publication: Turing complexity of Behncke-Leptin \(C^*\)-algebras with a two-point dual