Guessing and non-guessing of canonical functions

DOI10.1016/j.apal.2007.02.002zbMath1116.03044OpenAlexW2050567783MaRDI QIDQ882121

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

zbMATH Keywords

stationary setdefinable well-orders of \(H(\omega _{2})\)guessing canonical functionsguessing densityiterations relative to sequences of measures on cardinalsPFA\(^{++}\)

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)

Related Items (5)

Partition properties for simply definable colourings ⋮ -definability at higher cardinals: Thin sets, almost disjoint families and long well-orders ⋮ What makes the continuum ℵ₂ ⋮ Martin's maximum and definability in \(H(\aleph_2\)) ⋮ On a convenient property about \([\gamma^{\aleph_0}\)]

Cites Work

• The bounded proper forcing axiom and well orderings of the reals
• Martin's maximum and definability in \(H(\aleph_2\))
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• Bounded forcing axioms as principles of generic absoluteness
• Coding by club-sequences
• Semiproper forcing axiom implies Martin maximum but not PFA⁺
• Some strong axioms of infinity incompatible with the axiom of constructibility
• Program termination and well partial orderings
• Some applications of iterated ultrapowers in set theory
• SET MAPPING REFLECTION
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guessing and non-guessing of canonical functions