English
Related papers

Related papers: Borel Determinacy: A Streamlined Proof

200 papers

This note is a somewhat-lighthearted comment on a recent paper by David Wallace, arXiv:0906.2718[quant-ph] entitled "A formal proof of the Born rule from decision-theoretic assumptions".

Quantum Physics · Physics 2009-07-14 J. Finkelstein

This note gives an informal overview of the proof in our paper "Borel Conjecture and Dual Borel Conjecture", see arXiv:1105.0823.

Logic · Mathematics 2011-12-20 Martin Goldstern , Jakob Kellner , Saharon Shelah , Wolfgang Wohofsky

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.

Combinatorics · Mathematics 2007-12-04 Kouachi Said , Abdelmalek Salem , Rebiai Belgacem

In 1857 Sylvester stated a result on determinants without proof that was recognized as important over the subsequent century. Thus it was a surprise to Akritas, Akritas and Malaschonok when they found only one English proof - given by…

History and Overview · Mathematics 2015-12-31 Jan Vrbik , Paul Vrbik

The goal of this paper is to establish that it remains undecidable whether a sequent is provable in two systems in which a weakening rule for an exponential modality is completely omitted from classical propositional linear logic…

Logic in Computer Science · Computer Science 2025-09-03 Jun Suzuki , Katsuhiko Sano

Throughout the history of the study of turbulence in fluid dynamics, there has yet to arise a unique definition or theoretical criterion for this important phenomenon. There have been interesting conjectures made by Ruelle [2], Muriel [3],…

Fluid Dynamics · Physics 2007-12-27 J. C. Imperio , Mikhail P. Solon , A. Laganapan , J. P. H. Esguerra , A. Muriel

We prove the stochastic domination for determinantal processes associated with finite rank projection kernels. The result was first proved by Lyons in discrete setting. We avoid the machinery of matroids in order to obtain a proof that…

Probability · Mathematics 2020-09-22 Raghavendra Tripathi

We prove the Martingale Convergence Theorem by using the work of L. Dubins and I. Monroe about embedding a given discrete-time martingale in the sample paths of a Brownian motion.

Probability · Mathematics 2024-12-20 P. J. Fitzsimmons

A new, coercive formulation of the Helmholtz equation was introduced in [Moiola, Spence, SIAM Rev. 2014]. In this paper we investigate $h$-version Galerkin discretisations of this formulation, and the iterative solution of the resulting…

Numerical Analysis · Mathematics 2022-08-29 Ganesh C. Diwan , Andrea Moiola , Euan A. Spence

I develop the decision-theoretic approach to quantum probability, originally proposed by David Deutsch, into a mathematically rigorous proof of the Born rule in (Everett-interpreted) quantum mechanics. I sketch the argument informally, then…

Quantum Physics · Physics 2009-06-16 David Wallace

A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.

Metric Geometry · Mathematics 2021-12-02 Yossi Lonke

The main goal of this paper is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result from (Vereshchagin, 2002) saying that $\limsup_n\KS(x|n)$ (here $\KS(x|n)$ is…

Computational Complexity · Computer Science 2008-02-21 Laurent Bienvenu , Andrej Muchnik , Alexander Shen , Nikolay Vereshchagin

In this short note I restate and simplify the proof of the impossibility of probabilistic induction from Popper (1992). Other proofs are possible (cf. Popper (1985)).

Artificial Intelligence · Computer Science 2021-07-05 Vaden Masrani

In the 1930s Tarski showed that real quantifier elimination was possible, and in 1975 Collins gave a remotely practicable method, albeit with doubly-exponential complexity, which was later shown to be inherent. We discuss some of the recent…

Symbolic Computation · Computer Science 2015-08-03 James H. Davenport , Matthew England

We modify arguments by Harrington, Marker, and Shelah, 1990, to reprove extensions of two key results in their paper "Borel orderings"in the context of bounding and decomposition of analytic subsets of Borel partial quasi-orderings.

Logic · Mathematics 2018-08-16 Vladimir Kanovei

We propose a complete proof of the Born rule using an additional postulate stating that for a short enough time {\Delta}t between two measurements, a property of a particle will keep its values fixed. This dynamical postulate allows us to…

Quantum Physics · Physics 2023-08-22 Yakir Aharonov , Tomer Shushi

We streamline Malliaris and Shelah's proof that $\mathfrak{p} = \mathfrak{t}$. In particular, we replace cofinality spectrum problems with models of $ZFC^-$, and we eliminate the use of peculiar cuts.

Logic · Mathematics 2018-10-23 Douglas Ulrich

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…

Logic · Mathematics 2024-11-08 Juan Pablo Aguilera , Thibaut Kouptchinsky

n this paper we refine Vahlen's 1895 result in Diophantine approximation by providing sharper bounds for the approximation coefficients, especially when at least one of the partial quotients $a_n$ or $a_{n+1}$ of the regular continued…

Dynamical Systems · Mathematics 2025-04-30 Ayreena Bakhtawar , Cor Kraaikamp

The article has been withdrawn by the author. Wolfgang Lueck and Peter Linnell pointed out that the proof of Lemma 3.8 does not apply to the unrestricted case of wreath product. It is not clear at this stage how to complete the proof of…

Geometric Topology · Mathematics 2007-07-19 S. K. Roushon
‹ Prev 1 2 3 10 Next ›