3 papers
math.LO2026
The strength of Ramsey's theorem for -large sets
Lorenzo Carlucci, Andrea Volpi, Konrad Zdanowski
We calibrate the reverse mathematical strength of a family of extensions of Ramsey's theorem to finite colorings of certain subsets of the natural numbers of unbounded finite dimen…
cs.LO2024
Between proof construction and SAT-solving
Aleksy Schubert, Paweł Urzyczyn, Konrad Zdanowski
The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for impli…
math.LO2024
Reductions of well-ordering principles to combinatorial theorems
Lorenzo Carlucci, Leonardo Mainardi, Konrad Zdanowski
A well-ordering principle is a principle of the form: If is well-ordered then is well-ordered, where is some natural operator transforming linear orders into linear…