M. V. Zubkov

Available identifiers

Publication	Date of Publication	Type
A note on joins and meets for positive linear preorders	2024-08-14	Paper
THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES	2024-04-05	Paper
Punctual 1-linear orders	2023-11-02	Paper
A class of low linear orders having computable presentations	2023-09-15	Paper
Complexity of \(\Sigma^0_n\)-classifications for definable subsets	2023-04-27	Paper
Well-orders realized by C.E. equivalence relations	2022-12-07	Paper
On bi-embeddable categoricity of algebraic structures	2022-01-18	Paper
On Kierstead’s conjecture	2019-08-07	Paper
The Kierstead's conjecture and limitwise monotonic functions	2018-04-06	Paper
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders	2017-06-30	Paper
Strongly \(\eta \)-representable degrees and limitwise monotonic functions	2012-12-17	Paper
Initial segments of computable linear orders with additional computable predicates	2012-06-29	Paper
A theorem on strongly \(\eta \)-representable sets	2009-10-26	Paper

This page was built for person: M. V. Zubkov