The indescribability of the order of the indescribable cardinals
dc.contributor.author | Hauser, Kai | en_US |
dc.date.accessioned | 2006-04-10T15:13:30Z | |
dc.date.available | 2006-04-10T15:13:30Z | |
dc.date.issued | 1992-05-06 | en_US |
dc.identifier.citation | Hauser, Kai (1992/05/06)."The indescribability of the order of the indescribable cardinals." Annals of Pure and Applied Logic 57(1): 45-91. <http://hdl.handle.net/2027.42/30053> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6TYB-45F5R5T-7/2/7c933c7186acd24cf5c9f27f67990dfc | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30053 | |
dc.description.abstract | We prove the following consistency results about indescribable cardinals which answer a question of A. Kanamori and M. Magidor (cf. [3]).Theorem 1.1 (m[ges]2, n[ges]2). CON(ZFC + [there exists][kappa], [kappa]' ([kappa] is [Pi]mn indescribable, [kappa]' is [sigma]mn indescribable, and [kappa] CON(ZFC + [sigma] mn> [pi]mn + GCH).Theorem 5.1 (ZFC). Assuming the existence of [sigma]mn indescribable cardinals for all m {0,1} there is a poset P [set membership, variant] L[] such that GCH holds in (L[])P and Theorem 1.1 extends the work begun in [2], and its proof uses an iterated forcing construction together with master condition arguments. By combining these techniques with some observations about small forcing and indescribability, one obtains the Easton-style result 5.1. | en_US |
dc.format.extent | 3053200 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | The indescribability of the order of the indescribable cardinals | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | California Institute of Technology, Sloan Laboratory 253-37, Pasadena, CA 91125, USA; University of Michigan, Department of Mathematics, Ann Arbor, MI 48109, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30053/1/0000421.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0168-0072(92)90061-4 | en_US |
dc.identifier.source | Annals of Pure and Applied Logic | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.