Related papers: Undecidability and incompleteness in quantum infor…
Families of operator identities appeared as a consequence of an existence of finite-dimensional representation of (super) Lie algebras of first-order differential operators and $q$-deformed (quantum) algebras of first-order…
This article proposes a reading of quantum metaphysical indeterminacy from the perspective of Parsons' Nuclear Meinongianism. In doing so, we identify a fundamental incompatibility between a key feature of Parsons' theory and standard…
The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will…
In this note we address various algorithmic problems that arise in the computation of the operator norm in unitary representations of a group on Hilbert space. We show that the operator norm in the universal unitary representation is…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
In this note we observe that automated theorem provers (ATPs) that recursively enumerate theorems in a particular way will fail to identify some valid theorems for a reason that is analogous to how G\"odel proved the existence of what are…
The idea that symmetries simplify or reduce the complexity of a system has been remarkably fruitful in physics, and especially in quantum mechanics. On a mathematical level, symmetry groups single out a certain structure in the Hilbert…
In this article we will review some notions of infiniteness that appear in Hilbert space operators and operator algebras. These include proper infiniteness, Murray von Neumann's classification into type I and type III factors and the class…
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
For the Lie algebra $\g$ of a connected infinite-dimensional Lie group~$G$, there is a natural duality between so-called semi-equicontinuous weak-*-closed convex Ad^*(G)-invariant subsets of the dual space $\g'$ and Ad(G)-invariant lower…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources. We focus on queries in a useful…
In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly…
What if the paradoxical nature of quantum theory could find its source in some undecidability analog to that of G\"odel's incompleteness theorem ? This essay aims at arguing for such G\"odelian hunch via two case studies. Firstly, using a…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…