Prikry forcing and tree Prikry forcing of various filters
- 1 Downloads
In this paper, we answer a question asked in Koepke et al. (J Symb Logic 78:85–100, 2013) regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.
KeywordsPrikry forcing Intermediate models None-normal ultrafilter
Mathematics Subject Classification03E40
Unable to display preview. Download preview PDF.
The author would like to thank his supervisor Prof. Moti Gitik and Eilon Bilinsky for their mathematical and non–mathematical support. Also he would like to thank the Referee for his detailed and careful examination of the paper.
- 1.Benhamou, T., Gitik, M.: Sets in magidor generic extensions (preprint) (2016)Google Scholar
- 3.Cummings, J.: Iterated Forcing and Elementary Embeddings. Chapter in Handbook of Set Theory, pp. 776–847 (2009)Google Scholar
- 8.Gitik, M., Kanovei, V., Koepke, P.: Intermediate models of prikry generic extensions (preprint) (2010)Google Scholar
- 9.Jech, Thomas: Set Theory Third Millennium Edition. Springer, Berlin (2002)Google Scholar