Disguising induction: proofs of the pigeonhole principle for trees

MaRDI QIDQ3464620zbMATH OpenFDO

Authors Jeffry L. Hirst

Publication date 27 January 2016

zbMATH Keywords

induction on \(\Sigma_2^0\) formulaspigeonhole principle for treesreverse mathematics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Hindman's theorem for sums along the full binary tree, ^0_2-induction and the pigeonhole principle for trees
• The Pigeonhole Principle and Fragments of Arithmetic
• On Tao's “finitary” infinite pigeonhole principle
• On the indecomposability of \(\omega^n\)
• On A Problem Concerning Parameter Free Induction

Cited in

(4)

• Restrictions of Hindman's theorem: an overview
• Hindman's theorem for sums along the full binary tree, ^0_2-induction and the pigeonhole principle for trees
• Reverse mathematics and colorings of hypergraphs
• Where pigeonhole principles meet Koenig lemmas

This page was built for publication: Disguising induction: proofs of the pigeonhole principle for trees

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