Combinatorial Principles
Combinatorial Principles is a foundational concept in set theory that refers to a class of axiomatic statements or methods governing the structure, partition properties, and interaction of infinite sets through combinatorial configurations such as those expressed in Ramsey-type theorems, diamond principles, and square principles.
34
Publications
1.7K
Citations
49
Authors
43
Institutions
Publications per year
2017–2026
0
Parents
34
The Relative Complexity of NP Search Problems
Paul Beame, Stephen Cook, Jeff Edmonds et al. · Journal of Computer and System Sciences · 1998 · 178 citations
1–5 of 34
49
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 49
43

University of Toronto
Toronto, Canada
3 h-index
3 publications
268 citations
University of Chicago
Chicago, United States
3 h-index
3 publications
248 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
2 publications
165 citations
University of Washington
Seattle, United States
2 h-index
2 publications
207 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
207 citations

Imperial College London
London, United Kingdom
2 h-index
2 publications
32 citations

York University
Toronto, Canada
2 h-index
2 publications
207 citations
London School of Economics and Political Science
London, United Kingdom
2 h-index
2 publications
32 citations
1–8 of 43
10 publications · 497 citations
10
h-index
PROC · 2 publications · 41 citations
2
h-index
2 publications · 123 citations
2
h-index
TRAN · 2 publications · 74 citations
2
h-index
1 publications · 76 citations
1
h-index
1–5