Extensions of embeddings below computably enumerable degrees

DOI10.1090/S0002-9947-2012-05660-1zbMath1296.03021OpenAlexW1976891796MaRDI QIDQ2838113

Antonio Montalbán, Noam Greenberg, Andrew E. M. Lewis, Rodney G. Downey

Publication date: 8 July 2013

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-2012-05660-1

zbMATH Keywords

decidabilityextensions of embeddingsTuring degrees

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (3)

Joining up to the generalized high degrees ⋮ A note on the join property ⋮ Another note on the join property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of unsolvability: structure and theory
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• On the degrees less than 0'
• On degrees of unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Complementation in the Turing degrees
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• A minimal degree less than 0’
• Degree Structures: Local and Global Investigations
• Decidability and Invariant Classes for Degree Structures
• Pseudo Jump Operators. I: The R. E. Case
• Degrees joining to 0′
• The Theory of the Degrees below 0 ′
• The weak truth table degrees of recursively enumerable sets
• Countable initial segments of the degrees of unsolvability
• The strong anticupping property for recursively enumerable degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• On the Σ₂-theory of the upper semilattice of Turing degrees
• The minimal complementation property above 0′
• Extension of embeddings in the computably enumerable degrees

This page was built for publication: Extensions of embeddings below computably enumerable degrees