Lorenzo Carlucci | Ricerc@Sapienza

Pubblicazioni

Titolo	Pubblicato in	Anno
Regressive versions of Hindman’s theorem	ARCHIVE FOR MATHEMATICAL LOGIC	2024
The Adjacent Hindman's Theorem for uncountable groups	COLLOQUIUM MATHEMATICUM	2023
Hindman's theorem for sums along the full binary tree, Sigma02-induction and the Pigeonhole principle for trees	ARCHIVE FOR MATHEMATICAL LOGIC	2022
Upper bounds on positional Paris–Harrington games	DISCRETE MATHEMATICS	2021
New Bounds on the Strength of Some Restrictions of Hindman’s Theorem	COMPUTABILITY	2020
A note on Hindman-Type Theorems for uncountable cardinals	ORDER	2019
A note on the ordinal analysis of RCA0 + WO(σ)	Proceedings of Computability in Europe 2019: Computing with Foresight and Industry	2019
"Weak yet strong'' restrictions of Hindman's Finite Sums Theorem	PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY	2018
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem	ARCHIVE FOR MATHEMATICAL LOGIC	2018
New bounds on the strength of some restrictions of Hindman’s Theorem	Unveiling Dynamics and Complexity	2017
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies	ACM TRANSACTIONS ON COMPUTATIONAL LOGIC	2016