Borel Hierarchy

The Borel Hierarchy is a stratification of the power set of a Polish space into increasingly complex Borel sets, indexed by countable ordinals, in which each level is defined by iterating operations of complementation and countable union starting from open sets.

52

Publications

1.8K

Citations

59

Authors

48

Institutions

Publications per year

2017–2026

3

Authors

59

  1. AW
    Arnold W. Miller

    University of Wisconsin–Madison, United States

    4 publications · 95 citations

    4

    h-index

  2. JD
    J Duparc

    Université Paris Cité, France

    4 publications · 127 citations

    4

    h-index

  3. AS
    Alexander S. Kechris

    California Institute of Technology, United States

    3 publications · 187 citations

    3

    h-index

  4. AH
    A. H. Stone

    University of Rochester, United States

    3 publications · 67 citations

    3

    h-index

  5. GH
    Greg Hjorth

    University of California, Los Angeles, United States

    3 publications · 158 citations

    3

    h-index

1–5 of 59

Venues

  1. Journal of Symbolic Logic

    8 publications · 230 citations

    8

    h-index

  2. Theoretical Computer Science

    5 publications · 151 citations

    5

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 4 publications · 502 citations

    4

    h-index

  4. Annals of Pure and Applied Logic

    4 publications · 147 citations

    4

    h-index

  5. Bulletin of Symbolic Logic

    3 publications · 121 citations

    3

    h-index

1–5