The following pages link to Order-computable sets (Q2469429):
Displaying 16 items.
- Metric structures and probabilistic computation (Q541224) (← links)
- Computable shuffle sums of ordinals (Q938232) (← links)
- Weak presentations of computable ordered semigroups (Q1022232) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Orders of indescribable sets (Q2505504) (← links)
- Weak presentations of computable partial orderings (Q2784777) (← links)
- Limitwise monotonic sequences and degree spectra of structures (Q2845476) (← links)
- Iterated effective embeddings of abelian p-groups (Q2941047) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- The computability path ordering (Q3196359) (← links)
- The Settling Time Reducibility Ordering and Formula Sets (Q3611725) (← links)
- (Q4249724) (← links)
- Examples of semicomputable sets of real and complex numbers (Q4594263) (← links)
- Limitwise monotonic functions, sets, and degrees on computable domains (Q5190192) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
- <i>η</i>-representation of sets and degrees (Q5502806) (← links)