Weak prediction principles
From MaRDI portal
Abstract: We prove the consistency of the failure of the weak diamond at strongly inaccessible cardinals. On the other hand, we show that the very weak diamond is equivalent to the statement and hence holds at every strongly inaccessible cardinal.
Recommendations
Cited in
(9)- Block branching Miller forcing and covering numbers for prediction
- Double weakness
- (Weak) diamond can fail at the least inaccessible cardinal
- Diamonds, compactness, and measure sequences
- Reflection principles, GCH and the uniformization properties
- Negating the Galvin property
- Cofinal types of ultrafilters over measurable cardinals
- Galvin's property at large cardinals and an application to partition calculus
- The Erdős-Hajnal problem list
This page was built for publication: Weak prediction principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376612)