Pages that link to "Item:Q810503"

The following pages link to Degrees of orderings not isomorphic to recursive linear orderings (Q810503):

Displaying 32 items.

• Linear orderings of low degree (Q610306) (← links)
• On a computable presentation of low linear orderings (Q669557) (← links)
• Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
• On the jumps of the degrees below a recursively enumerable degree (Q1704085) (← links)
• Degree spectra of real closed fields (Q1734266) (← links)
• Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
• Degree spectra of structures (Q2036471) (← links)
• Computable presentability of countable linear orders (Q2036473) (← links)
• Punctual copies of algebraic structures (Q2186304) (← links)
• Scattered linear orderings with no computable presentation (Q2263069) (← links)
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
• A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation (Q2439398) (← links)
• – <i>CA</i>₀ and order types of countable ordered groups (Q2732274) (← links)
• The -spectrum of a linear order (Q2747698) (← links)
• Some Questions in Computable Mathematics (Q2973717) (← links)
• Computability of Fraïssé limits (Q3083128) (← links)
• ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355) (← links)
• Jumps of Orderings (Q3484823) (← links)
• On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
• <i>d</i>-computable categoricity for algebraic fields (Q3655259) (← links)
• On computable self-embeddings of computable linear orderings (Q3655260) (← links)
• Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
• Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310) (← links)
• Boolean algebras, Stone spaces, and the iterated Turing jump (Q4323032) (← links)
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
• Jump degrees of torsion-free abelian groups (Q4899162) (← links)
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 (Q5305554) (← links)
• Up to equimorphism, hyperarithmetic is recursive (Q5718664) (← links)
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS (Q5738187) (← links)
• A class of low linear orders having computable presentations (Q6072990) (← links)
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)