On computable automorphisms of the rational numbers

DOI10.2307/2695118zbMath0990.03034OpenAlexW2148595559MaRDI QIDQ2758070

Andrey S. Morozov, John K. Truss

Publication date: 18 July 2002

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2695118

zbMATH Keywords

principal idealsidealsTuring degreesrecursive automorphisms of orderings on the rational numbers

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (8)

Definability of linear orders over negative equivalences ⋮ Computably separable models ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Negative dense linear orders ⋮ Structures of degrees of negative representations of linear orders ⋮ On computable presentations of some functional lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations and implicit definability

This page was built for publication: On computable automorphisms of the rational numbers