Pages that link to "Item:Q3655260"
From MaRDI portal
The following pages link to On computable self-embeddings of computable linear orderings (Q3655260):
Displayed 5 items.
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains (Q1673673) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← 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)