ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Rodney G. Downey / rank
Normal rank
 
Property / author
 
Property / author: Guohua Wu / rank
Normal rank
 
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / author
 
Property / author: Guohua Wu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction for recursive linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree spectra of the successor relation of computable linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every recursive Boolean algebra is isomorphic to one with incomplete atoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computable self-embeddings of computable linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some effects of Ash-Nerode and other decidability conditions on degree spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncountable degree spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The possible Turing degree of the nonzero member in a two element degree spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Spectra of Relations on Computable Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree spectra and computable dimensions in algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of orderings not isomorphic to recursive linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees coded in jumps of orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Intrinsically Recursive in Linear Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The -spectrum of a linear order / rank
 
Normal rank

Latest revision as of 14:21, 4 July 2024

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