Maxim V. Zubkov

Orcid: 0000-0003-2429-5096

According to our database1, Maxim V. Zubkov authored at least 7 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
1
1
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On categoricity of scattered linear orders of constructive ranks.
Arch. Math. Log., February, 2025

2024
The Simplest low linear order with no Computable Copies.
J. Symb. Log., 2024

2023
Complexity of Σ<sup>0</sup><sub>n</sub>-classifications for definable subsets.
Arch. Math. Log., 2023

2022
On bi-embeddable categoricity of algebraic structures.
Ann. Pure Appl. Log., 2022

Well-Orders Realized by C.E. Equivalence Relations.
Proceedings of the Revolutions and Revelations in Computability, 2022

2018
The Kierstead's Conjecture and limitwise monotonic functions.
Ann. Pure Appl. Log., 2018

2009
Increasing <i>eta</i>-representable degrees.
Math. Log. Q., 2009


  Loading...