Uniform versions of some axioms of second order arithmetic
This paper is a contribution to \textit{Ulrich Kohlenbach}'s program [Ann. Pure Appl. Logic 114, 103--116 (2002; Zbl 1001.03052), and the paper to appear in the volume ``Reverse mathematics 2001\'\'] of lifting reverse mathematics from the context of second-order arithmetic, where it has been developed by S. G. Simpson and others [see \textit{S. G. Simpson}, Subsystems of second-order arithmetic. Berlin: Springer (1999; Zbl 0909.03048)], to higher-order arithmetic. Here the authors pursue the study of uniform versions of axioms and theorems of second-order arithmetic. The results support the observation that some of the well-known differences in the second-order case disappear in higher-order arithmetic. The authors show that the following statements are equivalent to the uniform version of weak König's lemma: the uniform version of weak weak König's lemma, two uniform versions of \(\Sigma^0_1\)-separation, the uniform version of the Bolzano-Weierstraß\ theorem, the uniform version of the Ramsey theorem (even for exponent \(1\), i.e.\ the pigeonhole principle), and the uniform versions of the existence of maximal and prime ideals of countable commutative rings. In second-order arithmetic some of these statements are equivalent to arithmetic comprehension (and thus much stronger than weak König's lemma), others are equivalent to weak König's lemma, some are properly weaker than weak König's lemma, and some are incomparable with it. Moreover, the authors prove the equivalence of the uniform versions of the existence of the kernel of a tree and of the existence of a perfect subtree of a tree with uncountably many paths. Again, these two consequences of the Cantor-Bendixson theorem are not equivalent in second-order arithmetic.
- scientific article; zbMATH DE number 3924748
- scientific article; zbMATH DE number 2019844
- scientific article; zbMATH DE number 2236636
- Minimal prime ideals and arithmetic comprehension
- Reverse mathematics, countable and uncountable
- Banach’s theorem in higher-order reverse mathematics
- The cohesive principle and the Bolzano-Weierstraß principle
- Set existence principles and closure conditions: unravelling the standard view of reverse mathematics
- A multi-sorted version of second order arithmetic
- Proof-theoretic investigations on Kruskal's theorem
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- Refining the taming of the reverse mathematics zoo
- Reverse mathematics and parameter-free transfer
- Reverse mathematics of topology: dimension, paracompactness, and splittings
- Reverse formalism 16
- Reverse mathematics of the uncountability of \(\mathbb{R}\)
- Splittings and robustness for the Heine-Borel theorem
- Representations and the foundations of mathematics
- Splittings and disjunctions in reverse mathematics
- Pincherle's theorem in reverse mathematics and computability theory
- The strength of compactness in computability theory and nonstandard analysis
- Lifting proofs from countable to uncountable mathematics
- Non-principal ultrafilters, program extraction and higher-order reverse mathematics
- Effective Choice and Boundedness Principles in Computable Analysis
- Open questions in reverse mathematics
- Transfinite recursion in higher reverse mathematics
- scientific article; zbMATH DE number 6983478 (Why is no real title available?)
- Nets and reverse mathematics
- The computational content of nonstandard analysis
- Countable sets versus sets that are countable in reverse mathematics
- On the uncountability of \(\mathbb{R}\)
- Computability theory, nonstandard analysis, and their connections
- On the mathematical and foundational significance of the uncountable
- Classical provability of uniform versions and intuitionistic provability
- A note on the sequential version of ^1_2 statements
- Banach’s theorem in higher-order reverse mathematics
- The Dirac delta function in two settings of reverse mathematics
- On the logical and computational properties of the Vitali covering theorem
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- A note on continuous functions on metric spaces
- Connecting real and hyperarithmetical analysis
- Big in reverse mathematics: measure and category
- The biggest five of reverse mathematics
- Sometimes tame, sometimes wild: weak continuity
- Big in reverse mathematics: the uncountability of the reals
- Approximation theorems throughout reverse mathematics
This page was built for publication: Uniform versions of some axioms of second order arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159415)
