Splittings and disjunctions in reverse mathematics

DOI10.1215/00294527-2019-0032zbMATH Open1462.03009arXiv1805.11342OpenAlexW2995569045MaRDI QIDQ2176407FDOQ2176407

Sam Sanders

Publication date: 4 May 2020

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Abstract: Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, i.e. non-set-theoretic, mathematics. As suggested by the title, this paper deals with two (relatively rare) RM-phenomena, namely splittings and disjunctions. As to splittings, there are some examples in RM of theorems $A,B,C$ such that $Aleftrightarrow(BwedgeC)$, i.e. $A$ can be split into two independent (fairly natural) parts $B$ and $C$. As to disjunctions, there are (very few) examples in RM of theorems $D,E,F$ such that $Dleftrightarrow(EveeF)$, i.e. $D$ can be written as the disjunction of two independent (fairly natural) parts $E$ and $F$. By contrast, we show in this paper that there is a plethora of (natural) splittings and disjunctions in Kohlenbach's higher-order RM. Finally, we discuss the role of these results in the grand scheme of things.

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

Recommendations

• Equivalents of the (weak) fan theorem
• Well-Ordering Principles in Proof Theory and Reverse Mathematics
• Using Ramsey's theorem once
• Uniform versions of some axioms of second order arithmetic
• A note on the ordinal analysis of \(\mathrm{RCA}_0+\mathrm{WO}(\mathbf{\sigma})\)
• Reverse mathematics, trichotomy and dichotomy
• Non-principal ultrafilters, program extraction and higher-order reverse mathematics
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• scientific article; zbMATH DE number 2247263
• Reverse mathematics and completeness theorems for intuitionistic logic

zbMATH Keywords

reverse mathematicssplittingsconjunctionshigher-order arithmeticMUCdisjunctions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A garden of integrals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher-Order Computability
• Title not available (Why is that?)
• Pincherle's theorem in reverse mathematics and computability theory
• Representations of Reals in Reverse Mathematics
• A modern theory of random variation. With applications in stochastic calculus, financial mathematics, and Feynman integration
• Title not available (Why is that?)
• Postmodern analysis
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• \(\mathsf{WKL}_0\) and induction principles in model theory
• Open Questions in Reverse Mathematics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Real variable contributions of G. C. Young and W. H. Young
• Title not available (Why is that?)
• Title not available (Why is that?)
• The limits of determinacy in second-order arithmetic
• Some nonstandard equivalences in reverse mathematics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniform versions of some axioms of second order arithmetic
• Title not available (Why is that?)
• Scenes from the history of real functions. Translated from the Russian by Roger Cooke
• Title not available (Why is that?)
• Definability aspects of the Denjoy integral
• Title not available (Why is that?)
• Title not available (Why is that?)
• EIGHTY YEARS OF FOUNDATIONAL STUDIES
• On the mathematical and foundational significance of the uncountable
• On Brouwer's continuity principle
• Analysis I
• The Use of Tagged Partitions in Elementary Real Analysis
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• Title not available (Why is that?)
• Excursions in the History of Mathematics
• The Infinite Dimensional Henstock Integral and Problems of Black-Scholes Expectation
• The strength of compactness in computability theory and nonstandard analysis
• Periodic points and subsystems of second-order arithmetic
• Effective discontinuity and a characterisation of the superjump

Cited In (9)

• Nets and reverse mathematics
• The Galvin-Prikry theorem and set existence axioms
• Representations and the foundations of mathematics
• Splittings and robustness for the Heine-Borel theorem
• Lifting proofs from countable to uncountable mathematics
• Connecting real and hyperarithmetical analysis
• Countable sets versus sets that are countable in reverse mathematics
• Reverse mathematics of topology: dimension, paracompactness, and splittings
• Pincherle's theorem in reverse mathematics and computability theory

This page was built for publication: Splittings and disjunctions in reverse mathematics

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