Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-08T07:46:03.113Z Has data issue: false hasContentIssue false

Definability and elementary equivalence in the Ershov difference hierarchy

Published online by Cambridge University Press:  28 January 2010

S. Barry Cooper
Affiliation:
University of Leeds
Herman Geuvers
Affiliation:
Radboud Universiteit Nijmegen
Anand Pillay
Affiliation:
University of Leeds
Jouko Väänänen
Affiliation:
University of Amsterdam and University of Helsinki
Get access

Summary

Abstract. In this paper we investigate questions of definability and elementary equivalence in the Ershov difference hierarchy. We give a survey of recent results in this area and discuss a number of related open questions. Finally, properties of reducibilities which are intermediate between Turing and truth table reducibilities and which are connected with infinite levels of the Ershov hierarchy are studied.

Introduction. In this paper we consider the current status of a number of open questions concerning the structural organization of classes of Turing degrees below 0′, the degree of the Halting Problem. We denote the set of all such degrees by D(0_).

The Ershov hierarchy arranges these degrees into different levels which are determined by a quantitative characteristic of the complexity of algorithmic recognition of the sets composing these degrees.

The finite level n, n ≥ 1, of the Ershov hierarchy constitutes n-c.e. sets which can be presented in a canonical form as

A (Turing) degree a is called an n-c.e. degree if it contains an n- c.e. set, and it is called a properly n-c.e. degree if it contains an n-c.e. set but no (n – 1)-c.e. sets. We denote by Dn the set of all n- c.e. degrees. R denotes the set of c.e. degrees.

Degrees containing sets from different levels of the Ershov hierarchy, in particular the c.e. degrees, are the most important representatives of D(≤ 0′). Investigations of these degree structures pursued in last two-three decades show that the c.e. degrees and the degrees from finite levels of the Ershov hierarchy have similar properties in many respects.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×