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: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
Automorphism groups of trivial strongly minimal structures.Thomas Blossier - 2003 - Journal of Symbolic Logic 68 (2):644-668.
Groups of finite Morley rank with transitive group automorphisms.Ali Nesin - 1989 - Journal of Symbolic Logic 54 (3):1080-1082.
Isomorphism types of maximal cofinitary groups.Bart Kastermans - 2009 - Bulletin of Symbolic Logic 15 (3):300-319.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Notes on symmetries.Gordon Belot - 2003 - In Katherine A. Brading & Elena Castellani (eds.), Symmetries in Physics: Philosophical Reflections. Cambridge University Press. pp. 393--412.
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.

Analytics

Added to PP
2009-01-28

Downloads
57 (#274,471)

6 months
9 (#298,039)

Historical graph of downloads
How can I increase my downloads?