On Computable Automorphisms of the Rational Numbers

Journal of Symbolic Logic 66 (3):1458-1470 (2001)
  Copy   BIBTEX

Abstract

The relationship between ideals I of Turing degrees and groups of I-recursive automorphisms of the ordering on rationals is studied. We discuss the differences between such groups and the group of all automorphisms, prove that the isomorphism type of such a group completely defines the ideal I, and outline a general correspondence between principal ideals of Turing degrees and the first-order properties of such groups.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On computable automorphisms of the rational numbers.A. S. Morozov & J. K. Truss - 2001 - Journal of Symbolic Logic 66 (3):1458-1470.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
More on Generic Dimension Groups.Philip Scowcroft - 2015 - Notre Dame Journal of Formal Logic 56 (4):511-553.
Groups of finite Morley rank with transitive group automorphisms.Ali Nesin - 1989 - Journal of Symbolic Logic 54 (3):1080-1082.
Degrees of isomorphism types and countably categorical groups.Aleksander Ivanov - 2012 - Archive for Mathematical Logic 51 (1):93-98.
On computable numberings of families of Turing degrees.Marat Faizrahmanov - 2024 - Archive for Mathematical Logic 63 (5):609-622.

Analytics

Added to PP
2017-02-21

Downloads
3 (#1,729,833)

6 months
3 (#1,206,820)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references