Yasuo Yoshinobu

dblp:26/99 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 first-author · 1 since 2021
YearPublicationVenuePosition
2026 More on setwise climbability properties
Bernhard König, Yasuo Yoshinobu
Ann. Pure Appl. Log.2
2017 The ⁎-variation of the Banach-Mazur game and forcing axioms
Yasuo Yoshinobu
Ann. Pure Appl. Log.1
2013 Operations, climbability and the proper forcing axiom
Yasuo Yoshinobu
Ann. Pure Appl. Log.1
2012 Kurepa trees and Namba forcing
abstract
Abstract We show that strongly compact cardinals and MM are sensitive to λ-closed forcings for arbitrarily large λ. This is done by adding ‘regressive’ λ-Kurepa trees in either case. We argue that the destruction of regressive Kurepa trees requires a non-standard application of MM. As a corollary, we find a consistent example of an ω2-closed poset that is not forcing equivalent to any ω2-directed-closed poset.
Bernhard König, Yasuo Yoshinobu
J. Symb. Log.2
2009 Dense non-reflection for stationary collections of countable sets
David Asperó, John Krueger, Yasuo Yoshinobu
Ann. Pure Appl. Log.3
2003 Approachability and games on posets
abstract
Abstract We show that for any infinite cardinal κ, every strongly (κ + 1 )-strategically closed poset is strongly κ+-strategically closed if and only if APκ (the approachability property) holds, answering the question asked in [5]. We also give a complete classification of strengths of strategic closure properties and that of strong strategic closure properties respectively.
Yasuo Yoshinobu
J. Symb. Log.1