Pages that link to "Item:Q3094355"
From MaRDI portal
The following pages link to ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355):
Displaying 6 items.
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Codings on linear orders and algorithmic independence of natural relations (Q2263111) (← links)
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation (Q2439398) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (Q4596667) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
