Complexity of well-ordered sets in an ordered abelian group
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)
In the reviewed paper, the authors explored the complexity of classes of countable well-ordered sets by paying special attention to certain sets that arise naturally in the class of ordered abelian groups. Specifically, their work is devoted to the study of the following problem: Given an ordinal \(\alpha\) and that an arbotrary set \(A\) is well-ordered, how hard is it to say that the order type of \(A\) is at least \(\alpha\)? They succeeded to particularly answer this question in a series of (mainly technical) results, including Theorems 3.1 and 3.3 as well as Theorems 4.1, 4.2 and 4.21, respectively.
- \(\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)
