Guessing and non-guessing of canonical functions
From MaRDI portal
(Redirected from Publication:882121)
Recommendations
Cites work
- scientific article; zbMATH DE number 702561 (Why is no real title available?)
- scientific article; zbMATH DE number 797413 (Why is no real title available?)
- scientific article; zbMATH DE number 3420743 (Why is no real title available?)
- Bounded forcing axioms as principles of generic absoluteness
- Coding by club-sequences
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Martin's maximum and definability in \(H(\aleph_2\))
- Program termination and well partial orderings
- SET MAPPING REFLECTION
- Semiproper forcing axiom implies Martin maximum but not PFA+
- Some applications of iterated ultrapowers in set theory
- Some strong axioms of infinity incompatible with the axiom of constructibility
- The bounded proper forcing axiom and well orderings of the reals
Cited in
(7)- Guessing models and generalized Laver diamond
- On a convenient property about \([\gamma]^{\aleph_0}\)
- -definability at higher cardinals: Thin sets, almost disjoint families and long well-orders
- Partition properties for simply definable colourings
- Quotients of strongly proper forcings and guessing models
- What makes the continuum ℵ₂
- Martin's maximum and definability in \(H(\aleph_2\))
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)