Descriptive Set-theoretic Complexity

Descriptive Set-Theoretic Complexity is a formal measure in mathematical logic that classifies the complexity of sets of real numbers according to their definability and structural properties within the hierarchy of Borel and projective sets in descriptive set theory.

19

Publications

568

Citations

33

Authors

27

Institutions

Publications per year

2017–2026

1

Authors

33

  1. AS
    Alexander S. Kechris

    California Institute of Technology, United States

    3 publications · 118 citations

    3

    h-index

  2. RD
    R. Daniel Mauldin

    University of North Texas, United States

    1 publications · 72 citations

    1

    h-index

  3. LM
    Luca Motto Ros

    University of Vienna, Austria

    1 publications · 16 citations

    1

    h-index

  4. AS
    Alexander S. Kechris

    California Institute of Technology, United States

    1 publications · 13 citations

    1

    h-index

  5. MT
    M.N. Thakur

    University of California, Santa Cruz, United States

    1 publications · 51 citations

    1

    h-index

1–5 of 33

Venues

  1. Transactions of the American Mathematical Society

    TRAN · 2 publications · 24 citations

    2

    h-index

  2. Journal of Computer and System Sciences

    1 publications · 51 citations

    1

    h-index

  3. Inventiones mathematicae

    1 publications · 27 citations

    1

    h-index

  4. 1

    h-index

  5. Journal of Mathematical Logic

    1 publications · 14 citations

    1

    h-index

1–5