Related papers: The Pitch-class Integer Theorem
The existence of incompatible measurements is often believed to be a feature of quantum theory which signals its inconsistency with any classical worldview. To prove the failure of classicality in the sense of Kochen-Specker…
A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with convergent…
Conscious experience permeates our daily lives, yet general consensus on a theory of consciousness remains elusive. In the face of such difficulty, an alternative strategy is to address a more general (meta-level) version of the problem for…
In order to explore tonality outside of the `Pythagorean' paradigm of integer ratios, Robert Schneider introduced a musical scale based on the logarithm function. We seek to refine Schneider's scale so that the difference tones generated by…
We argue that \CP is a gauge symmetry in string theory. As a consequence, \CP cannot be explicitly broken either perturbatively or non-pertubatively; there can be no non-perturbative \CP-violating parameters. String theory is thus an…
Every theory of information, including classical and quantum, can be studied in the framework of operational probabilistic theories--where the notion of test generalizes that of quantum instrument, namely a collection of quantum operations…
We present an algebraic construction of music notes and show how to associate them inseveral ways to construct music ranges. Then a family of ranges emerge with a fixed number of notes: two, three, five, seven, twelve, seventeen, etc. A…
Graded type theories are an emerging paradigm for augmenting the reasoning power of types with parameterizable, fine-grained analyses of program properties. There have been many such theories in recent years which equip a type theory with…
"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…
A recent experiment testing the necessity of complex numbers in the standard formulation of quantum theory is recreated using IBM quantum computers. To motivate the experiment, we present a basic construction for real-valued quantum theory.…
We consider the problem of certifying measurement incompatibility in a prepare-and-measure (PM) scenario. We present different families of sets of qubit measurements which are incompatible, but cannot lead to any quantum over classical…
String theory is the most promising candidate theory for a unified description of all fundamental forces exist in the nature. It provides a mathematical framework that combine quantum theory with Einstein's general theory of relativity. But…
By reformulating the classical proof as a Baire Category argument, we show that Besicovitch's Theorem in Cantor space is provable in $ACA_0$, and additionally that the witnessing subset is computable from one jump of the original set. We…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
The possible tensor constructions of open string theories are analyzed from first principles. To this end the algebraic framework of open string field theory is clarified, including the role of the homotopy associative A_\infty algebra, the…
We introduce a modal logic FIL for Feferman interpretability. In this logic both the provability modality and the interpretability modality can come with a label. This label indicates that in the arithmetical interpretation the axiom set of…
We investigate how much type theory is able to prove about the natural numbers. A classical result in this area shows that dependent type theory without any universes is conservative over Heyting Arithmetic (HA). We build on this result by…
By considering a generalisation of the CPM construction, we develop an infinite hierarchy of probabilistic theories, exhibiting compositional decoherence structures which generalise the traditional quantum-to-classical transition.…
In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules.…
Score matching is an estimation procedure that has been developed for statistical models whose probability density function is known up to proportionality but whose normalizing constant is intractable, so that maximum likelihood is…