Iteration Trees

Iteration Tree is a well-founded tree structure in set theory that organizes a sequence of elementary embeddings and ultrapowers used to compare and analyze iterable models of large cardinal axioms within inner model theory.

39

Publications

2.3K

Citations

66

Authors

60

Institutions

Publications per year

2017–2026

1

Authors

66

  1. LA
    Luca Aceto

    Aalborg University, Denmark

    3 publications · 77 citations

    3

    h-index

  2. WF
    Wan Fokkink

    Vrije Universiteit Amsterdam, Netherlands

    3 publications · 108 citations

    3

    h-index

  3. ZÉ
    Zoltán Ésik

    University of Szeged, Hungary

    3 publications · 66 citations

    3

    h-index

  4. RS
    Ralf Schindler

    University of Münster, Germany

    2 publications · 61 citations

    2

    h-index

  5. SC
    Stefano Catani

    Istituto Nazionale di Fisica Nucleare, Sezione di Firenze, Italy

    2 publications · 138 citations

    2

    h-index

1–5 of 66

Venues

  1. Theoretical Computer Science

    5 publications · 314 citations

    5

    h-index

  2. Information and Computation

    4 publications · 117 citations

    4

    h-index

  3. Journal of Symbolic Logic

    3 publications · 101 citations

    3

    h-index

  4. Journal of Computer and System Sciences

    2 publications · 87 citations

    2

    h-index

  5. Paper in Linguistics

    1 publications · 95 citations

    1

    h-index

1–5