The following pages link to M. V. Zubkov (Q431705):
Displaying 14 items.
- Initial segments of computable linear orders with additional computable predicates (Q431706) (← links)
- Strongly \(\eta \)-representable degrees and limitwise monotonic functions (Q695785) (← links)
- A theorem on strongly \(\eta \)-representable sets (Q735995) (← links)
- (Q1709677) (redirect page) (← links)
- The Kierstead's conjecture and limitwise monotonic functions (Q1709678) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- Well-orders realized by C.E. equivalence relations (Q2104248) (← links)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets (Q2700822) (← links)
- On Kierstead’s conjecture (Q5227998) (← links)
- Punctual 1-linear orders (Q6059288) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)
- A note on joins and meets for positive linear preorders (Q6587349) (← links)
