Related papers: The Mouse Set Theorem Just Past Projective

Assume ZF + AD + $V=L(\mathbb{R})$. We prove some "mouse set" theorems, for definability over $J_\alpha(\mathbb{R})$ where $[\alpha,\alpha]$ is a projective-like gap (of $L(\mathbb{R})$) and $\alpha$ is either a successor ordinal or has…

In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that A is equal to the reals of M, where M is a…

Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_{\alpha}(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest…

We establish the descriptive set theoretic representation of the mouse $M_n^{\#}$, which is called $0^{(n+1)\#}$. This part deals with the case $n=1$.

Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is…

We establish the descriptive set theoretic representation of the mouse $M_n^{\#}$, which is called $0^{(n+1)\#}$. This part partially deals with the case $n=2$ by proving the many-one equivalence of $M_2^{\#}$ and the theory of…

Let $M^\sharp_n(\mathbb{R})$ denote the minimal active iterable extender model which has $n$ Woodin cardinals and contains all reals, if it exists, in which case we denote by $M_n(\mathbb{R})$ the class-sized model obtained by iterating the…

Suppose there is a Reinhardt cardinal. Then (1) $M_n(X)$ exists and is fully iterable (above $X$) for every transitive set $X$ and every $n<\omega$ (here $M_n(X)$ denotes the canonical minimal proper class inner model containing $X$ and…

We prove the following result which is due to the third author. Let $n \geq 1$. If $\boldsymbol\Pi^1_n$ determinacy and $\Pi^1_{n+1}$ determinacy both hold true and there is no $\boldsymbol\Sigma^1_{n+2}$-definable $\omega_1$-sequence of…

Working under $AD$, we investigate the length of prewellorderings given by the iterates of $\M_{2k+1}$, which is the minimal proper class mouse with $2k+1$ many Woodin cardinals. In particular, we answer some questions from \cite{Hjorth01}…

We prove that given any $\alpha$-approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an $f(g)$-round $(3\alpha+1)$-approximation LOCAL algorithm for MDS on graphs embeddable in a given Euler…

The determinacy of lightface $\Delta^1_{2n+2}$ and boldface $\boldsymbol{\Pi}^1_{2n+1}$ sets implies the existence of an $(\omega, \omega_1)$-iterable $M_{2n+1}^{\#}$.

We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…

We analyze the hereditarily ordinal definable sets $\operatorname{HOD}$ in $M_n(x)[g]$ for a Turing cone of reals $x$, where $M_n(x)$ is the canonical inner model with $n$ Woodin cardinals build over $x$ and $g$ is generic over $M_n(x)$ for…

The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last…

Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…

We investigate Steel's conjecture in 'The Core Model Iterability Problem', that if $W$ and $R$ are $\Omega+1$-iterable, $1$-small weasels, then $W\leq^{*}R$ iff there is a club $C\subset\Omega$ such that for all $\alpha\in C$, if $\alpha$…

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…

A celebrated 1969 theorem of Michael Rabin is that the MSO theory of the real order where the monadic quantifier is allowed only to range over the sets of rational numbers, is decidable. In 1975 Saharon Shelah proved that if the monadic…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…