Related papers: Approximation of hyperarithmetic analysis by $\ome…
It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb\'an,…
We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…
We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…
This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…
This paper presents a reverse mathematical analysis of several forms of the sorites paradox. We first illustrate how traditional formulations are reliant on H\"older's Representation Theorem for ordered Archimedean groups. While this is…
In this paper we develop a technique for proving determinacy of classes of the form $\omega^2-\Pi^1_1+\Gamma$ (a refinement of the difference hierarchy on the co-analytic sets lying between $\omega^2-\Pi^1_1$ and $(\omega^2+1)-\Pi^1_1$)…
There is no infinite sequence of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$ each of which proves $\Pi^1_1$-reflection of the next. This engenders a well-founded ``reflection ranking'' of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$.…
Peano Arithmetic is known to be provably equivalent to reflection over Elementary Arithmetic. We prove a characterization of Predicative Analysis in the guise of ATR0 in terms of stronger reflection principles.
We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…
We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…
The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…
We prove, in ZF+$\bf\Sigma^1_2$-determinacy, that for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a…
In this paper, we give characterizations of the set of $\Pi^1_{e}$-consequences, $\Sigma^1_{e}$-consequences and $\mathsf{B}(\Pi^1_{e})$-consequences of the axiomatic system of the strong dependent choice for $\Sigma^1_i$ formulas…
We investigate some Weihrauch problems between $\mathsf{ATR}_2$ and $\mathsf{C}_{\omega^\omega}$ . We show that the fixed point theorem for monotone operators on the Cantor space (a weaker version of the Knaster-Tarski theorem) is not…
We introduce a new shrinkage variable selection operator for linear models which we term the \emph{adaptive ridge selector} (ARiS). This approach is inspired by the \emph{relevance vector machine} (RVM), which uses a Bayesian hierarchical…
Rapid learning requires flexible representations to quickly adopt to new evidence. We develop a novel class of models called Attentive Recurrent Comparators (ARCs) that form representations of objects by cycling through them and making…
For a tuple $(\theta_1,..,\theta_M)$ of complex number, buliding on the approximation techniques in earlier papers of this series, this paper engages in deducing lower estimates on the transcendence degree of the field generated by…
Variance reduction is a family of powerful mechanisms for stochastic optimization that appears to be helpful in many machine learning tasks. It is based on estimating the exact gradient with some recursive sequences. Previously, many papers…