The following pages link to Computable shuffle sums of ordinals (Q938232):
Displaying 8 items.
- On a computable presentation of low linear orderings (Q669557) (← links)
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism (Q1936277) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Limitwise monotonic sequences and degree spectra of structures (Q2845476) (← links)
- Iterated effective embeddings of abelian p-groups (Q2941047) (← links)
- Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- Limitwise monotonic functions, sets, and degrees on computable domains (Q5190192) (← links)
