Related papers: Feferman's completeness theorem
Vardanyan's Theorems state that $\mathsf{QPL}(\mathsf{PA})$ - the quantified provability logic of Peano Arithmetic - is $\Pi^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary…
We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…
One of the driving motivations to develop $\F_1$-geometry is the hope to translate Weil's proof of the Riemann hypothesis from positive characteristics to number fields, which might result in a proof of the classical Riemann hypothesis. The…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
In 1955, Berger \cite{Ber} gave a list of irreducible reductive representations which can occur as the holonomy of a torsion-free affine connection. This list was stated to be complete up to possibly a finite number of missing entries. In…
Atserias and M\"uller (JACM, 2020) proved that for every unsatisfiable CNF formula $\varphi$, the formula $\operatorname{Ref}(\varphi)$, stating "$\varphi$ has small Resolution refutations", does not have subexponential-size Resolution…
We present proofs of basic results, including those developed by Harold Bell, for the plane fixed point problem: does every map of a non-separating plane continuum have a fixed point? Some of these results had been announced much earlier by…
In 1964 Shepherdson \cite{shepherdson:1964} proved that a discretely ordered semiring $\mathcal{M}^+$ satisfies $\sf{IOpen}$ (quantifier free induction) iff the corresponding ring $\mathcal{M}$ is an integer part of the real closure of the…
For a general affine Hecke algebra H we study its Schwartz completion S. The main theorem is an exact description of the image of S under the Fourier isomorphism. An important ingredient in the proof of this result is the definition and…
"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…
For an arbitrary polygon consider a new one by joining the centres of consecutive edges. Iteration of this procedure leads to a shape which is affine equivalent to a regular polygon. This regularisation effect is usually ascribed to Count…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
We prove an effective version of the Pila-Wilkie Theorem for sets definable using Pfaffian functions, providing effective estimates for the number of algebraic points of bounded height and degree lying on such sets. We also prove effective…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
Let $f \colon X \dashrightarrow X$ be a dominant rational self-map of a smooth projective variety defined over $\overline{\mathbb Q}$. For each point $P\in X(\overline{\mathbb Q})$ whose forward $f$-orbit is well-defined, Silverman…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Riemann sums, a classical method for approximating the definite integral of a function, have been extensively studied in the past. However, their monotonic properties, while still of great importance, particularly in approximation theory…
Two alternative, fairly compact proofs are presented of the Pfaffian integration theorem that is surfaced in the recent studies of spectral properties of Ginibre's Orthogonal Ensemble. The first proof is based on a concept of the Fredholm…
The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…