Hindman's theorem and idempotent types
classification
🧮 math.LO
math.CO
keywords
hindmanidempotenttheoremtypesarithmeticcompletecountableequivalent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.