Hindman's theorem and idempotent types
Abstract
Motivated by a question of Di Nasso, we prove that Hindman's theorem is equivalent to the existence of idempotent types in countable complete extensions of Peano Arithmetic.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.