相关论文: Goodstein revisited

In this paper we present a method ofcomputing the posterior probability ofconditional independence of two or morecontinuous variables from data,examined at several resolutions. Ourapproach is motivated by theobservation that the appearance…

Stein discrepancies have emerged as a powerful statistical tool, being applied to fundamental statistical problems including parameter inference, goodness-of-fit testing, and sampling. The canonical Stein discrepancies require the…

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…

In his 1984 proof of the Bieberbach and Milin conjectures de Branges used a positivity result of special functions which follows from an identity about Jacobi polynomial sums that was found by Askey and Gasper in 1973, published in 1976. In…

We formulate Goldbach type questions for Gaussian, Hurwitz, Octavian and Eisenstein primes. They are different from Goldbach type statements by Takayoshi Mitsui from 1960 for number fields or C.A. Holben and James Jordan from 1968 for…

One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are…

Bell non-local correlations cannot be naturally explained in a fixed causal structure. This serves as a motivation for considering models where no global assumption is made beyond logical consistency. The assumption of a fixed causal order…

Motivated by the advances of quantum Darwinism and recognizing the role played by redundancy in identifying the small subset of quantum states with resilience characteristic of objective classical reality, we explore the implications of…

This paper studies implications of the consistency conditions among prior, posteriors, and information sets on introspective properties of qualitative belief induced from information sets. The main result reformulates the consistency…

The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…

A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…

It is widely accepted that quantum entanglement between otherwise independent sensors can yield a measurement precision beyond that achievable when the same resources are employed without entanglement \cite{Helstrom1969, Holevo1973a,…

In several recent works on infinite-dimensional systems of ODEs \cite{cao_derivation_2021,cao_explicit_2021,cao_iterative_2024,cao_sticky_2024}, which arise from the mean-field limit of agent-based models in economics and social sciences…

In 1926-1927, Tarski designed a set of axioms for Euclidean geometry which reached its final form in a manuscript by Schwabh\"auser, Szmielew and Tarski in 1983. The differences amount to simplifications obtained by Tarski and Gupta. Gupta…

Hadar and Russell (1974) and Levy and Paroush (1974) presented sufficient conditions for multivariate stochastic dominance when the distributions involved are continuous with compact support. Further generalizations involved either…

In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…

Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…

Non-compact proofs are a class of reasoning that is used in mathematics but overlooked in the analysis of (un)provability of consistency. We focus on proofs of arithmetical statements (*) "for any natural number n, F(n)." A proof of (*) is…

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

A celebrated theorem by Coven and Hedlund (1973) states that Sturmian words are characterized by their abelian complexity: they are precisely the infinite words with rationally independent letter frequencies and constant abelian complexity…