Skip to main content Accessibility help

The independence of

  • Amir Leshem (a1) and Menachem Magidor (a2)


In this paper we prove the independence of for n ≥ 3. We show that can be forced to be above any ordinal of L using set forcing. For we prove that it can be forced, using set forcing, to be above any L cardinal κ such that κ is Π1 definable without parameters in L. We then show that cannot be forced by a set forcing to be above every cardinal of L Finally we present a class forcing construction to make greater than any given L cardinal.



Hide All
[1]Beller, A., Jensen, R. B., and Welch, P., Coding the universe, Cambridge University Press, 1982.
[2]David, R., reals, Annals of Mathematical Logic, vol. 23 (1982), pp. 121–125.
[3]David, R., A very absolute real singleton, Annals of Mathematical Logic, vol. 23 (1982), pp. 101–120.
[4]Friedman, H., 102 problems in mathematical logic, this Journal, vol. 40 (1975), pp. 113–129.
[5]Harrington, L., The constructible reals can be (almost) everything, handwritten notes, 1977.
[6]Hinman, P. G., Recursion-theoretic hierarchies, Springer-Verlag, 1978.
[7]Jech, T., Set theory, Academic Press, 1978.
[8]Jensen, R. B. and Solovay, R. M., Some applications of almost disjoint forcing, Mathematical logic and foundations of set theory (Bar-Hillel, Y., editor), Amsterdam, 1970.
[9]Kunen, K. and Tall, F. D., Between Martin's axiom and Souslin's hypothesis, Fundamenta Mathematicae vol. 102 (1979), pp. 173–181.
[10]Moschovakis, Y. N., Descriptive set theory, Studies in Logic, vol. 100, North-Holland, 1980.


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