ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355)

From MaRDI portal
Revision as of 14:21, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
scientific article

    Statements

    ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    computable linear ordering
    0 references
    successivity
    0 references
    spectra of relations
    0 references