Hindman's theorem for sums along the full binary tree, ^0_2-induction and the pigeonhole principle for trees

DOI10.1007/S00153-021-00814-2zbMATH Open1506.03061OpenAlexW4205809420MaRDI QIDQ2155503FDOQ2155503

Daniele Tavernelli, Lorenzo Carlucci

Publication date: 15 July 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00814-2

zbMATH Keywords

inductionHindman's theoremreverse mathematicsPigeonhole principle

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)

Cites Work

• Finite sums from sequences within cells of a partition of N
• Title not available (Why is that?)
• Title not available (Why is that?)
• Slicing the Truth
• Title not available (Why is that?)
• Ramsey's theorem and recursion theory
• Open Questions in Reverse Mathematics
• Reverse mathematics and Ramsey's property for trees
• Open Problems in Partition Regularity
• Hilbert versus Hindman
• On the strength of Ramsey's theorem for trees
• Reverse mathematics, computability, and partitions of trees
• “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• New bounds on the strength of some restrictions of Hindman's theorem
• Effectiveness of Hindman’s Theorem for Bounded Sums
• Title not available (Why is that?)
• New bounds on the strength of some restrictions of Hindman’s Theorem
• The reverse mathematics of Hindman’s Theorem for sums of exactly two elements
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• On two conjectures concerning trees with maximal inverse sum indeg index 👍 👎
• Combinatorial proof of the Prodinger formulas about binary trees 👍 👎
• Further results on the inducibility of $d$-ary trees 👍 👎
• Title not available (Why is that?) 👍 👎
• An extended result of Kleitman and Saks concerning binary trees 👍 👎
• HARRISON'S THEOREM FOR Λ-TREES 👍 👎
• The general \(\sigma \) all-ones problem for trees 👍 👎
• A tree version of Kőnig's theorem 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees

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