ON THE STRENGTH OF TWO RECURRENCE THEOREMS

DOI10.1017/JSL.2016.9MaRDI QIDQ2976336zbMATH OpenOpenAlexFDO

Authors Adam R. Day

Publication date 28 April 2017

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

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

zbMATH Keywords

dynamical systemsrecurrencealmost periodiccomputability theoryrecursion theoryreverse mathematicsBirkhoffAuslander-Ellis

Mathematics Subject Classification ID

Notions of recurrence and recurrent behavior in topological dynamical systems (37B20) 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) Constructive and recursive analysis (03F60)

Abstract: This paper uses the framework of reverse mathematics to investigate the strength of two recurrence theorems of topological dynamics. It establishes that one of these theorems, the existence of an almost periodic point, lies strictly between WKL and ACA (working over RCA_0). This is the first example of a theorem with this property. It also shows the existence of an almost periodic point is conservative over RCA_0 for Pi^1_1 sentences. These results establish the existence of a new upwards-closed subclass of the PA degrees

Recommendations

• Periodic points and subsystems of second-order arithmetic
• Computability and dynamical systems
• Randomness and non-ergodic systems
• A study of singular points and supports of measures in reverse mathematics
• Computational unsolvability of domains of attraction of nonlinear systems
• Chord theorems on graphs
• A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
• Periodicity and Immortality in Reversible Computing
• Computability theory, nonstandard analysis, and their connections
• On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

Cites work

• A combinatorial proof of the dense Hindman's theorem
• A simple proof and some difficult examples for Hindman's theorem
• Open questions in reverse mathematics
• Subsystems of second order arithmetic
• Transfinite approximation of Hindman's theorem

Cited in

(2)

• Nets and reverse mathematics
• On a Recurrence Formula Associated with Strong Distributions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976336)