No CrossRef data available.
Article contents
The independence of ![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027020230970-0525:S0022481200014080_inline1.gif?pub-status=live)
Published online by Cambridge University Press: 12 March 2014
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1999
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027020230970-0525:S0022481200014080_inline4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027020230970-0525:S0022481200014080_inline5.gif?pub-status=live)