Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets

Notre Dame Journal of Formal Logic 53 (3):351-371 (2012)
  Copy   BIBTEX

Abstract

We give upper and lower bounds for the strength of ordinal definable determinacy in a small admissible set. The upper bound is roughly a premouse with a measurable cardinal $\kappa$ of Mitchell order $\kappa^{++}$ and $\omega$ successors. The lower bound are models of ZFC with sequences of measurable cardinals, extending the work of Lewis, below a regular limit of measurable cardinals

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
Proper forcing and l(ℝ).Itay Neeman & Jindřich Zapletal - 2001 - Journal of Symbolic Logic 66 (2):801-810.
Anti-admissible sets.Jacob Lurie - 1999 - Journal of Symbolic Logic 64 (2):407-435.
The equivalence of determinacy and iterated sharps.Derrick Albert Dubose - 1990 - Journal of Symbolic Logic 55 (2):502-525.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
A dichotomy for the definable universe.Greg Hjorth - 1995 - Journal of Symbolic Logic 60 (4):1199-1207.
The strength of Blackwell determinacy.Donald A. Martin, Itay Neeman & Marco Vervoort - 2003 - Journal of Symbolic Logic 68 (2):615-636.
On measurable limits of compact cardinals.Arthur W. Apter - 1999 - Journal of Symbolic Logic 64 (4):1675-1688.
Admissible suslin cardinals in l(r).Steve Jackson - 1991 - Journal of Symbolic Logic 56 (1):260 - 275.

Analytics

Added to PP
2012-09-25

Downloads
24 (#639,942)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Sets constructible from sequences of ultrafilters.William J. Mitchell - 1974 - Journal of Symbolic Logic 39 (1):57-66.
The next admissible set.K. J. Barwise, R. O. Gandy & Y. N. Moschovakis - 1971 - Journal of Symbolic Logic 36 (1):108-120.
Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
Unraveling Π11 sets.Itay Neeman - 2000 - Annals of Pure and Applied Logic 106 (1-3):151-205.
Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.

View all 6 references / Add more references