Approachability and Games on Posets

DOI10.2178/jsl/1052669065zbMath1055.03031OpenAlexW2018863727MaRDI QIDQ3160555

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

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

Related Items (1)

Operations, climbability and the proper forcing axiom

Cites Work

• Unnamed Item
• Unnamed Item
• SQUARES, SCALES AND STATIONARY REFLECTION
• Directive trees and games on posets
• Games played on Boolean algebras
• On a generalization of Jensen's □_κ, and strategic closure of partial orders
• A very weak square principle
• Jensen's ⃞ principles and the Novák number of partially ordered sets
• Aronszajn trees and the independence of the transfer property
• The fine structure of the constructible hierarchy

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