Skip to main content Accessibility help
×
Home

Combinatorics on ideals and forcing with trees

  • Marcia J. Groszek (a1)

Abstract

Classes of forcings which add a real by forcing with branching conditions are examined, and conditions are found which guarantee that the generic real is of minimal degree over the ground model. An application is made to almost-disjoint coding via a real of minimal degree.

Copyright

References

Hide All
[1] Baumgartner, J., Iterated forcing, Surveys in set theory (Mathias, A. R. D., editor), London Mathematical Society Lecture Note Series, no. 87, Cambridge University Press, Cambridge, 1983, pp. 159.
[2] Beller, A., Jensen, R., and Welch, P., Coding the universe, London Mathematical Society Lecture Note Series, no. 47, Cambridge University Press, Cambridge, 1982.
[3] Carlson, T., Kunen, K., and Miller, A., A minimal degree which collapses ω1 , this Journal, vol. 49 (1984), pp. 298300.
[4] Friedman, S., The coding method in set theory (book, in preparation).
[5] Gray, C., Iterated forcing from the strategic point of view, Ph.D. Thesis, University of California, Berkeley, California, 1980.
[6] Grigorieff, S., Combinatorics on ideals and forcing, Annals of Mathematical Logic, vol. 3 (1971), pp. 363394.
[7] Jensen, R., Definable sets of minimal degree, Mathematical logic and foundations of set theory (Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1970, pp. 122128.
[8] Jensen, R. and Solovay, R., Some applications of almost disjoint sets, Mathematical logic and foundations of set theory (Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1970, pp. 84104.
[9] Laver, R., On the consistency of Borel's conjecture, Acta Mathematica, vol. 137 (1976), pp. 151169.
[10] Miller, A., Rational perfect set forcing, Axiomatic set theory (Baumgartner, J. et al., editors), Contemporary Mathematics, vol. 31, American Mathematical Society, Providence, Rhode Island, 1984, pp. 143159.
[11] Sacks, G., Countable admissible ordinals and hyperdegrees, Advances in Mathematics, vol. 19 (1976), pp. 213262.10.1016/0001-8708(76)90187-0
[12] Sacks, G., Forcing with perfect closed sets, Axiomatic set theory (Scott, D., editor), Proceedings of Symposia in Pure Mathematics, vol. 13, part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331355.10.1090/pspum/013.1/0276079

Keywords

Related content

Powered by UNSILO

Combinatorics on ideals and forcing with trees

  • Marcia J. Groszek (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.