Skip to main content
Log in

A Mathias criterion for the Magidor iteration of Prikry forcings

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We prove a Mathias-type criterion for the Magidor iteration of Prikry forcings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. i.e., obtained by choosing the next n-points of the generic Prikry sequence.

  2. \({{\,\textrm{supp}\,}}(p^*)\) is the support of \(p^*\) from Definition 1.5 (3).

  3. Note that \(\kappa ^{T}(s)\) can be determined from T and s since \(\kappa ^{T}(s) = \sup ({{\,\textrm{Succ}\,}}_T(s))\).

  4. Such conditions exist by Fact 1.7.

  5. The map \(k^F\) associated with the rest of the iteration \(\mathcal {T}\) over F, does not overlap \(\kappa _0^F\) and consists of critical points below \(\kappa _0^F\) or strictly above \(\kappa _0^F\). Since \(\kappa _0^F \in \Delta \) is inaccessible, \(k^F(\kappa _0^F) = \kappa _0^F\).

  6. \(C^{M^X_i}_{\bar{\kappa }}\) could be finite.

References

  1. Baumgartner, J.E.: On the size of closed unbounded sets. Ann. Pure Appl. Logic 54(3), 195–227 (1991)

    Article  MathSciNet  Google Scholar 

  2. Benhamou, T.: Prikry forcing and tree Prikry forcing of various filters. Arch. Math. Logic 58(7), 787–817 (2019)

    Article  MathSciNet  Google Scholar 

  3. Ben-Neria, O.: Forcing Magidor iteration over a core model below \(0^{}\). Arch. Math. Logic 53(3), 367–384 (2014)

    Article  MathSciNet  Google Scholar 

  4. Ben-Neria, O.: The structure of the Mitchell order-I. Isr. J. Math. 214(2), 945–982 (2016)

    Article  MathSciNet  Google Scholar 

  5. Ben-Neria, O., Unger, S.: Homogeneous changes in cofinalities with applications to HOD. J. Math. Log. 17(2), 1750007 (2017)

    Article  MathSciNet  Google Scholar 

  6. Bukovský, L.: Changing cofinality of a measurable cardinal (an alternative proof). Comment. Math. Univ. Carol. 014(4), 689–698 (1973)

    MathSciNet  Google Scholar 

  7. Cummings, J., Foreman, M.: Diagonal Prikry extensions. J. Symb. Logic 75(4), 1383–1402 (2010)

    Article  MathSciNet  Google Scholar 

  8. Cummings, J., Woodin, H.: Generalized Prikry forcings. Unpublished book

  9. Dehornoy, P.: Iterated ultrapowers and Prikry forcing. Ann. Math. Logic 15(2), 109–160 (1978)

    Article  MathSciNet  Google Scholar 

  10. Fuchs, G., Hamkins, J.D.: Boolean ultrapowers, the Bukovský-Dehornoy phenomenon, and iterated ultrapowers. Preprint (2017)

  11. Fuchs, G.: A characterization of generalized příkrý sequences. Arch. Math. Logic 44(8), 935–971 (2005)

    Article  MathSciNet  Google Scholar 

  12. Fuchs, G.: On sequences generic in the sense of magidor. J. Symb. Logic 79(4), 1286–1314 (2014)

    Article  MathSciNet  Google Scholar 

  13. Fuchs, G.: The strong příkrý property. Preprint (2017)

  14. Gitik, M.: Private communication

  15. Gitik, M.: Prikry-type forcings. In: Handbook of Set Theory, vol. 1, 2, 3, pp. 1351–1447. Springer, Dordrecht (2010)

  16. Gitik, M., Kaplan, E.: On restrictions of ultrafilters from generic extensions toground models. Preprint (2020)

  17. Gitik, M., Kaplan, E.: Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model. Ann. Pure Appl. Logic 174(1), 103164 (2023)

    Article  MathSciNet  Google Scholar 

  18. Kaplan, E.: The Magidor iteration and restrictions of ultrapowers to the ground model. Preprint (2022)

  19. Magidor, M.: How large is the first strongly compact cardinal? or A study on identity crises. Ann. Pure Appl. Logic 10(1), 33–57 (1976)

    MathSciNet  Google Scholar 

  20. Mathias, A.R.D.: On sequences generic in the sense of Prikry. J. Aust. Math. Soc. 15(4), 409–414 (1973)

    Article  MathSciNet  Google Scholar 

  21. Merimovich, C.: Mathias like criterion for the extender based Prikry forcing. Preprint (2021)

  22. Mitchell, W.: How weak is a closed unbounded ultrafilter? In: Van Dalen, D., Lascar, D., Smiley, T.J. (eds.) Logic Colloquium ’80, Volume 108 of Studies in Logic and the Foundations of Mathematics, pp. 209–230. Elsevier, Amsterdam (1982)

    Google Scholar 

  23. Welch, P.: Closed unbounded classes and the Haertig quantifier model. J. Symb. Logic (2019) (to appear)

Download references

Acknowledgements

The author would like to thank Philip Welch for raising the question concerning the Magidor iterations and genericity of sequences of generator in associated iterated ultrapowers, and to Philip Welch and Christopher Turner for pointing out a gap in a related argument of the author from [4] (Lemma 4.5). He is grateful to Moti Gitik for his remark concerning Example 1.9, to Christopher Turner for pointing out several problems in an earlier version of this paper, and to the referee for suggestions and corrections that improved the clarity of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Omer Ben-Neria.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The author was partially supported by the Israel Science Foundation (Grant 1832/19).

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ben-Neria, O. A Mathias criterion for the Magidor iteration of Prikry forcings. Arch. Math. Logic 63, 119–134 (2024). https://doi.org/10.1007/s00153-023-00887-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-023-00887-1

Keywords

Mathematics Subject Classification

Navigation