Carnegie Mellon University
Browse
file.pdf (289.74 kB)

Diagonal Prikry extensions

Download (289.74 kB)
journal contribution
posted on 2009-08-01, 00:00 authored by James CummingsJames Cummings, Matthew Foreman

It is a well-known phenomenon in set theory that problems in in- finite combinatorics involving singular cardinals and their successors tend to be harder than the parallel problems for regular cardinals. Examples include the behaviour of cardinal exponentiation, the extent of the tree property, the extent of stationary reflection, and the existence of non-free almost-free abelian groups. The explanation for this phenomenon lies in inner model theory, in particular core models and covering lemmas.

History

Publisher Statement

© 2010 Association for Symbolic Logic

Date

2009-08-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC