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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

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

Order types of free subsets.Heike Mildenberger - 1997 - Annals of Pure and Applied Logic 89 (1):75-83.
Full reflection at a measurable cardinal.Thomas Jech & Jiří Witzany - 1994 - Journal of Symbolic Logic 59 (2):615-630.
Eastonʼs theorem and large cardinals from the optimal hypothesis.Sy-David Friedman & Radek Honzik - 2012 - Annals of Pure and Applied Logic 163 (12):1738-1747.
Stably measurable cardinals.Philip D. Welch - 2021 - Journal of Symbolic Logic 86 (2):448-470.
Measurable cardinals and good ‐wellorderings.Philipp Lücke & Philipp Schlicht - 2018 - Mathematical Logic Quarterly 64 (3):207-217.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Splitting number at uncountable cardinals.Jindrich Zapletal - 1997 - Journal of Symbolic Logic 62 (1):35-42.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.

Analytics

Added to PP
2012-09-25

Downloads
34 (#668,917)

6 months
9 (#497,927)

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