Countable Ordered Groups and Weihrauch Reducibility

2024/09/28 by Ang Li, Li, Ang
Computer Science · Mathematics · #03B30 #03D30 #03D78 #06F15 #Advanced Algebra and Logic #Advanced Topology and Set Theory #FOS: Mathematics #Group Theory (math.GR) #Logic (math.LO) #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.2409.19229

openalex publication_date 2024/09/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the theorem is equivalent to Π₁¹-CA₀, the strongest of the big five subsystems of second order arithmetic. We show that the strength of the theorem comes from having a dense linear order without endpoints in its order type. Then, we show that for the related Weihrauch problem to be strong enough to be equivalent to \mathsfWF (the analog problem of Π₁¹-CA₀), an order-preserving function is necessary in the output. Without the order-preserving function, the problems are very much to the side compared to analog problems of the big five.

Related

• The weakness of finding descending sequences in ill-founded linear orders
• The uniform content of partial and linear orders
• Countable sets versus sets that are countable in Reverse Mathematics
• Weihrauch reducibility between Ramsey-type theorems and well-ordering principles at the level of Σ⁰₂-induction: A pilot study
• Proof Theory and Ordered Groups