Directive trees and games on posets

DOI10.1090/S0002-9939-01-06235-9zbMath0987.03045MaRDI QIDQ2781309

Yasuo Yoshinobu, Tetsuya Ishiu

Publication date: 19 March 2002

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

directive treesstrategic closure

Mathematics Subject Classification ID

Other set-theoretic hypotheses and axioms (03E65) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (6)

Approachability and Games on Posets ⋮ The \(\ast\)-variation of the Banach-Mazur game and forcing axioms ⋮ Operations, climbability and the proper forcing axiom ⋮ Measurable cardinals and the cardinality of Lindelöf spaces ⋮ Local saturation and square everywhere ⋮ STATIONARY REFLECTION

Cites Work

• Unnamed Item
• More game-theoretic properties of Boolean algebras
• Games played on Boolean algebras
• On a generalization of Jensen's □_κ, and strategic closure of partial orders
• Jensen's ⃞ principles and the Novák number of partially ordered sets

This page was built for publication: Directive trees and games on posets