Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus (Q1079157): Difference between revisions

It is well known that AF \(C^*\)-algebras can be classified completely by the corresponding dimension groups, i.e. the \(K\)-groups with an order unit. Interpreting the \(K\)-group \(K_ 0(A)\) of an AF \(C^*\)-algebra \(A\) as a set of sequences in Łukasiewicz logic, the author gives a criterion for the simplicity of \(A\) in terms of recursion-theoretic properties of \(K_ 0(A)\): If \(A\) is Gödel complete in the sense that the set of consequence of a theory ``written in this language'' is recursively enumerable but not recursive, then \(A\) cannot be simple. In the case of the CAR algebra the corresponding set of sentences is explicitly worked out.