On the bounded quasi‐degrees of c.e. sets (Q4928973): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Roland Sh. Omanadze / rank
Normal rank
 
Property / author
 
Property / author: Roland Sh. Omanadze / rank
 
Normal rank
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.1002/malq.201200101 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993810536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity properties of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(m\)-degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting theorems in recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: One class of partial sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded enumeration reducibility and its degree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper semilattice of recursively enumerable Q-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between certain reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: One strengthening of \(Q\)-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong enumeration reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3406680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere simple sets and the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity, speedable and levelable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: e- and s-degrees / rank
 
Normal rank

Latest revision as of 13:55, 6 July 2024

scientific article; zbMATH DE number 6177020
Language Label Description Also known as
English
On the bounded quasi‐degrees of c.e. sets
scientific article; zbMATH DE number 6177020

    Statements

    On the bounded quasi‐degrees of c.e. sets (English)
    0 references
    19 June 2013
    0 references
    0 references
    computably enumerable sets
    0 references
    nonspeedable sets
    0 references
    bQ-degrees
    0 references
    bs-degrees
    0 references
    be-degrees
    0 references
    e-degrees
    0 references
    0 references