Conservation strength of the infinite pigeonhole principle for trees
From MaRDI portal
Publication:6561666
Cites work
- scientific article; zbMATH DE number 4008384 (Why is no real title available?)
- scientific article; zbMATH DE number 3689386 (Why is no real title available?)
- Every sequence is reducible to a random one
- On principles between \(\Sigma_1\)- and \(\Sigma_2\)-induction, and monotone enumerations
- On the strength of Ramsey's theorem for trees
- Rapidly growing Ramsey functions
- Reverse mathematics and Ramsey's property for trees
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- Subsystems of second order arithmetic
- The inductive strength of Ramsey's theorem for pairs
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
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)