Skip to main content
SpringerLink
Log in

A jump inversion theorem for the enumeration jump

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract. We prove a jump inversion theorem for the enumeration jump and a minimal pair type theorem for the enumeration reducibilty. As an application some results of Selman, Case and Ash are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Sofia University, Blvd. “James Bourchier” 5, 1164 Sofia, Bulgaria (soskov@fmi.uni-sofia.bg) , , , , , , BG

    I.N. Soskov

Authors
  1. I.N. Soskov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 15 May 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Soskov, I. A jump inversion theorem for the enumeration jump. Arch Math Logic 39, 417–437 (2000). https://doi.org/10.1007/s001530050156

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050156

Search

Navigation