Related papers: Wellfoundedness proof with the maximal distinguish…
It is shown that for any fixed $i>0$, the $\Sigma_{i+1}$-fragment of Presburger arithmetic, i.e., its restriction to $i+1$ quantifier alternations beginning with an existential quantifier, is complete for…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…
In this paper we prove a higher dimensional analogue of Carleson's $\varepsilon^2$ conjecture. Given two arbitrary disjoint open sets $\Omega^+,\Omega^-\subset \mathbb{R}^{n+1}$, and $x\in\mathbb{R}^{n+1}$, $r>0$, we denote…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
Let $\Sigma$ be an oriented compact hypersurface in the round sphere $\mathbb{S}^n$ or in the flat torus $\mathbb{T}^n$, $n\geq 3$. In the case of the torus, $\Sigma$ is further assumed to be contained in a contractible subset of…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories. According to conventional wisdom, ordinal analysis measures the strength of theories. Yet what is the attendant notion of strength? In…
In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…
Given $\epsilon \in (0,1)$, a probability measure $\mu$ on $\Omega\subset\mathbb{R}^p$ and a semi-algebraic set $K\subset X\times\Omega$, we consider the feasible set $X^*_\epsilon=\{x\in X:{\rm Prob}[(x,\omega)\in K]\geq 1-\epsilon\}$…
Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…
We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…
A system of polynomial ordinary differential equations (ODEs) is specified via a vector of multivariate polynomials, or vector field, $F$. A safety assertion $\psi\rightarrow[F]\phi$ means that the trajectory of the system will lie in a…
We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…
We design an algorithm which finds an $\epsilon$-approximate stationary point (with $\|\nabla F(x)\|\le \epsilon$) using $O(\epsilon^{-3})$ stochastic gradient and Hessian-vector products, matching guarantees that were previously available…
For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…
We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
A poset $\bfp$ is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, $\ell(\bfp)$ of $\bfp$. We prove that if the vertex set $X$ of…