Related papers: A Friedman--Sheard-style Theory for Classical Real…

We survey the classical results of the Dirichlet Approximation Theorem.

We propose a realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without "nested" quantifiers, called here EM1-arithmetic. We interpret classical proofs as…

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

The original criteria of Riesz and of Hardy-Littlewood concerning the truth of the Riemann Hypothesis (RH) are revisited and further investigated in light of the recent formulations and results of Maslanka and of Baez-Duarte concerning a…

We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…

Intuitionistic first-order logic extended with a restricted form of Markov's principle is constructive and admits a Curry-Howard correspondence, as shown by Herbelin. We provide a simpler proof of that result and then we study…

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

In the paper, we first prove a sufficient condition for the Riemann hypothesis which involves the order of magnitude of the partial sum of the Liouville function. Then we show a formula which is curiously related to the proved sufficient…

In a recent paper, Enayat and Le lyk [2024] show that second order arithmetic and countable set theory are not definitionally equivalent. It is well known that these theories are biinterpretable. Thus, we have a pair of natural theories…

Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…

This is the first of a series of papers on the $L^2$-theory for formally integrable structures. It is devoted to constructing a resolution of the solution sheaf for a class of overdetermined systems introduced by L. H{\"o}rmander. A…

Relations and interactions between the theorems of Ash, Herwig--Lascar and Ribes--Zalesskii are discussed and it is shown that these three theorems are equivalent in the sense that each of them can be derived from each other one. Some…

A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…

In this article, we go on to discuss about a series of infinite dimensional extension of the theorems in [3], [5], [6]. We also prove a similar Geraghty type constructions for Fisher ([5]) in infinite dimension, using similar techniques as…

In this paper we present a new first-order hyperbolic reformulation of the Cahn-Hilliard equation. The model is obtained from the combination of augmented Lagrangian techniques proposed earlier by the authors of this paper, with a classical…

Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…

For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…

We provide a new realisability model based on orthogonality for the multiplicative fragment of linear logic, both in presence of generalised axioms (MLL*) and in the standard case (MLL). The novelty is the definition of cut elimination for…