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…
math.LO2016
Second order intuitionistic propositional logic of the real line is decidable
Konrad Zdanowski
It is known that the set of tautologies of second order intuitionistic propositional logic, , is undecidable. Here, we prove that the sets of formulas of $\mathrm{I…
math.LO2016
One Henkin Quantifier in the empty vocabulary suffices for undecidability
Konrad Zdanowski
We prove that there are single Henkin quantifiers such that first order logic augmented by one of these quantifiers is undecidable in the empty vocabulary. Examples of such quantif…