Related papers: Undecidability and incompleteness in quantum infor…
Goedel Incompleteness Theorem leaves open a way around it, vaguely perceived for a long time but not clearly identified. (Thus, Goedel believed informal arguments can answer any math question.) Closing this loophole does not seem obvious…
We employ methods from homotopy theory to define new obstructions to solutions of embedding problems. By using these novel obstructions we study embedding problems with non-solvable kernel. We apply these obstructions to study the…
We continue the study of the vertex operator algebra $L(k,0)$ associated to a type $G_2^{(1)}$ affine Lie algebra at admissible one-third integer levels, $k = -2 + m + \tfrac{i}{3}\ (m\in \mathbb{Z}_{\ge 0}, i = 1,2)$, initiated in…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
We show that the class of 1-exact operator systems is not uniformly definable by a sequence of types. We use this fact to show that there is no finitary version of Arveson's extension theorem. Next, we show that WEP is equivalent to a…
Recent work has examined how undecidable problems can arise in quantum information science. We augment this by introducing three new undecidable problems stated in terms of tensor networks. These relate to ideas of Penrose about the…
In this paper, the feasibility of using finite totally ordered probability models under Alelinnas's Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general form of the probability algebra of these models is derived and…
We study zero-uncertainty states with quantum memory from an operator-algebraic perspective, which naturally accommodates degenerate projective-valued measurements. In the equal-dimension setting, we prove a rigidity theorem for purity and…
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
We give an overview of results tying together a circle of problems connected to the Connes Embedding Problem, Kirchberg's reformulations thereof, Tsirelson's conjecture and its relation to quantum information theory, and a class of quantum…
The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…
In this paper, we prove that if $\mathcal{A}$ is a unital separable $C^*$-algebra, $\mathcal{M}$ is a von Neumann algebra which has the Kirchberg's quotient weak expectation property (QWEP), and $\phi:\, \mathcal{A}\rightarrow \mathcal{M}$…
In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
We use representations of operator systems as quotients to deduce various characterisations of the weak expectation property (WEP) for C?*-algebras. By Kirchberg's work on WEP, these results give new formulations of Connes' embedding…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…
We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a…