Hostname: page-component-5cf477f64f-bmd9x Total loading time: 0 Render date: 2025-04-03T20:16:26.505Z Has data issue: false hasContentIssue false
  • English
  • Français

n–localization property

Published online by Cambridge University Press:  12 March 2014

Andrzej Rosłanowski
Andrzej Rosłanowski*
Affiliation:
University of Nebraska at Omaha, Department of Mathematics, Omaha, NE 68182-0243, USA.E-mail:roslanow@member.ams.orgURL: http://www.unomaha.edu/logic
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is concerned with n–localization property introduced by Newelski and Roslanowski in [10] and getting it for CS iterations of forcing notions.

Keywords

n-localization propertyforcingCS iterations
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 71 , Issue 3 , September 2006 , pp. 881 - 902
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Cichoń, Jacek, RosŁanowski, Andrzej, Steprans, Juris, and Wȩglorz, Bogdan, Combinatorial properties of the ideal , this Journal, vol. 58 (1993), pp. 42–54.Google Scholar
[2]Geschke, Stefan, More on convexity numbers of closed sets in ℝn, Proceedings of the American Mathematical Society, vol. 133 (2005), pp. 1307–1315.CrossRefGoogle Scholar
[3]Geschke, Stefan and Kojman, Menachem, Convexity numbers of closed sets in ℝn, Proceedings of the American Mathematical Society, vol. 130 (2002), pp. 2871–2881.CrossRefGoogle Scholar
[4]Geschke, Stefan, Kojman, Menachem, Kubiś, WiesŁaw, and Schipperus, Rene, Convex decompositions in the plane and continuous pair colorings of the irrationals, Israel Journal of Mathematics, vol. 131 (2002), pp. 285–317.CrossRefGoogle Scholar
[5]Geschke, Stefan and Quickert, Sandra, On Sacks forcing and the Sacks property, Classical and new paradigms of computation and their complexity hierarchies (Löwe, B., Piwinger, B., and Räsch, T., editors), Trends in Logic, vol. 23, Kluwer Academic Publishers, 2004, pp. 95–139.CrossRefGoogle Scholar
[6]Goldstern, Martin, Tools for your forcing construction, Set Theory of the Reals, vol. 6 of the Proceedings of the Israel Mathematical Conference, pp. 305–360, Ramat Gan, 1993.Google Scholar
[7]Jech, Thomas, Set Theory, Academic Press, New York, 1978.Google Scholar
[8]Kellner, Jakob, Preserving non-null with Suslin+ forcing, Archive for Mathematical Logic, accepted.Google Scholar
[9]Kellner, Jakob, Definable forcings, Ph.D. thesis, Universität Wien, Austria, 2004.Google Scholar
[10]Newelski, Ludomir and Rosłanowski, Andrzej, The ideal determined by the unsymmetric game, Proceedings of the American Mathematical Society, vol. 117 (1993), pp. 823–831.CrossRefGoogle Scholar
[11]Rosłanowski, Andrzej, Mycielski ideals generated by uncountable systems, Colloquium Mathematicum, vol. LXVI (1994), pp. 187–200.Google Scholar
[12]Rosłanowski, Andrzej and Shelah, Saharon, Reasonably complete forcing notions, Quaderni di Matematica, accepted.Google Scholar
[13]Rosłanowski, Andrzej and Shelah, Saharon, Sheva-Sheva-Sheva: Large creatures, Israel Journal of Mathematics, accepted.Google Scholar
[14]Rosłanowski, Andrzej and SteprᾹns, Juris, Chasing silver, Canadian Mathematical Bulletin, submitted.Google Scholar
[15]Shelah, Saharon, Not collapsing cardinals ≤ κ in (< κ)-support iterations, Israel Journal of Mathematics, vol. 136 (2003), pp. 29–115.CrossRefGoogle Scholar
[16]Shelah, Saharon, Properness without elementaricity, Journal of Applied Analysis, vol. 10 (2004), pp. 168–289.CrossRefGoogle Scholar