The metamathematics of ergodic theory

DOI10.1016/j.apal.2008.09.001zbMath1168.03047MaRDI QIDQ1006602

Jeremy Avigad

Publication date: 25 March 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.001

zbMATH Keywords

constructive mathematics; proof theory; ergodic theory; computability

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

37A30: Ergodic theorems, spectral theory, Markov operators

Related Items

A functional interpretation for nonstandard arithmetic, Randomness, Computation and Mathematics, Proof Theory in Philosophy of Mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quantitative ergodic theory proof of Szemerédi's theorem
• Upcrossing inequalities for stationary sequences and applications
• Topological dynamics and combinatorial number theory
• An ergodic Szemerédi theorem for commuting transformations
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Elementary induction on abstract structures
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• On the speed of convergence in the ergodic theorem
• Handbook of proof theory
• Ergodic theorems for individual random sequences
• Finite functions and the necessary use of large cardinals
• Fluctuations of ergodic averages
• Computable structures and the hyperarithmetical hierarchy
• The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
• Fundamental notions of analysis in subsystems of second-order arithmetic
• The primes contain arbitrarily long arithmetic progressions
• An upcrossing inequality with applications
• Interpreting classical theories in constructive ones
• The ergodic theoretical proof of Szemerédi’s theorem
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
• Local stability of ergodic averages
• The pointwise ergodic theorem in subsystems of second-order arithmetic
• Functional interpretation and inductive definitions
• Hilbert's program relativized; Proof-theoretical and foundational reductions
• On sets of integers containing k elements in arithmetic progression
• Oscillation in ergodic theory
• The rate of convergence in ergodic theorems
• Number theory and elementary arithmetic†
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Proof of the Ergodic Theorem
• Proof of the Quasi-Ergodic Hypothesis
• A new method for establishing conservativity of classical systems over their intuitionistic version
• The complexity of the collection of measure-distal transformations
• Dynamical Systems of Continuous Spectra
• Counting in Ergodic Theory
• Norm convergence of multiple ergodic averages for commuting transformations
• General logical metatheorems for functional analysis
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• ∏ 0 1 Classes and Degrees of Theories
• On weak completeness of intuitionistic predicate logic
• On the Interpretation of Non-Finitist Proofs--Part I
• A new proof of Szemerédi's theorem