Related papers: Avoiding logical strength in real analysis
I defend an analog of probabilism that characterizes rationally coherent estimates for chances. Specifically, I demonstrate the following accuracy-dominance result for stochastic theories in the C*-algebraic framework: supposing an…
A theory of Clebsch-Gordan coefficients for $SL(2, C)$ is given using only rational numbers. Features include orthogonality relations, recurrence relations, and Regge's symmetry group. Results follow from elementary representation theory…
Prokhorov's Theorem in probability theory states that a family $\Gamma$ of probability measures on a Polish space is tight if and only if every sequence in $\Gamma$ has a weakly convergent subsequence. Due to the highly non-constructive…
The present paper gives a statistical adventure towards exploring the average case complexity behavior of computer algorithms. Rather than following the traditional count based analytical (pen and paper) approach, we instead talk in terms…
It has been argued that the strong cosmic censorship conjecture is violated by Reissner-Nordstr\"om-de Sitter black holes: for near-extremal black holes, generic scalar field perturbations arising from smooth initial data have finite energy…
In this paper, we obtain almost sure invariance principles with rate of order $n^{1/p}\log^\beta n$, $2< p\le 4$, for sums associated to a sequence of reverse martingale differences. Then, we apply those results to obtain similar…
Classical-realistic analysis of entangled systems have lead to retrodiction paradoxes, which ordinarily have been dismissed on the grounds of counter-factuality. Instead, we claim that such paradoxes point to a deeper logical structure…
The concept of nearest integer is used to derive theorems and algorithms for the best approximations of an irrational by rational numbers, which are improved with the pigeonhole principle and used to offer an informed presentation of the…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
In this letter a generic counterexample to the strong cosmic censor conjecture is exhibited. More precisely---taking into account that the conjecture lacks any precise formulation yet---first we make sense of what one would mean by a…
A unified conceptual foundation of classical and quantum physics is given, free of undefined terms. Ensembles are defined by extending the `probability via expectation' approach of Whittle to noncommuting quantities. This approach carries…
We introduce a notion of complexity for systems of linear forms, called sequential Cauchy-Schwarz complexity, which is parametrized by two positive integers $k,\ell$ and refines the notion of Cauchy-Schwarz complexity introduced by Green…
Kurokawa and Koyama's multiple cosine function $\mathcal{C}_{r}(x)$ and Kurokawa's multiple sine function $S_{r}(x)$ are generalizations of the classical cosine and sine functions from their infinite product representations, respectively.…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
We extend theories of reverse mathematics by a non-principal ultrafilter, and show that these are conservative extensions of the usual theories ACA0, ATR0, and Pi11-Comprehension.
Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…
We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…
This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…
Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…