_1¹-CA₀ and order types of countable ordered groups
\(\Pi 1^1\)-CA\( 0\) and order types of countable ordered groups
The author deals with the classification problem of all admissible order types for orderable groups from the point of view of the Friedman-Simpson program of reverse mathematics [cf. \textit{S. G. Simpson}, ``Reverse mathematics, Proc. Symp. Pure Math. 42, 461-471 (1985; Zbl 0578.03005), Subsystems of second order arithmetic, Springer, Berlin-Heidelberg (1999; Zbl 0909.03048)]. It is well known that in the abelian case a basic tool is the classical theorem of Hölder (stating that every archimedean ordered group is isomorphic to a subgroup of the additive ordered group of the reals), which can be proven in the weakest system of reverse mathematics, namely recursive analysis \(\text{RCA}_0\) [cf. \textit{R. Solomon}, ``Ordered groups: a case study in reverse mathematics, Bull. Symb. Log. 5, No.~1, 45-58 (1999; Zbl 0922.03078)]. In the case of countable ordered groups, the fundamental classification theorem is due to Mal'tsev: if \(G\) is a countable ordered group, then the order type of \(G\) has the form \(Z^\alpha Q^\varepsilon\), for some wellorder \(\alpha\) and \(\varepsilon \in \{0,1\}\) (where \(Z\) is the additive group of the integers and \(Q\) the field of the rationals). The main content of this paper is the proof that Mal'tsev 's theorem is indeed much stronger, and in fact equivalent with the strongest subsystem investigated so far in reverse mathematics, namely \(\Pi ^1_1\text{-CA}_0\). Therefore, Mal'tsev's theorem is not predicatively reducible (e.g. provable in the system based on arithmetical transfinite recursion \(\text{ATR}_0\)). We recall that \(\Pi ^1_1\text{-CA}_0\) is based on the schema postulating the existence of a set of natural numbers in correspondence to arbitrary formulas of the form \(\forall X A(X,u)\), \(A\) being first order (no set quantifier). The result should be especially appreciated, since, as the reader can check from Simpson's book, the number of known equivalences of mathematical results with the subsystem \(\Pi ^1_1\text{-CA}_0\) is rather meager in comparison with systems like \(\text{ATR}_0\) or \(\text{WKL}_0\).
- Ordering free products in reverse mathematics
- scientific article; zbMATH DE number 2236636
- Ordered Groups: A Case Study in Reverse Mathematics
- Reverse Mathematics and Ordinal Multiplication
- scientific article; zbMATH DE number 3924748
- Invariants, Boolean algebras and ACA₀⁺
- scientific article; zbMATH DE number 2236630
- scientific article; zbMATH DE number 2236637
- Ranked structures and arithmetic transfinite recursion
- Reverse mathematics and fully ordered groups
- Countable algebra and set existence axioms
- Degrees of orderings not isomorphic to recursive linear orderings
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- Ordered Groups: A Case Study in Reverse Mathematics
- Ordinal inequalities, transfinite induction, and reverse mathematics
- Set theory. An introduction to independence proofs
- Weak comparability of well orderings and reverse mathematics
- Ordering free products in reverse mathematics
- scientific article; zbMATH DE number 4152374 (Why is no real title available?)
- scientific article; zbMATH DE number 4156432 (Why is no real title available?)
- Infinite dimensional proper subspaces of computable vector spaces
- Ordered Groups: A Case Study in Reverse Mathematics
- Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)
- Reverse mathematics and fully ordered groups
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- Countable ordered groups and Weihrauch reducibility
- Algorithmic aspects of left-orderings of solvable Baumslag-Solitar groups via its dynamical realization
This page was built for publication: \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732274)
