Complexity of well-ordered sets in an ordered abelian group

DOI10.1007/S00605-025-02079-WMaRDI QIDQ6879331zbMATH OpenFDO

Authors Chris Hall, J. F. Knight, Karen Lange

Publication date 2 January 2026

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00605-025-02079-W

zbMATH Keywords

abelian groupcomplexitywell-ordered set

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model-theoretic algebra (03C60) Model theory of ordered structures; o-minimality (03C64) Descriptive set theory (03E15) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Direct sums, direct products, etc. for abelian groups (20K25)

Cites work

• \(\Pi_{1}^{0}\) classes and orderable groups
• A construction for recursive linear orderings
• An interpolation theorem for denumerably long formulas
• Computable ordered abelian groups and fields
• Computable structures and the hyperarithmetical hierarchy
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Degrees of orders on torsion-free abelian groups
• Die Axiome der Quantität und die Lehre vom Maß.
• Factorization in generalized power series
• Fields of surreal numbers and exponentiation
• scientific article; zbMATH DE number 3677903 (Why is no real title available?)
• scientific article; zbMATH DE number 3587039 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Invariant sets in topology and logic
• Jumps of Orderings
• Lengths of developments in \(K((G))\)
• Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia
• On Ordered Division Rings
• Pairs of recursive structures
• Recursion theory and ordered groups
• Roots of polynomials in fields of generalized power series
• The complexity of promise problems with applications to public-key cryptography
• The computable dimension of ordered abelian groups
• The effective Borel hierarchy
• The isomorphism problem for computable Abelian _p-groups of bounded length
• The number of countable models
• The universality of formal power series fields.
• Well quasi-orderings and roots of polynomials in a Hahn field

This page was built for publication: Complexity of well-ordered sets in an ordered abelian group

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