A Gitik iteration with nearly Easton factoring

Journal of Symbolic Logic 68 (2):481-502 (2003)
We reprove Gitik's theorem that if the GCH holds and o(κ) = κ + 1 then there is a generic extension in which κ is still measurable and there is a closed unbounded subset C of κ such that every $\nu \in C$ is inaccessible in the ground model. Unlike the forcing used by Gitik. the iterated forcing $R_{\lambda +1}$ used in this paper has the property that if λ is a cardinal less then κ then $R_{\lambda + 1}$ can be factored in V as $R_{\kappa + 1} = R_{\lambda + 1} \times R_{\lambda + 1, \kappa}$ where $\mid R_{\lambda +1}\mid \leq \lambda^+$ and $R_{\lambda + 1, \kappa}$ does not add any new subsets of λ
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1052669060
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,422
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

147 ( #29,322 of 1,924,993 )

Recent downloads (6 months)

1 ( #418,001 of 1,924,993 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.