Related papers: Fine structure from normal iterability

We identify a particular mouse, $M^{\text{ld}}$, the minimal ladder mouse, that sits in the mouse order just past $M_n^{\sharp}$ for all $n$, and we show that $\mathbb{R}\cap M^{\text{ld}} = Q_{\omega+1}$, the set of reals that are…

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

In a previous paper we considered a positive function f, uniquely determined for s>0 by the requirements f(1)=1, log(1/f) is convex and the functional equation f(s)=psi(f(s+1)) with psi(s)=s-1/s. We prove that the meromorphic extension of f…

We show that if $f\colon I\to I$ is piecewise monotone, post-critically finite, and locally eventually onto, then for every point $x\in X=\underleftarrow{\lim}(I,f)$ there exists a planar embedding of $X$ such that $x$ is accessible. In…

Let $R$ be a formal power series ring over a field, with maximal ideal $\mathfrak m$, and let $I$ be an ideal of $R$ such that $R/I$ is Artinian. We study the iterated socles of $I$, that is the ideals which are defined as the largest ideal…

Two structures $M, N$ in the same language are called probably isomorphic if they (or, in case of metric structures, their completions) are isomorphic after forcing with the Lebesgue measure algebra. We show that, if $M$ and $N$ are…

For $f,g\in\omega\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. $\myc_{f,g}$ is…

We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…

It is shown that if there is a measurable cardinal above n Woodin cardinals and M_{n+1}^# doesn't exist then K exists. K is not fully iterable, though, but only iterable with respect to stacks of certain trees living between the Woodin…

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Let $M$ be a closed manifold that admits a self-cover $p:M \to M$ of degree >1. We say p is strongly regular if all its iterates are regular covers. In this case, we establish an algebraic structure theorem for the fundamental group of $M$:…

We study fine structural properties related to the interior regularity of $m$-dimensional area minimizing currents mod$(q)$ in arbitrary codimension. We show: (i) the set of points where at least one tangent cone is translation invariant…

In the 1990s, Steel and Woodin showed that under large cardinal hypotheses, the HOD of $L(\mathbb R)$ admits a fine-structural analysis. Although this theorem sheds light on various problems in descriptive set theory, the fine-structural…

We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…

Let $R$ be the class of regular cardinals which are not hyperinaccessible. We show that $L[R]$, and similar inner models in the $\alpha$-inaccessible hierarchy, can be generated by iterating a small "machete" mouse up through all the…

We give a construction of scales (in the descriptive set theoretic sense) directly from mouse existence hypotheses, without using any determinacy arguments. The construction is related to the Martin-Solovay construction for scales on…

A tree T_uni is m-universal for the class of trees if for every tree T of size m, T can be obtained from T_uni by successive contractions of edges. We prove that a m-universal tree for the class of trees has at least mln(m) + (gamma-1)m +…