The homogeneity conjecture

DOI10.1073/pnas.76.9.4218zbMath0412.03028OpenAlexW2057381252WikidataQ24561710 ScholiaQ24561710MaRDI QIDQ4198495

Richard A. Shore

Publication date: 1979

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.76.9.4218

zbMATH Keywords

Turing reducibilityrelative computabilityTuring degreeshomogeneity conjecturedegrees of unsolvabilityisomorphisms of cones of degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (7)

Definable degrees and automorphisms of 𝒟 ⋮ Initial segments of the degrees of size \(\aleph _ 1\) ⋮ Degree Structures: Local and Global Investigations ⋮ On homogeneity and definability in the first-order theory of the Turing degrees ⋮ Definability in the Recursively Enumerable Degrees ⋮ Forcing and reductibilities. II. Forcing in fragments of analysis ⋮ Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

This page was built for publication: The homogeneity conjecture