Constructible Sets

Constructible Sets is a formal class of sets in set theory defined by transfinite recursion over the ordinals, where each set is explicitly definable from previous stages using first-order formulas, forming the backbone of the constructible universe $L$.

57

Publications

2.7K

Citations

69

Authors

53

Institutions

Publications per year

2017–2026

4

Authors

69

  1. AP
    Anand Pillay

    University of Illinois Urbana-Champaign, United States

    3 publications · 185 citations

    3

    h-index

  2. MF
    Mohamed Faouzi Atig

    Uppsala University, Sweden

    2 publications · 42 citations

    2

    h-index

  3. MI
    M. I. Marchuk

    Sobolev Institute of Mathematics, Russia

    2 publications · 25 citations

    2

    h-index

  4. CS
    Charles S. Chihara

    University of California, Berkeley, United States

    2 publications · 125 citations

    2

    h-index

  5. MM
    Marc Moreno Maza

    Western University, Canada

    2 publications · 118 citations

    2

    h-index

1–5 of 69

Venues

  1. Journal of Symbolic Logic

    5 publications · 205 citations

    5

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 4 publications · 175 citations

    4

    h-index

  3. Algebra and Logic

    4 publications · 233 citations

    4

    h-index

  4. Bulletin of the London Mathematical Society

    2 publications · 77 citations

    2

    h-index

  5. The Journal of Logic Programming

    2 publications · 108 citations

    2

    h-index

1–5