Zero-one Laws

Zero-One Laws is a theoretical principle in descriptive complexity that asserts every sentence in a given logical language either holds in almost all finite structures or holds in almost no finite structures with respect to asymptotic probabilistic measures.

100

Publications

3.3K

Citations

93

Authors

64

Institutions

Publications per year

2017–2026

6

Variants

0-1 Laws

Authors

93

  1. OY
    Osman Yağan

    Carnegie Mellon University, United States

    14 publications · 426 citations

    12

    h-index

  2. AM
    Armand M. Makowski

    University of Maryland, College Park, United States

    10 publications · 295 citations

    10

    h-index

  3. JZ
    Jun Zhao

    Nanyang Technological University, Singapore

    8 publications · 222 citations

    8

    h-index

  4. VD
    Virgil D. Gligor

    University of Maryland, College Park, United States

    7 publications · 200 citations

    7

    h-index

  5. MZ
    Maksim Zhukovskii

    Lomonosov Moscow State University, Russia

    6 publications · 135 citations

    6

    h-index

1–5 of 93

Venues

  1. The Annals of Probability

    12 publications · 378 citations

    11

    h-index

  2. IEEE Transactions on Information Theory

    8 publications · 323 citations

    8

    h-index

  3. Proceedings of the American Mathematical Society

    PROC · 5 publications · 91 citations

    5

    h-index

  4. Journal of the American Mathematical Society

    JAMS · 4 publications · 296 citations

    4

    h-index

  5. Transactions of the American Mathematical Society

    TRAN · 4 publications · 137 citations

    4

    h-index

1–5