Degree spectra of the successor relation of computable linear orderings (Q1005920): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00153-008-0110-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019414989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / 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: Q4451642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Linear Orders with Incomplete Successivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability of models / 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: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive isomorphism types of recursive Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively Categorical Linear Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank

Latest revision as of 04:23, 29 June 2024

scientific article
Language Label Description Also known as
English
Degree spectra of the successor relation of computable linear orderings
scientific article

    Statements

    Degree spectra of the successor relation of computable linear orderings (English)
    0 references
    0 references
    17 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    computably enumerable Turing degree
    0 references
    upper cone
    0 references
    degree spectrum
    0 references
    successor relation
    0 references
    computable linear ordering
    0 references
    0 references