Related papers: Borel Determinacy: A Streamlined Proof
We present a short, elementary proof not involving Fourier transforms of the theorem of Cram\'er and Wold that a Borel probability measure is determined by its values on half-spaces.
Over one year ago, a very long preprint posted on arXiv [arXiv:1709.03771] and HAL announced a proof of Lehmer's Conjecture (and of other related results). Unfortunately, as was remarked by several specialists, this proof contains a (at…
We introduce a new method for proving twisted homological stability, and use it to prove such results for symmetric groups and general linear groups. In addition to sometimes slightly improving the stable range given by the traditional…
We defend a new theory of statistical evidence, which we call Robust Bayesianism (RB). We prove that, under widely accepted assumptions, RB entails the law of likelihood [Royall, 1997], the likelihood principle [Berger and Wolpert, 1988],…
The Rev. Dodgson's determinant condensation rule is given a bijective proof.
This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.
About 35 years ago Dennis Sullivan proved a precompactness property ("complex bounds") for infinitely renormalizable real quadratic polynomials with bounded combinatorics. We present a simple "soft" proof of this remarkable result.
This paper treat determinacy of strong moment problems in part I and indeterminacy of strong moment problems in part II. This paper is a summary of the following papers: [1] Ald\'en. E., Determinacy of Strong Moment Problems. [2] On…
A proof of the Borel completeness of torsion free abelian groups is presented. This proof differs considerably from the approach of Paolini-Shelah.
The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…
In this paper we continue to study so called ``inverse Born's rule problem'': to construct representation of probabilistic data of any origin by a complex probability amplitude which matches Born's rule. The corresponding algorithm --…
The aim of this paper is to argue that the (alleged) indeterminism of quantum mechanics, claimed by adherents of the Copenhagen interpretation since Born (1926), can be proved from Chaitin's follow-up to Goedel's (first) incompleteness…
The original proof of the Sharkovsky theorem is presented in full detail. The proof should be accessible to readers with basic Real Analysis background. Although nowadays there are several alternative proofs of this classical result, we…
The Collatz conjecture is a famous math problem that was introduced by Lothar Collatz in 1937, and nobody has yet succeeded in proving or disproving it. In this article, I will analyze this problem with a new approach and I will discuss my…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
We show that it is consistent that the Borel Conjecture and the dual Borel Conjecture hold simultaneously.
A paper on ordinal partitions by Erd\H{o}s and Milner (1972) has been formalised using the proof assistant Isabelle/HOL, augmented with a library for Zermelo-Fraenkel set theory. The work is part of a project on formalising the partition…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
This Comment points out a number of errors in the recent paper by Zarechnaya, Dubrovinskaia, Dubrovinsky, et al. (Phys. Rev. Lett. 102, 185501 (2009)). Results and conclusions presented by Zarechnaya et al. (2009) are either incorrect or…
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…