Related papers: Ladder mice

We develop the basic fine structure theory of the minimal model of the Largest Suslin Axiom. In particular, we prove that that the minimal model of the Largest Suslin Axiom satisfies the Mouse Set Conjecture, and that the Proper Forcing…

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

A shelf is a set with a binary operation~$\op$ satisfying $a \op (b \op c) = (a \op b) \op (a \op c)$. Racks are shelves with invertible translations $b \mapsto a \op b$; many of their aspects, including cohomological, are better understood…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

In previous work, the first author, Ghioca, and the third author introduced a broad dynamical framework giving rise to many classical sequences from number theory and algebraic combinatorics. Specifically, these are sequences of the form…

We develop a simple formalism of biased tracers that we dub $\mathit{Monkey\ bias}$. In this formalism, a biased tracer field is constructed directly in terms of the linear matter fluctuation field and the set of derivative operators acting…

In the literature concerning the Laguerre-type weight function $x^\lambda w_0(x), x\in[0,+\infty)$, the Jacobi-type weight function $(1-x)^{\alpha}(1+x)^{\beta}w_0(x),x\in[-1,1]$, and the shifted Jacobi-type weight function…

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We…

Let \hat{S} be the algebraic universal cover of a closed surface of genus >1, T(\hat{S}) its Teichmuller space, M(\hat{S}) the group of mapping classes stabilizing a fixed leaf l. The L^1 Ehrenpreis conjecture asserts that M(\hat{S}) on…

In the lecture notes it is shown that an ordinal $\psi_{\Omega}(\varepsilon_{\mathbb{S}^{+}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\omega+(M\prec_{\Sigma_{1}}V)$. In this note we show that ${\sf…

Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…

In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.

We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…

We discuss a conjecture of Wilson that under the proper forcing axiom, $\Theta_0$ of the derived model at $\kappa$ is below $\kappa^+$. We prove the conjecture holds for the old derived model. Assuming mouse capturing in the new derived…

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

This paper introduces and formally verifies a novel geometric framework for first-order stochastic dominance (FSD) in $N$ dimensions using the Lean 4 theorem prover. Traditional analytical approaches to multi-dimensional stochastic…

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…