Universal computable enumerations of finite classes of families of total functions (Q2363401): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q2709299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary Theories for Rogers Semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized computable universal numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of classes of families and \(n\)-low degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumeration spectrum hierarchy of<i>n</i>-families / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3103/s1066369x16120112 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2550303746 / rank
 
Normal rank

Latest revision as of 12:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Universal computable enumerations of finite classes of families of total functions
scientific article

    Statements

    Universal computable enumerations of finite classes of families of total functions (English)
    0 references
    19 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    computable enumeration
    0 references
    universal enumeration
    0 references
    class of families
    0 references
    arithmetical enumeration
    0 references
    0 references