English
Related papers

Related papers: Reverse mathematics and a Ramsey-type K\"onig's Le…

200 papers

The aim of this paper is to determine the logical and computational strength of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of it. We show that BW is instance-wise equivalent to the weak K\"onig's lemma for…

Logic · Mathematics 2012-05-08 Alexander P. Kreuzer

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

Logic · Mathematics 2017-02-28 Wei Wang

We investigate the reverse mathematics strength of Martin's pointed tree theorem (MPT) and one of its variants, weak Martin's pointed tree theorem (wMPT).

Logic · Mathematics 2014-04-09 Rupert Hölzl , Frank Stephan , Liang Yu

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

Logic · Mathematics 2014-01-03 Jeremy Avigad , Edward Dean , Jason Rute

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

Combinatorics · Mathematics 2026-05-26 Guy Moshkovitz , Dora Woodruff

Let $X$ be an inner product space, let $G$ be a group of orthogonal transformations of $X$, and let $R$ be a bounded $G$-stable subset of $X$. We define very weak and very strong regularity for such pairs $(R,G)$ (in the sense of…

Combinatorics · Mathematics 2012-11-16 Alexander Schrijver

We analyze two weak random operators, initially motivated from processes in random environment. Intuitively speaking these operators are ill-defined, but using bilinear forms one can deal with them in a rigorous way. This point of view can…

Probability · Mathematics 2019-09-16 Jonathan Gutierrez-Pavón , Carlos G. Pacheco

No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA) and Ramsey's theorem for pairs (RT^2_2) in reverse mathematics. The tree theorem for pairs (TT^2_2) is however a good candidate. The…

Logic · Mathematics 2015-12-16 Ludovic Patey

We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…

Logic · Mathematics 2018-08-06 Florian Pelupessy

We give a short, self-contained, and elementary proof of the strong law of large numbers under a power law decay hypothesis for joint second moments. The result is related to the classical one by Lyons. However, we also provide a rate of…

Probability · Mathematics 2019-11-18 Abdelmalek Abdesselam

We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…

Logic in Computer Science · Computer Science 2023-12-05 Arno Pauly , Cécilia Pradic , Giovanni Solda

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

Information Theory · Computer Science 2011-02-17 Hayato Takahashi

The Erdos-Moser theorem (EM) states that every infinite tournament has an infinite transitive subtournament. This principle plays an important role in the understanding of the computational strength of Ramsey's theorem for pairs (RT^2_2) by…

Logic · Mathematics 2016-10-26 Ludovic Patey

Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse…

Logic · Mathematics 2016-02-09 Ludovic Patey

We discuss the (twisted) weak positivity theorem. We also treat some applications.

Algebraic Geometry · Mathematics 2015-07-03 Osamu Fujino

We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property fails by an…

Logic in Computer Science · Computer Science 2015-07-01 Joerg Endrullis , Clemens Grabmayer , Dimitri Hendriks , Jan Willem Klop , Vincent van Oostrom

In this article, we give a few examples of local rings in relation to weak normality and seminormality in mixed characteristic. It is known that two concepts can differ in the equal prime characteristic case, while they coincide in the…

Commutative Algebra · Mathematics 2026-03-03 Jun Horiuchi , Kazuma Shimomoto

Quantum resonance, i.e., amplification in transition probability available under certain conditions, offers a powerful means for determining fundamental quantities in physics, including the time duration of the second adopted in the SI…

Quantum Physics · Physics 2025-06-17 Daiki Ueda , Izumi Tsutsui

Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…

Quantum Physics · Physics 2009-08-03 Lars M. Johansen , Pier A. Mello

We study a new class of so-called quasi-infinitely divisible laws, which is a wide natural extension of the well known class of infinitely divisible laws through the L\'evy--Khinchine type representations. We are interested in criteria of…

Probability · Mathematics 2023-05-24 A. A. Khartov