Coding into HOD via normal measures with some applications

&
Mathematical Logic Quarterly 57 (4):366-372 (2011)
  Copy   BIBTEX

Abstract

We develop a new method for coding sets while preserving GCH in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carried by a measurable cardinal as an oracle, and therefore, in order to code a subset A of κ, we require that our model contain κ many measurable cardinals above κ. Additionally we will describe some of the applications of this result. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Categories

Keywords

Reprint years

DOI

10.1002/malq.201010010

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Indestructibility and measurable cardinals with few and many measures.Arthur W. Apter - 2008 - Archive for Mathematical Logic 47 (2):101-110.
Weakly measurable cardinals.Jason A. Schanker - 2011 - Mathematical Logic Quarterly 57 (3):266-280.
Accessing the switchboard via set forcing.Shoshana Friedman - 2012 - Mathematical Logic Quarterly 58 (4-5):303-306.
The number of normal measures.Sy-David Friedman & Menachem Magidor - 2009 - Journal of Symbolic Logic 74 (3):1069-1080.
Some Remarks on Normal Measures and Measurable Cardinals.Arthur W. Apter - 2001 - Mathematical Logic Quarterly 47 (1):35-44.
Indestructibility, HOD, and the Ground Axiom.Arthur W. Apter - 2011 - Mathematical Logic Quarterly 57 (3):261-265.
Indestructibility, measurability, and degrees of supercompactness.Arthur W. Apter - 2012 - Mathematical Logic Quarterly 58 (1):75-82.
Indestructibility, instances of strong compactness, and level by level inequivalence.Arthur W. Apter - 2010 - Archive for Mathematical Logic 49 (7-8):725-741.
Supercompact cardinals, trees of normal ultrafilters, and the partition property.Julius B. Barbanel - 1986 - Journal of Symbolic Logic 51 (3):701-708.
Inner models with large cardinal features usually obtained by forcing.Arthur W. Apter, Victoria Gitman & Joel David Hamkins - 2012 - Archive for Mathematical Logic 51 (3-4):257-283.
Indestructible strong compactness and level by level inequivalence.Arthur W. Apter - 2013 - Mathematical Logic Quarterly 59 (4-5):371-377.
A model with a measurable which does not carry a normal measure.Eilon Bilinsky & Moti Gitik - 2012 - Archive for Mathematical Logic 51 (7-8):863-876.
Identity crises and strong compactness.Arthur W. Apter & James Cummings - 2000 - Journal of Symbolic Logic 65 (4):1895-1910.

Analytics

Added to PP
2013-12-01

Downloads
38 (#410,745)

6 months
10 (#255,509)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Indestructibility, HOD, and the Ground Axiom.Arthur W. Apter - 2011 - Mathematical Logic Quarterly 57 (3):261-265.
Accessing the switchboard via set forcing.Shoshana Friedman - 2012 - Mathematical Logic Quarterly 58 (4-5):303-306.

Add more citations

References found in this work

The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Elementary embeddings and infinitary combinatorics.Kenneth Kunen - 1971 - Journal of Symbolic Logic 36 (3):407-413.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
The Ground Axiom.Jonas Reitz - 2007 - Journal of Symbolic Logic 72 (4):1299 - 1317.

View all 9 references / Add more references