Suslin Trees

Suslin Trees is a type of tree order in set theory characterized as an uncountable, complete, dense linear order without endpoints that satisfies the countable chain condition yet contains no uncountable branches or antichains.

6

Publications

248

Citations

12

Authors

8

Institutions

Publications per year

2017–2026

0

Variants

Suslin Tree

Authors

12

  1. SS
    Saharon Shelah

    Hebrew University of Jerusalem, Israel

    1 publications · 10 citations

    1

    h-index

  2. AL
    Alessandro Logar

    South Dakota School of Mines and Technology, United States

    1 publications · 95 citations

    1

    h-index

  3. MD
    Mirna Džamonja

    University of East Anglia, United Kingdom

    1 publications · 10 citations

    1

    h-index

  4. BV
    Boban Veličković

    Université Paris Cité, France

    1 publications · 24 citations

    1

    h-index

  5. PS
    Pablo Solern�

    Fundación Ciencias Exactas y Naturales, Argentina

    1 publications · 32 citations

    1

    h-index

1–5 of 12

Venues

  1. K-Theory

    1 publications · 16 citations

    1

    h-index

  2. Journal of Symbolic Logic

    1 publications · 24 citations

    1

    h-index

  3. Journal of Algebra

    1 publications · 95 citations

    1

    h-index

  4. Computational Complexity

    CC · 1 publications · 32 citations

    1

    h-index

  5. Inventiones mathematicae

    1 publications · 71 citations

    1

    h-index

1–5