THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/jsl.2022.44 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281963904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Δ 2 0 -copies of linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear orderings of low degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered linear orderings with no computable presentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Low Boolean Algebra is Isomorphic to a Recursive One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic year 1979--80, The University of Connecticut, USA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on the Jump of a Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts of linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders / 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: Computability on linear orderings enriched with predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitwise monotonic functions, sets, and degrees on computable domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on strongly \(\eta \)-representable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly \(\eta \)-representable degrees and limitwise monotonic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing <i>η</i> -representable degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:54, 29 August 2024

scientific article; zbMATH DE number 7827881
Language Label Description Also known as
English
THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
scientific article; zbMATH DE number 7827881

    Statements

    THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2024
    0 references
    0 references
    linear order
    0 references
    low Turing degree
    0 references
    \( \eta \)-representation
    0 references
    computable presentation
    0 references
    0 references