English
Related papers

Related papers: Avoiding logical strength in real analysis

200 papers

This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the…

Logic · Mathematics 2025-06-12 Ang Li

A quantum theoretic representation of real and complex numbers is described here as equivalence classes of Cauchy sequences of quantum states of finite strings of qubits. There are 4 types of qubits each with associated single qubit…

Quantum Physics · Physics 2008-11-26 Paul Benioff

We analyze Ekeland's variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to $\Pi^1_1$-${\sf CA}_0$, a strong theory of second-order arithmetic, while natural…

Logic · Mathematics 2020-09-16 David Fernández-Duque , Paul Shafer , Keita Yokoyama

In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…

Logic · Mathematics 2012-12-03 Henry Towsner

Real numbers do not admit an extensional procedure for observing discrete information, such as the first digit of its decimal expansion, because every extensional, computable map from the reals to the integers is constant, as is well known.…

Logic · Mathematics 2023-06-22 Auke B. Booij

The enterprise of comparing mathematical theorems according to their logical strength is an active area in mathematical logic. In this setting, called reverse mathematics, one investigates which theorems provably imply which others in a…

In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…

Logic · Mathematics 2023-01-31 Peter Hertling , Philip Janicki

Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…

Logic · Mathematics 2016-03-30 Ludovic Patey

The 2013 logic blog has focussed on the following: 1. Higher randomness. Among others, the Borel complexity of $\Pi^1_1$ randomness and higher weak 2 randomness is determined. 2. Reverse mathematics and its relationship to randomness. For…

Logic · Mathematics 2014-06-20 André Nies

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

Logic · Mathematics 2020-09-21 Benoit Monin , Ludovic Patey

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

Logic · Mathematics 2012-01-25 Jeffry L. Hirst , Carl Mummert

We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…

Logic · Mathematics 2023-08-10 Martin Klazar

We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the…

Logic in Computer Science · Computer Science 2013-09-06 Giovanni Birolo

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

Logic · Mathematics 2025-06-09 Mihai Prunescu , Lorenzo Sauras-Altuzarra

We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…

Logic · Mathematics 2014-06-12 Damir Dzhafarov , Gregory Igusa

The concept of counterfactual explanations (CE) has emerged as one of the important concepts to understand the inner workings of complex AI systems. In this paper, we translate the idea of CEs to linear optimization and propose, motivate,…

Optimization and Control · Mathematics 2024-05-27 Jannis Kurtz , Ş. İlker Birbil , Dick den Hertog

Simpson and the second author asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA$^*_0$. We answer in the negative, showing that for any…

Logic · Mathematics 2014-10-17 Leszek Aleksander Kołodziejczyk , Keita Yokoyama

Data based judgments go into artificial intelligence applications but they undergo paradoxical reversal when seemingly unnecessary additional data is provided. Examples of this are Simpson's reversal and the disjunction effect where the…

Artificial Intelligence · Computer Science 2017-09-14 Subhash Kak

Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…

Number Theory · Mathematics 2020-10-13 Rinat Kashaev

We prove that several versions of the Tietze extension theorem for functions with moduli of uniform continuity are equivalent to WKL_0 over RCA_0. This confirms a conjecture of Giusto and Simpson that was also phrased as a question in…

Logic · Mathematics 2016-02-18 Paul Shafer