Pages that link to "Item:Q3655260"
From MaRDI portal
The following pages link to On computable self-embeddings of computable linear orderings (Q3655260):
Displaying 11 items.
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains (Q1673673) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- On self-embeddings of computable linear orderings (Q2576940) (← links)
- Prime models of theories of computable linear orderings (Q2723507) (← links)
- Low linear orderings (Q2907053) (← links)
- Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Decidable discrete linear orders (Q3807188) (← links)