``Weak yet strong restrictions of Hindman's finite sums theorem

DOI10.1090/PROC/13856MaRDI QIDQ4596010zbMATH OpenOpenAlexFDO

Authors Lorenzo Carlucci

Publication date 8 December 2017

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.07500

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Abstract: We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet implies the existence of the Turing Jump, thus realizing the only known lower bound for the full Finite Sums Theorem. This is the first example of this kind. In fact we isolate a rich family of similar restrictions of Hindman's Theorem with analogous properties.

Recommendations

• New bounds on the strength of some restrictions of Hindman’s Theorem
• New bounds on the strength of some restrictions of Hindman's theorem
• Effectiveness of Hindman’s Theorem for Bounded Sums
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• A simple proof and some difficult examples for Hindman's theorem

Cites work

• scientific article; zbMATH DE number 5003594 (Why is no real title available?)
• scientific article; zbMATH DE number 4063093 (Why is no real title available?)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 1531925 (Why is no real title available?)
• Brown's lemma in second-order arithmetic
• Effectiveness of Hindman’s Theorem for Bounded Sums
• Finite sums from sequences within cells of a partition of N
• Hilbert versus Hindman
• On the strength of Ramsey's theorem for pairs
• Open Problems in Partition Regularity
• Open questions in reverse mathematics
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Ramsey theory for discrete structures
• Ramsey's theorem and recursion theory
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Subsystems of second order arithmetic
• The Existence of Certain Ultrafilters on N and a Conjecture of Graham and Rothschild

Cited in

(12)

• New bounds on the strength of some restrictions of Hindman’s Theorem
• Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
• A note on Hindman-type theorems for uncountable cardinals
• Thin set versions of Hindman's theorem
• Restrictions of Hindman's theorem: an overview
• scientific article; zbMATH DE number 4063093 (Why is no real title available?)
• Note on finitary Hindman numbers
• New bounds on the strength of some restrictions of Hindman's theorem
• Effectiveness of Hindman’s Theorem for Bounded Sums
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• New Hindman spaces
• The reverse mathematics of Hindman's theorem for sums of exactly two elements

This page was built for publication: ``Weak yet strong restrictions of Hindman's finite sums theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596010)