Simple Sets

Simple Set is a recursively enumerable set whose complement is infinite but contains no infinite recursively enumerable subset, thereby distinguishing it within the class of recursively enumerable sets by exhibiting a minimal form of non-computability.

85

Publications

3K

Citations

146

Authors

103

Institutions

Publications per year

2017–2026

4

Authors

146

  1. RI
    Robert I. Soare

    University of Chicago, United States

    4 publications · 161 citations

    4

    h-index

  2. CG
    Carl G. Jockusch

    University of Illinois Urbana-Champaign, United States

    3 publications · 124 citations

    3

    h-index

  3. RA
    Richard A. Shore

    Cornell University, United States

    3 publications · 147 citations

    3

    h-index

  4. JL
    José L. Balcázar

    Universitat Politècnica de Catalunya, Spain

    2 publications · 46 citations

    2

    h-index

  5. DA
    Donald A. Martin

    University of California, Los Angeles, United States

    2 publications · 71 citations

    2

    h-index

1–5 of 146

Venues

  1. Journal of Symbolic Logic

    13 publications · 392 citations

    12

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 7 publications · 392 citations

    7

    h-index

  3. Theoretical Computer Science

    4 publications · 123 citations

    4

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 3 publications · 65 citations

    3

    h-index

  5. Pacific Journal of Mathematics

    3 publications · 80 citations

    3

    h-index

1–5