Parameter definability in the recursively enumerable degrees

Journal of Mathematical Logic 3 (01):37-65 (2003)
  Copy   BIBTEX

Abstract

The biinterpretability conjecture for the r.e. degrees asks whether, for each sufficiently large k, the [Formula: see text] relations on the r.e. degrees are uniformly definable from parameters. We solve a weaker version: for each k ≥ 7, the [Formula: see text] relations bounded from below by a nonzero degree are uniformly definable. As applications, we show that Low 1 is parameter definable, and we provide methods that lead to a new example of a ∅-definable ideal. Moreover, we prove that automorphisms restricted to intervals [d, 1], d ≠ 0, are [Formula: see text]. We also show that, for each c ≠ 0, can be interpreted in [0, c] without parameters.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

Direct and local definitions of the Turing jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
Henselian expansions of NIP fields.Franziska Jahnke - 2023 - Journal of Mathematical Logic 24 (2).
Definable V-topologies, Henselianity and NIP.Yatir Halevi, Assaf Hasson & Franziska Jahnke - 2019 - Journal of Mathematical Logic 20 (2):2050008.
Degrees of categoricity and treeable degrees.Barbara F. Csima & Dino Rossegger - 2023 - Journal of Mathematical Logic 24 (3).
Mass problems and hyperarithmeticity.Joshua A. Cole & Stephen G. Simpson - 2007 - Journal of Mathematical Logic 7 (2):125-143.
Plus ultra.Frank O. Wagner - 2015 - Journal of Mathematical Logic 15 (2):1550008.

Analytics

Added to PP
2012-09-02

Downloads
43 (#518,085)

6 months
3 (#1,470,822)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degree structures: Local and global investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.
On the definable ideal generated by the plus cupping c.e. degrees.Wei Wang & Decheng Ding - 2007 - Archive for Mathematical Logic 46 (3-4):321-346.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.

Add more citations

References found in this work

Model theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
[Introduction].Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):1.
A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.

View all 24 references / Add more references