On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets (Q2970980): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_34 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2559591727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cupping and noncapping in the r.e. weak truth table and turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pairs of computably enumerable sets in the computably Lipschitz degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees have infinitely many one-types / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ibT degrees of computably enumerable sets are not dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures of Some Strong Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal contiguous degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable Lipschitz degrees of computably enumerable sets are not dense / 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: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contiguity and distributivity in the enumerable Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural interactions of the recursively enumerable T- and W-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5469464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pairs of c.e. reals in the computably Lipschitz degrees / 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: The undecidability of the Π<sub>4</sub>-theory for the r.e. wtt and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random reals and Lipschitz continuity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Theory and Differential Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wtt-degrees and T-degrees of r.e. sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublattices of the Recursively Enumerable Degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:42, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets
scientific article

    Statements

    On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets (English)
    0 references
    0 references
    4 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references