works

Refereed papers

Unrefereed papers

  • Todorčević’s Axiom K2 and ladder system colorings (RIMS 2019), RIMS Kokyuroku, No.2164 (2020), 104-107.(Joint work with Justin Tatch Moore)

    In this article, it is proved that if every c.c.c. partition K[ω1]2 has an ncountable homogeneous set, then every ladder system coloring on ω1 can be σ-uniformized. This improves a previous result of the second author in “Todorčević’s fragments of Martin’s axiom and variations of uniformizations of ladder system colorings”.

  • Todorčević’s fragments of Martin’s axiom and variations of uniformizations of ladder system colorings (RIMS 2018), RIMS Kokyuroku, No. 2141 (2019), 49-55.

    Uniformization of ladder system colorings has been introduced by analysis of a proof of the Shelah’s solution of Whitehead problem. Here, for a subset S of ω1Lim, U(S) is the assertion that, for any ladder system coloring dα:αω1Lim, there exists SS such that the restricted coloring dα:αS can be uniformized. Shelah’s proof can be separated into the following two theorems: MA1 implies U({ω1Lim}), and U({ω1Lim}) implies the existence of a non-free Whitehead group. It is proved that the assertion K3, which is one of Todorcevic’s fragments of Martin’s Axiom, implies that U(stat) holds, where stat stands for the set of stationary subsets of ω1Lim.

  • A comment on Bagaria-Shelah’s fragment of Martin’s axiom, Iterated forcings and cardinal invariants (RIMS 2017), RIMS Kokyuroku, No. 2081 (2018), 62-68.

    By use of the idea of Bagaria and Shelah in [On partial orderings having precalibre-1 and fragments of Martin’s axiom, Fund. Math. 232 (2016), no. 2, 181–197], it is proved that it is consistent that MA(rec) holds, and both K3 and MA1(σ-linked) fail.

  • No Suslin trees but a non-special Aronszajn tree exists by a side condition method : compact version, Iterated forcings and cardinal invariants (RIMS 2017), RIMS Kokyuroku, No. 2081 (2018), 28-40. (Joint work with Tadatoshi Miyamoto)

    Shelah proved that it is consistent that Suslin Hypothesis holds and there exists a non-special Aronszajn tree. We show this by use of a modification of Aspero-Mota iteration.

  • The existence of a non special Aronszajn tree and Todorcevic orderings, Infinitary combinatorics in set theory and its applications (RIMS 2014), Sūrikaisekikenkyūsho Kōkyūroku, No 1949 (2015), 89-98.

    It is proved that it is consistent that every forcing notions with R1,1 has precaliber 1, every Todorčević ordering for any second countable Hausdorff space also has precaliber 1, and there exists a non-special Aronszajn tree. This slightly extends the previous work due to the author [APAL 2010].

  • Some results in the extension with a coherent Suslin tree II, Forcing extensions and large cardinals (RIMS 2012), Sūrikaisekikenkyūsho Kōkyūroku, No 1851 (2013), 49-61. (Joint work with Tadatoshi Miyamoto)

    It is proved the following: (1) PFA(S) implies MRP. (2) For any coherent Suslin tree S and an S-name C˙ for a ladder system on ω1, there exists an almost strongly proper forcing notion (which will be defined in this article) which generically adds an S-name for a club on ω1 which violates the statement that C˙ is a weak club guessing ladder systems.

  • Some results in the extension with a coherent Suslin tree, Aspects of Descriptive Set Theory (RIMS 2011), Sūrikaisekikenkyūsho Kōkyūroku, No 1790 (2012), 72-82. (Joint work with Dilip Raghavan)

    We show that under PFA(S), the coherent Suslin tree S (which is a witness of the axiom PFA(S)) forces that there are no ω2-Aronszajn trees. We also determine the values of cardinal invariants of the continuum in this extension.

  • Another c.c.c. forcing that destroys presaturation, Combinatorial set theory and forcing theory (RIMS2009), Sūrikaisekikenkyūsho Kōkyūroku, No. 1686 (2010), 73-74. (joint work with Paul B. Larson)

    We show that if ZF is consistent with the Axiom of Determinacy, then it is consistent that NSω1 is saturated and there exists a Suslin tree S such that the forcing to specialize S with finite conditions destroys the presaturation of NSω1. Our proof is a different approach by Velickovic [Forcing axioms and stationary sets, Theorem 4.6].

  • The inequality b>1 can be considered as an analogue of Suslin’s Hypothesis, Axiomatic Set Theory and Set-theoretic Topology (RIMS 2007), Sūrikaisekikenkyūsho Kōkyūroku, No. 1595 (2008), 84-88.

    The author introduced a new chain condition, called the anti-rectangle refining property. A typical example of a forcing notion with the anti-rectangle refining property is an Aronszajn tree. So it can be considered a generalization of Suslin’s Hypothesis that every forcing notion with the anti-rectangle refining property has
    an uncountable antichain. It is proved that this statement implies that the bounding number is larger than 1.