On restricted forms of enumeration reducibility (Q1814011): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/0168-0072(90)90051-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082068214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility and Completeness for Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of quasi-minimal enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal pairs of enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Degrees of Partial Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: e- and s-degrees / rank
 
Normal rank

Latest revision as of 08:31, 15 May 2024

scientific article
Language Label Description Also known as
English
On restricted forms of enumeration reducibility
scientific article

    Statements

    On restricted forms of enumeration reducibility (English)
    0 references
    0 references
    25 June 1992
    0 references
    \(e\)-reducibility is studied in recursion theory. It was introduced in the early 50's but many questions on the structure of \(e\)-degrees remained open up to now. The author considers relations between \(e\)-degrees and degrees based on restricted forms of \(e\)-reducibility. The old result of S. Zakharov is reproved and a few new results are obtained.
    0 references
    \(e\)-degrees
    0 references
    \(e\)-reducibility
    0 references

    Identifiers