Mathematical Existence Proofs
Mathematical Existence Proofs is a method in mathematical logic that establishes the existence of a mathematical object satisfying given properties without necessarily constructing the object explicitly, by relying on formal inference rules and axiomatic systems to derive existence as a logical consequence.
108
Publications
6.7K
Citations
170
Authors
112
Institutions
Publications per year
2017–2026
13
Parents
108
Ironing, Sweeping, and Multidimensional Screening
Jean‐Charles Rochet, Philippe Choné · Econometrica · 1998 · 607 citations
A parallel algorithmic version of the local lemma
Noga Alon · Random Structures and Algorithms · 1991 · 193 citations
1–5 of 108
170
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 170
112

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
274 citations

University of Notre Dame
Notre Dame, United States
2 h-index
2 publications
46 citations

University of Cologne
Cologne, Germany
2 h-index
2 publications
77 citations
University of Nebraska–Lincoln
Lincoln, United States
2 h-index
3 publications
79 citations
Simon Fraser University
Burnaby, Canada
2 h-index
3 publications
36 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
129 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
2 publications
118 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
56 citations
1–8 of 112
4 publications · 165 citations
5
h-index
5 publications · 189 citations
5
h-index
TRAN · 3 publications · 398 citations
3
h-index
Repository · 3 publications · 81 citations
3
h-index
3 publications · 106 citations
3
h-index
1–5