Israel Journal of Mathematics

, Volume 216, Issue 1, pp 371–387 | Cite as

Generic muchnik reducibility and presentations of fields

Article
  • 47 Downloads

Abstract

We prove that if I is a countable ideal in the Turing degrees, then the field RI of real numbers in I is computable from exactly the degrees that list the functions (i.e., elements of ωω) in I. This implies, for example, that the degree spectrum of the field of computable real numbers consists exactly of the high degrees. We also prove that if I is a countable Scott ideal, then it is strictly easier to list the sets (i.e., elements of 2ω) in I than it is to list the functions in I. This allows us to answer a question of Knight, Montalbán, and Schweber. They introduced generic Muchnik reducibility to extend the idea of Muchnik reducibility between countable structures to arbitrary structures. They asked if R is generically Muchnik reducible to the structure that consists of all sets of natural numbers. Our result for Scott ideals shows that this is not the case.

We finish by considering generic Muchnik reducibility of a countable structure A to an arbitrary structure B. We relate this to a couple of conditions asserting the ubiquity of countable elementary substructures of B that are Muchnik above A; we prove that one of these conditions is strictly stronger and the other is strictly weaker than generic Muchnik reducibility.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [IK]
    G. Igusa and J. Knight, Comparing two versions of the reals, Submitted.Google Scholar
  2. [IKS]
    G. Igusa, J. Knight and N. Schweber, Computing strength of structures related to the field of real numbers, In preparation.Google Scholar
  3. [Joc72]
    C. G. Jockusch, Degrees in which the recursive sets are uniformly recursive, Canad. J. Math. 24 (1972), 1092–1099.MathSciNetCrossRefMATHGoogle Scholar
  4. [KK]
    M. Korovina and O. Kudinov, Spectrum of the computable reals, Talk at “Continuity, computability, constructivity”, Ljubljana, September 2014.Google Scholar
  5. [KMS]
    J. Knight, A. Montalbán and N. Schweber, Computable structures in generic extensions, To appear in the Journal of Symbolic Logic.Google Scholar
  6. [Muč63]
    A. A. Mučnik, On strong and weak reducibility of algorithmic problems, Sibirsk. Mat. Z. 4 (1963), 1328–1341.MathSciNetGoogle Scholar
  7. [Sho61]
    J. R. Shoenfield, The problem of predicativity, in Essays on the Foundations of Mathematics, Magnes Press, Hebrew University of Jerusalem, 1961, pp. 132–139.Google Scholar

Copyright information

© Hebrew University of Jerusalem 2016

Authors and Affiliations

  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria University of WellingtonWellingtonNew Zealand
  2. 2.Department of MathematicsUniversity of Wisconsin MadisonWisconsinUSA

Personalised recommendations