The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility

DOI10.2307/2275452zbMath0764.03014OpenAlexW1970784900MaRDI QIDQ4032885

Steffen Lempp, Manuel Lerman

Publication date: 1 April 1993

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275452

zbMATH Keywords

decidabilityTuring reducibilityTuring jumpr.e. degreesembedding of finite partial orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Degree Structures: Local and Global Investigations

Cites Work

• Unnamed Item
• A non-inversion theorem for the jump operator
• First-order theory of the degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• A limit on relative genericity in the recursively enumerable sets
• The undecidability of the recursively enumerable degrees
• On homogeneity and definability in the first-order theory of the Turing degrees
• Lattice embeddings into the recursively enumerable degrees. II
• Distributive Initial Segments of the Degrees of Unsolvability

This page was built for publication: The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility