このアイテムのアクセス数: 64

このアイテムのファイル:
ファイル 記述 サイズフォーマット 
2081-03.pdf882.64 kBAdobe PDF見る/開く
完全メタデータレコード
DCフィールド言語
dc.contributor.authorMiyamoto, Tadatoshien
dc.contributor.authorYorioka, Teruyukien
dc.contributor.alternative宮元, 忠敏ja
dc.contributor.alternative依岡, 輝幸ja
dc.contributor.transcriptionミヤモト, タダトシ-
dc.contributor.transcriptionヨリオカ, テルユキ-
dc.date.accessioned2019-06-24T02:55:15Z-
dc.date.available2019-06-24T02:55:15Z-
dc.date.issued2018-08-
dc.identifier.issn1880-2818-
dc.identifier.urihttp://hdl.handle.net/2433/242174-
dc.description.abstractLet us fix a weakly Suslin tree T^{*} that is upward‐absolutely Aronszajn. Let us assume 2^{ $omega$} =$omega$_{1} and 2^{tlrcorner}1 = $omega$_{2} . We construct an Aspero-Mota type iterated forcing langle P_{$alpha$} | $alpha$ < $omega$_{2}rangle and take the direct limit P_{$omega$_{2}^{*} of the P_{$alpha$}mathrm{s}. In the generic extensions V^{P}backslash cdot 2, we have (1) 2^{ $omega$} = $omega$_{2}, (2) every Aronszajn tree gets an uncountable antichain and so no Suslin trees exist, while (3) T^{*} remains weakly Suslin and Aronszajn. In particular, T^{*} has no specializing maps. The idea of a weakly Suslin tree that is upward‐absolutely Aronszajn belongs to a work of S. Shelah. Combinatorics with Aronszajn trees, say, via R_{1, mathrm{N}_{1}} is due to T. Yorioka. An iterated forcing method that uses symmetric systems and markers is due to Aspero-Mota. It appears that the construction in this paper is sensitive to the length $omega$_{2}.en
dc.format.mimetypeapplication/pdf-
dc.language.isoeng-
dc.publisher京都大学数理解析研究所ja
dc.publisher.alternativeResearch Institute for Mathematical Sciences, Kyoto Universityen
dc.subject.ndc410-
dc.titleNo Suslin trees but a non-special Aronszajn tree exists by a side condition method : compact version (Iterated Forcing Theory and Cardinal Invariants)en
dc.typedepartmental bulletin paper-
dc.type.niitypeDepartmental Bulletin Paper-
dc.identifier.ncidAN00061013-
dc.identifier.jtitle数理解析研究所講究録ja
dc.identifier.volume2081-
dc.identifier.spage28-
dc.identifier.epage40-
dc.textversionpublisher-
dc.sortkey03-
dc.addressMathematics, Nanzan Universityen
dc.addressDepartment of Mathematics, Shizuoka Universityen
dc.address.alternative南山大学ja
dc.address.alternative静岡大学ja
dcterms.accessRightsopen access-
dc.identifier.jtitle-alternativeRIMS Kokyurokuen
出現コレクション:2081 反復強制法の理論と基数不変量

アイテムの簡略レコードを表示する

Export to RefWorks


出力フォーマット 


このリポジトリに保管されているアイテムはすべて著作権により保護されています。