scientific article; zbMATH DE number 4063093
From MaRDI portal
Publication:3797180
Recommendations
- A simple proof and some difficult examples for Hindman's theorem
- The reverse mathematics of Hindman's theorem for sums of exactly two elements
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- Hindman's theorem, ultrafilters, and reverse mathematics
- Additive and Multiplicative Ramsey Theorems in ℕ – Some Elementary Results
Cited in
(17)- Effectiveness for the dual Ramsey theorem
- Thin set versions of Hindman's theorem
- 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
- A combinatorial proof of the dense Hindman's theorem
- Periodic points and subsystems of second-order arithmetic
- Hindman's theorem and choice
- Ramsey algebras and the existence of idempotent ultrafilters
- Is there a symmetric version of Hindman's theorem?
- A simple proof and some difficult examples for Hindman's theorem
- On the strength of König's duality theorem for countable bipartite graphs
- Conservativity of ultrafilters over subsystems of second order arithmetic
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- Invariants, Boolean algebras and ACA₀⁺
- The adjacent Hindman's theorem and the \(\mathbb{Z}\)-Ramsey's theorem
- A recursive coloring function without _3⁰ solutions for Hindman's theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3797180)
