Interpretability and Definability in the Recursively Enumerable Degrees
From MaRDI portal
Publication:3839947
DOI10.1112/S002461159800046XzbMath0904.03028OpenAlexW1988158368WikidataQ56430702 ScholiaQ56430702MaRDI QIDQ3839947
Richard A. Shore, André Nies, Theodore A. Slaman
Publication date: 11 August 1998
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s002461159800046x
definabilitytrue arithmeticbi-interpretabilityrecursively enumerable degreesjump classeshomogeneity failuresr.e.\ degrees
Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES, Extensions of two constructions of Ahmad, A join theorem for the computably enumerable degrees, The ∀∃-theory of ℛ(≤,∨,∧) is undecidable, THE TURING DEGREES BELOW GENERICS AND RANDOMS, Degrees of Unsolvability: A Tutorial, Coding in the partial order of enumerable sets, The theory of ceers computes true arithmetic, Unnamed Item, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, On the jumps of the degrees below a recursively enumerable degree, A Rigid Cone in the Truth-Table Degrees with Jump, MASS PROBLEMS AND HYPERARITHMETICITY, TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES, DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP, The \(\omega\)-Turing degrees, Interpreting true arithmetic in the local structure of the enumeration degrees, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Interpreting true arithmetic in the -enumeration degrees, Definability in the Local Theory of the ω-Enumeration Degrees, Embedding and coding below a 1-generic degree, Differences between resource bounded degree structures, Turing computability: structural theory, The Role of True Finiteness in the Admissible Recursively Enumerable Degrees, On the definable ideal generated by nonbounding c.e. degrees, Elementary differences among jump classes, Hierarchy of Computably Enumerable Degrees II, Coding true arithmetic in the Medvedev and Muchnik degrees, The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees, THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES, Mass problems associated with effectively closed sets, Degree Structures: Local and Global Investigations, Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees, Computably enumerable sets and quasi-reducibility, Definability via Kalimullin pairs in the structure of the enumeration degrees, Undecidability and 1-types in intervals of the computably enumerable degrees, The existence of high nonbounding degrees in the difference hierarchy, CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES, Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$
