Descriptive inner model theory

DOI10.2178/BSL.1901010MaRDI QIDQ2837761zbMATH OpenOpenAlexFDO

Authors Grigor Sargsyan

Publication date 11 July 2013

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.2712, https://projecteuclid.org/euclid.bsl/1368716862

zbMATH Keywords

descriptive set theoryhod mouseinner model theorymouse set conjecture

Mathematics Subject Classification ID

Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)

Abstract: A paper for general audience about descriptive inner model theory.

Review text

One of the major advances in pure set theory in recent years is \textit{G. Sargsyan}'s dissertation, titled [A tale of hybrid mice. Berkeley: University of California (PhD Thesis) (2009)]. This paper surveys the recent developments in descriptive inner model theory (DIMT) up to the time his dissertation was completed, in particular his proofs of instances of the \textit{mouse set conjecture} (MSC).NEWLINENEWLINE\hskip1em Given a sentence in the language of set theory (for instance, PFA), a typical problem in modern set theory is to determine its large cardinal strength. For the direction of obtaining the large cardinal lower bound, one often needs to construct canonical inner models for large cardinals. For that, the descriptive inner model theoretical approach is to extract large cardinals from canonical structures of determinacy models, in particular of models for theories in the Solovay hierarchy (\S2). Behind the DIMT approach, there is the philosophy that the Solovay hierarchy covers all levels of the consistency strength hierarchy. Recent progress indicates that this approach together with Woodin's core model induction are very likely the keys to finding the large cardinal lower bound of PFA.NEWLINENEWLINE\hskip1em At the heart of DIMT is the MSC, which conjectures that the most complicated form of definability (the universally Baire sets, to be precise) can be captured by suitable mice (which are all \textit{hod mice} in this paper). The author gives a succinct account of the theory of mice (\S1) and sketched the use of HOD analysis (\S3) of determinacy models in his proofs of MSC instances. The main result discussed in this paper is the following theorem.NEWLINENEWLINE\smallskip \noindent { Main theorem.} Each of the following four statements implies that there is an inner model containing the reals and satisfying AD\({}_{\mathbb R}+ {}\)``\(\Theta\) is regular. {\parindent=0.7cm\begin{itemize}\item[(1)] CH\({}+{}\)``for some stationary \(S \subseteq \omega_1\) the non-stationary ideal restricted to \(S\) is \(\omega_1\)-dense and super homogeneous. \item[(2)] Mouse Capturing fails in some inner model \(M\) containing reals and modeling AD\({}^{+}+{}\)``\(V=L({\mathcal P}({\mathbb R}))\). \item[(3)] There are divergent models of AD\({^{+}}\). \item[(4)] There is a Woodin limit of Woodin cardinals. NEWLINENEWLINE\end{itemize}} In contrary to the common belief that the strength of AD\({}_{\mathbb R}+ {}\)``\(\Theta\) is regular is close to one supercompact cardinal, item (4) above significantly reduces the strength down to a Woodin limit of Woodin cardinals.

Recommendations

• Mouse sets
• Mini-workshop: Fine structure and inner model theory. Abstracts from the mini-workshop held November 8th -- November 14th, 2009
• Report 20/2006: Mini-workshop: Feinstrukturtheorie und innere Modelle (April 30th -- May 6th, 2006)
• The mouse set conjecture for sets of reals
• Suitable extender models. I

Cites work

• Believing the axioms. I
• Believing the axioms. II
• Coding with ladders a well ordering of the reals
• Descriptive set theory
• Does mathematics need new axioms?
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 567513 (Why is no real title available?)
• Inner models in the region of a Woodin limit of Woodin cardinals
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• On the consistency strength of the proper forcing axiom
• PFA implies AD^L(ℝ)
• Projectively well-ordered inner models
• Sets constructed from sequences of measures: Revisited
• Sets constructible from sequences of ultrafilters
• Stacking mice
• Strong ultrapowers and long core models
• THE ABC'S of Mice
• The axiom of determinacy, forcing axioms, and the nonstationary ideal
• The determinacy of long games
• The largest countable inductive set is a mouse set

Cited in

(21)

• Mouse sets
• Hod up to \(A D_{\mathbb{R}} + \Theta\) is measurable
• Inner model operators in \(L(\mathbb{R})\)
• Covering with Chang models over derived models
• Hod mice and the mouse set conjecture
• scientific article; zbMATH DE number 4047708 (Why is no real title available?)
• The largest countable inductive set is a mouse set
• THE ABC'S of Mice
• Foundational implications of the inner model hypothesis
• Covering with universally Baire operators
• Realizing an \(\mathrm{AD}^+\) model as a derived model of a premouse
• SEALING OF THE UNIVERSALLY BAIRE SETS
• Translation procedures in descriptive inner model theory
• The mouse set conjecture for sets of reals
• 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 from iterability
• On -Strongly Measurable Cardinals
• Finer topologies on pointsets in Polish spaces
• WHAT IS A RESTRICTIVE THEORY?
• Determinacy axioms and large cardinals
• The exact consistency strength of the generic absoluteness for the universally Baire sets
• The consistency strength of determinacy when all sets are universally Baire

This page was built for publication: Descriptive inner model theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837761)