Guessing and non-guessing of canonical functions
DOI10.1016/J.APAL.2007.02.002zbMATH Open1116.03044OpenAlexW2050567783MaRDI QIDQ882121FDOQ882121
Authors: David Asperó 
Publication date: 23 May 2007
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2007.02.002
Recommendations
stationary setdefinable well-orders of \(H(\omega _{2})\)guessing canonical functionsguessing densityiterations relative to sequences of measures on cardinalsPFA\(^{++}\)
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55)
Cites Work
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Title not available (Why is that?)
- Some applications of iterated ultrapowers in set theory
- SET MAPPING REFLECTION
- The bounded proper forcing axiom and well orderings of the reals
- Title not available (Why is that?)
- Some strong axioms of infinity incompatible with the axiom of constructibility
- Program termination and well partial orderings
- Title not available (Why is that?)
- Semiproper forcing axiom implies Martin maximum but not PFA+
- Martin's maximum and definability in \(H(\aleph_2\))
- Bounded forcing axioms as principles of generic absoluteness
- Coding by club-sequences
Cited In (7)
- Quotients of strongly proper forcings and guessing models
- -definability at higher cardinals: Thin sets, almost disjoint families and long well-orders
- Martin's maximum and definability in \(H(\aleph_2\))
- On a convenient property about \([\gamma]^{\aleph_0}\)
- Partition properties for simply definable colourings
- What makes the continuum ℵ₂
- Guessing models and generalized Laver diamond
This page was built for publication: Guessing and non-guessing of canonical functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q882121)
