THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES (Q2909622): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Downey's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The d.r.e. degrees are not dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability: structure and theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hierarchy of sets. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive Initial Segments of the Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretability and Definability in the Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Structures: Local and Global Investigations / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order theory of the degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Σ<sub>1</sub>-Structural Differences Among Finite Levels of the Ershov Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank

Revision as of 16:17, 5 July 2024

scientific article
Language Label Description Also known as
English
THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES
scientific article

    Statements

    THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES (English)
    0 references
    0 references
    0 references
    0 references
    6 September 2012
    0 references
    0 references
    Turing degrees
    0 references
    \(n\)-recursively enumerable
    0 references
    undecidability
    0 references
    \(\Sigma_1\)-substructure
    0 references
    \(n\)-computably enumerable
    0 references