ON THE STRENGTH OF TWO RECURRENCE THEOREMS

DOI10.1017/JSL.2016.9zbMath1368.03016arXiv1305.5858OpenAlexW2963287244MaRDI QIDQ2976336

Adam R. Day

Publication date: 28 April 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.5858

zbMATH Keywords

dynamical systemsrecurrencecomputability theoryreverse mathematicsBirkhoffalmost periodicrecursion theoryAuslander-Ellis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20)

Related Items (1)

Nets and reverse mathematics

Cites Work

• Unnamed Item
• A simple proof and some difficult examples for Hindman's theorem
• Transfinite approximation of Hindman's theorem
• A combinatorial proof of the dense Hindman's theorem
• Open Questions in Reverse Mathematics

This page was built for publication: ON THE STRENGTH OF TWO RECURRENCE THEOREMS