On the logical and computational properties of the Vitali covering theorem

DOI10.1016/j.apal.2024.103505MaRDI QIDQ6614040

Sam Sanders, Dag Normann

Publication date: 7 October 2024

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

zbMATH Keywords

computability theoryreverse mathematicsmeasure theoryhigher-order arithmetic

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Higher-type and set recursion theory (03D65) Abstract and axiomatic computability and recursion theory (03D75)

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Dirac delta function in two settings of reverse mathematics
• Probability measures and the C-sets of Selivanovskij
• Vitali's theorem and WWKL
• Sur les propriétés des fonctions mesurables.
• Sulle successioni di funzioni ortogonali.
• Note on the \textit{Heine-Borel} theorem.
• Una proprietà delle funzioni misurabili.
• Un théorème sur les ensembles mesurables.
• Sur une propriété des fonctions.
• On functions of \(n\) complex variables.
• Functionals of type 3 as realisers of classical theorems in analysis
• Representations and the foundations of mathematics
• Betwixt Turing and Kleene
• Nets and reverse mathematics. Some initial results
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Reverse mathematics and computability theory of domain theory
• Pincherle's theorem in reverse mathematics and computability theory
• The strength of compactness in computability theory and nonstandard analysis
• A model of set-theory in which every set of reals is Lebesgue measurable
• Littlewood’s Fourth Principle
• Representations of measurable sets in computable measure theory
• Monotone Convergence Theorem for the Riemann Integral
• The limits of determinacy in second-order arithmetic
• Uniform versions of some axioms of second order arithmetic
• Measure theory and higher order arithmetic
• Higher-Order Computability
• Classical hierarchies from a modern standpoint. Part I. C-sets
• Lebesgue Convergence Theorems and Reverse Mathematics
• The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis
• The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• On the mathematical and foundational significance of the uncountable
• Topological Entropy
• Representations of Reals in Reverse Mathematics
• Hierarchies of Effective Descriptive Set Theory
• Comparing Topological Entropy with Measure-Theoretic Entropy
• Analysis I
• A general theory of limits.
• Sur les suites de fonctions mesurables.
• Sur quelques points de la théorie des ensembles.
• On some points in the theory of functions.

This page was built for publication: On the logical and computational properties of the Vitali covering theorem