Conservation strength of the infinite pigeonhole principle for trees

DOI10.1007/S11856-023-2567-8MaRDI QIDQ6561666FDOQ6561666

Authors: C. T. Chong, Wei Wang, Yue Yang 

Publication date: 25 June 2024

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Proof theory and constructive mathematics (03Fxx) Computability and recursion theory (03Dxx) General logic (03Bxx)

Cites Work

• Subsystems of second order arithmetic
• Rapidly growing Ramsey functions
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every sequence is reducible to a random one
• Reverse mathematics and Ramsey's property for trees
• The inductive strength of Ramsey's theorem for pairs
• On the strength of Ramsey's theorem for trees
• On principles between \(\Sigma_1\)- and \(\Sigma_2\)-induction, and monotone enumerations
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs

This page was built for publication: Conservation strength of the infinite pigeonhole principle for trees

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