Mouse sets

Annals of Pure and Applied Logic 87 (1):1-100 (1997)
  Copy   BIBTEX

Abstract

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 , where is a canonical model from inner model theory. In technical terms, is a “mouse”. Consequently, we say that A is a mouse set. For a concrete example of the type of set A we are working with, let ODnω1 be the set of reals which are ∑n definable over the model Lω1 , from an ordinal parameter. In this paper we will show that for all n 1, ODnω1 is a mouse set. Our work extends some similar results due to D.A. Martin, J.R. Steel, and H. Woodin. Several interesting questions in this area remain open

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
The Largest Countable Inductive Set is a Mouse Set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
The mouse set theorem just past projective.Mitch Rudominer - forthcoming - Journal of Mathematical Logic.
Complexity of reals in inner models of set theory.Boban Velickovic & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
Complexity of reals in inner models of set theory.Boban Velickovic & Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
Strong Cardinals and Sets of Reals in Lω1.Ralf-Dieter Schindler - 1999 - Mathematical Logic Quarterly 45 (3):361-369.
Descriptive inner model theory.Grigor Sargsyan - 2013 - Bulletin of Symbolic Logic 19 (1):1-55.
Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
An Inner Model Proof of the Strong Partition Property for $delta^{2}_{1}$.Grigor Sargsyan - 2014 - Notre Dame Journal of Formal Logic 55 (4):563-568.

Analytics

Added to PP
2014-01-16

Downloads
5 (#847,061)

6 months
15 (#941,355)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Descriptive inner model theory.Grigor Sargsyan - 2013 - Bulletin of Symbolic Logic 19 (1):1-55.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Inner model operators in L.Mitch Rudominer - 2000 - Annals of Pure and Applied Logic 101 (2-3):147-184.

Add more citations

References found in this work

Inner models with many Woodin cardinals.J. R. Steel - 1993 - Annals of Pure and Applied Logic 65 (2):185-209.
Projectively well-ordered inner models.J. R. Steel - 1995 - Annals of Pure and Applied Logic 74 (1):77-104.
Iteration Trees.D. A. Martin & J. R. Steel - 2002 - Bulletin of Symbolic Logic 8 (4):545-546.

Add more references