Extensions of embeddings below computably enumerable degrees (Q2838113): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rodney G. Downey / rank
Normal rank
 
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong anticupping property for recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability: structure and theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo Jump Operators. I: The R. E. Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper semi-lattice of degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal complementation property above 0′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable initial segments of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak truth table degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and Invariant Classes for Degree Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ∀∃-theory of ℛ(≤,∨,∧) is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3232283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees joining to <b>0</b>′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal degree less than 0’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of the Degrees below <b>0</b> ′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Structures: Local and Global Investigations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementation in the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of embeddings in the computably enumerable degrees / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0002-9947-2012-05660-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976891796 / rank
 
Normal rank

Latest revision as of 09:50, 30 July 2024

scientific article
Language Label Description Also known as
English
Extensions of embeddings below computably enumerable degrees
scientific article

    Statements

    Extensions of embeddings below computably enumerable degrees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    Turing degrees
    0 references
    decidability
    0 references
    extensions of embeddings
    0 references
    0 references