Hindman's theorem and idempotent types
Logic
2015-08-17 v1 Combinatorics
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.
Cite
@article{arxiv.1508.03613,
title = {Hindman's theorem and idempotent types},
author = {Uri Andrews and Isaac Goldbring},
journal= {arXiv preprint arXiv:1508.03613},
year = {2015}
}
Comments
6 pages