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

DOI10.1007/S00153-021-00814-2MaRDI QIDQ2155503zbMATH OpenOpenAlexFDO

Authors Lorenzo Carlucci, Daniele Tavernelli

Publication date 15 July 2022

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Disguising induction: proofs of the pigeonhole principle for trees
• 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
• scientific article; zbMATH DE number 822737
• 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
• scientific article; zbMATH DE number 4023311

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 3689386 (Why is no real title available?)
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• Disguising induction: proofs of the pigeonhole principle for trees
• Effectiveness of Hindman’s Theorem for Bounded Sums
• Finite sums from sequences within cells of a partition of N
• Hilbert versus Hindman
• New bounds on the strength of some restrictions of Hindman's theorem
• New bounds on the strength of some restrictions of Hindman’s Theorem
• On the strength of Ramsey's theorem for trees
• Open Problems in Partition Regularity
• Open questions in reverse mathematics
• Ramsey's theorem and recursion theory
• Reverse mathematics and Ramsey's property for trees
• Reverse mathematics, computability, and partitions of trees
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Subsystems of second order arithmetic
• The reverse mathematics of Hindman's theorem for sums of exactly two elements
• ``Weak yet strong restrictions of Hindman's finite sums theorem

Cited in

(2)

• The reverse mathematics of Hindman's theorem for sums of exactly two elements
• Disguising induction: proofs of the pigeonhole principle for trees

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)