Pages that link to "Item:Q3800020"
From MaRDI portal
The following pages link to On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders (Q3800020):
Displayed 14 items.
- Linear orderings of low degree (Q610306) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- The Kierstead's conjecture and limitwise monotonic functions (Q1709678) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Computable presentability of countable linear orders (Q2036473) (← 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)
- Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- On computable self-embeddings of computable linear orderings (Q3655260) (← links)
- Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
- On Kierstead’s conjecture (Q5227998) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)