Approachability and Games on Posets

DOI10.2178/JSL/1052669065MaRDI QIDQ3160555zbMATH OpenOpenAlexFDO

Authors Yasuo Yoshinobu

Publication date 9 February 2005

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jsl/1052669065

zbMATH Keywords

approachabilitystrategically closed poset

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40) Other set-theoretic hypotheses and axioms (03E65) Games involving topology, set theory, or logic (91A44)

Recommendations

• On SCH and the approachability property
• Approachability at the second successor of a singular cardinal
• On the \(\kappa\)-cub game on \(\lambda\) and \(I[\lambda]\)
• scientific article; zbMATH DE number 3860925
• Successive failures of approachability

Cites work

• A very weak square principle
• Aronszajn trees and the independence of the transfer property
• Directive trees and games on posets
• Games played on Boolean algebras
• scientific article; zbMATH DE number 3702632 (Why is no real title available?)
• scientific article; zbMATH DE number 3731799 (Why is no real title available?)
• Jensen's ⃞ principles and the Novák number of partially ordered sets
• On a generalization of Jensen's □_κ, and strategic closure of partial orders
• Squares, scales and stationary reflection
• The fine structure of the constructible hierarchy

Cited in

(2)

• Operations, climbability and the proper forcing axiom
• More on setwise climbability properties

This page was built for publication: Approachability and Games on Posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3160555)