Pages that link to "Item:Q2275370"
From MaRDI portal
The following pages link to A combinatorial proof of the dense Hindman's theorem (Q2275370):
Displaying 10 items.
- A combinatorial proof of an infinite version of the Hales-Jewett theorem (Q376553) (← links)
- Transfinite approximation of Hindman's theorem (Q1760370) (← links)
- Iterated combinatorial density theorems (Q1813782) (← links)
- D sets and IP rich sets in \(\mathbb {Z}\) (Q2787132) (← links)
- Ultrafilters in reverse mathematics (Q2878778) (← links)
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS (Q2976336) (← links)
- Hindman's theorem: an ultrafilter argument in second order arithmetic (Q3083144) (← links)
- CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC (Q4579817) (← links)
- A combinatorial proof of a stronger dense Hindman theorem (Q5037757) (← links)
- On the Descriptive Power of Probability Logic (Q5119670) (← links)
