THE TREE PROPERTY AT Nω+1

被引：14
|
作者：
Sinapova, Dima [1 ]
机构：
[1] Univ Calif Irvine, Dept Math, Irvine, CA 92697 USA
来源：
JOURNAL OF SYMBOLIC LOGIC | 2012年 / 77卷 / 01期
关键词：
CANONICAL STRUCTURE; SET-THEORY; UNIVERSE;
D O I：
10.2178/jsl/1327068703
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that given omega many supercompact cardinals, there is a generic extension in which there are no Aronszajn trees at N omega+1. This is an improvement of the large cardinal assumptions. The previous hypothesis was a huge cardinal and a many supercompact cardinals above it, in Magidor-Shelah [7].
引用
收藏
页码：279 / 290
页数：12
相关论文
共 50 条
  • [31] The N-1-property of maps and Luzin's condition (N)
    Ponomarev, SP
    MATHEMATICAL NOTES, 1995, 58 (3-4) : 960 - 965
  • [32] A Property of K2n+1 as the Sum of n Spanning Cycles
    Yingtaweesittikul, Hatairat
    Longani, Vites
    THAI JOURNAL OF MATHEMATICS, 2022, 20 (02): : 715 - 720
  • [33] Property Testing of Regular Tree Languages
    Frédéric Magniez
    Michel de Rougemont
    Algorithmica, 2007, 49 : 127 - 146
  • [34] Property testing of regular tree languages
    Magniez, Frederic
    de Rougemont, Michel
    ALGORITHMICA, 2007, 49 (02) : 127 - 146
  • [35] The super tree property at the successor of a singular
    Sherwood Hachtman
    Dima Sinapova
    Israel Journal of Mathematics, 2020, 236 : 473 - 500
  • [36] The Property Suffix Tree with Dynamic Properties
    Kopelowitz, Tsvi
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 63 - 75
  • [37] A gap property of deterministic tree languages
    Niwinski, D
    Walukiewicz, I
    THEORETICAL COMPUTER SCIENCE, 2003, 303 (01) : 215 - 231
  • [38] The strong tree property and the failure of SCH
    Jin Du
    Archive for Mathematical Logic, 2019, 58 : 867 - 875
  • [39] The definable tree property for successors of cardinals
    Ali Sadegh Daghighi
    Massoud Pourmahdian
    Archive for Mathematical Logic, 2016, 55 : 785 - 798
  • [40] Property testing of regular tree languages
    Magniez, F
    de Rougemont, M
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 932 - 944
12345