Ideals without minimal elements in Rogers semilattices (Q903180): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2709299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized computable universal numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of families of general recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable enumerations of families of general recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two existence theorems for computable numerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some examples of upper semilattices of computable enumerations / rank
 
Normal rank

Revision as of 06:30, 11 July 2024

scientific article
Language Label Description Also known as
English
Ideals without minimal elements in Rogers semilattices
scientific article

    Statements

    Ideals without minimal elements in Rogers semilattices (English)
    0 references
    0 references
    5 January 2016
    0 references
    minimal numbering
    0 references
    \(A\)-computable numbering
    0 references
    Rogers semilattice
    0 references
    ideal
    0 references

    Identifiers