Forcing NSω1 Completely Bounded via Semiproper Iterations (実数の集合論)
スポンサーリンク
概要
著者
関連論文
- On the consistency strength of the FRP for the second uncountable cardinal (Combinatorial set theory and forcing theory)
- A class of preorders iterated under a type of RCS (Interplay between large cardinals and small cardinals)
- A maximal forcing axiom compatible with weak club guessing (Combinatorial and Descriptive Set Theory)
- Club guessing on the least uncountable cardinal and CH (Axiomatic Set Theory and Set-theoretic Topology)
- A weak reflection compatible with tail club guessing via semiproper iteration (実数の集合論と反復強制法の相互関係--RIMS研究集会報告集)
- A Strong Form of $\psi_\mathrm{AC}$(Forcing and Infinitary Combinatorics)
- Weak Kurepa trees and weak diamonds (Forcing Method and Large Cardinal Axioms)
- BSPFA Combined with One Measurable Cardinal (集合論的手法による相対的無矛盾性の証明の周辺)
- Iterated Forcing with ωω-bounding and Semiproper Preorders (公理的集合論)
- Forcing NSω1 Completely Bounded via Semiproper Iterations (実数の集合論)
- $\omega_1$-Souslin trees under countable support iterations(Mathematical Logic and Applications'92)
- Simplifled Morasses which capture the $\Delta$-systems(MATHEMATICAL LOGIC AND ITS APPLICATIONS)
- A Forcing Axiom and Chang's Conjecture (Aspects of Descriptive Set Theory)
- Notes A Note on Forcing Memorial Issue on the Occasion of the Retirement of Professor Susumu Yamada
- SOME RESULTS IN THE EXTENSION WITH A COHERENT SUSLIN TREE, PART II (Forcing extensions and large cardinals)