There exists a maximal 3-c.e. enumeration degree (Q2382237): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4513961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density results in the \(\Delta_2^0\) e-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Π<sub>2</sub><sup>0</sup> enumeration degrees are not dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degrees and the density problem / 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: Q3487329 / 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: Q3919704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / 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: Splitting properties of <i>n</i>-c.e. enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(n\)-rea enumeration degrees are dense / 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: Trial and error predicates and the solution to a problem of Mostowski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal degree less than 0’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursive unsolvability / rank
 
Normal rank

Latest revision as of 10:21, 27 June 2024

scientific article
Language Label Description Also known as
English
There exists a maximal 3-c.e. enumeration degree
scientific article

    Statements

    Identifiers