10 citations · 13 across the 10 of their papers we have counts for
1 paper · 2 filters
Lorenzo Carlucci, Konrad Zdanowski
We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} s…