Maxim V. Zubkov

According to our database, Maxim V. Zubkov authored at least 6 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

The Simplest low linear order with no Computable Copies.

Andrey N. Frolov, Maxim V. Zubkov

J. Symb. Log., 2024

2023

Complexity of Σ⁰_n-classifications for definable subsets.

Svetlana Aleksandrova, Nikolay Bazhenov, Maxim V. Zubkov

Arch. Math. Log., 2023

2022

On bi-embeddable categoricity of algebraic structures.

Nikolay Bazhenov, Dino Rossegger, Maxim V. Zubkov

Ann. Pure Appl. Log., 2022

Well-Orders Realized by C.E. Equivalence Relations.

Nikolay Bazhenov, Maxim V. Zubkov

Proceedings of the Revolutions and Revelations in Computability, 2022

2018

The Kierstead's Conjecture and limitwise monotonic functions.

Guohua Wu, Maxim V. Zubkov

Ann. Pure Appl. Log., 2018

2009

Increasing <i>eta</i>-representable degrees.

Andrey N. Frolov, Maxim V. Zubkov

Math. Log. Q., 2009