Countable ordered groups and Weihrauch reducibility

DOI10.1016/J.APAL.2025.103644MaRDI QIDQ6912201zbMATH OpenFDO

Authors Ang Li

Publication date 23 October 2025

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

Full work available at URL https://doi.org/10.1016/J.APAL.2025.103644

zbMATH Keywords

computable analysiscountable ordered groupsMaltsev's theoremreverse mathematicsWeihrauch degrees

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78) Ordered groups (06F15)

Cites work

• \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
• Algebraic properties of the first-order part of a problem
• Closed choice and a uniform low basis theorem
• How incomputable is the separable Hahn-Banach theorem?
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3057901 (Why is no real title available?)
• On the algebraic structure of Weihrauch degrees
• On the first-order parts of problems in the Weihrauch degrees
• Recursive well-orderings
• Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
• Subsystems of second order arithmetic
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Weihrauch Complexity in Computable Analysis

This page was built for publication: Countable ordered groups and Weihrauch reducibility

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