Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Zubkov, Maxim Vital'evich

Statistics Math-Net.Ru
Total publications: 9
Scientific articles: 9
Presentations: 5

Number of views:
This page:948
Abstract pages:2009
Full texts:742
References:357
Birth date: 31.08.1984
E-mail: ,

https://www.mathnet.ru/eng/person40447
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru Citations
2023
1. N. Bazhenov, B. Kalmurzayev, M. Zubkov, “A note on joins and meets for positive linear preorders”, Sib. Èlektron. Mat. Izv., 20:1 (2023),  1–16  mathnet
2022
2. M. V. Zubkov, “A class of low linear orders having computable presentations”, Algebra Logika, 61:5 (2022),  552–570  mathnet
2020
3. M. V. Zubkov, A. N. Frolov, “Spectral universality of linear orders with one binary relation”, Sibirsk. Mat. Zh., 61:3 (2020),  587–593  mathnet  elib; Siberian Math. J., 61:3 (2020), 463–467  isi  scopus 1
2019
4. M. V. Zubkov, I. Sh. Kalimullin, A. G. Mel'nikov, A. N. Frolov, “Punctual copies of algebraic structures”, Sibirsk. Mat. Zh., 60:6 (2019),  1271–1285  mathnet  elib; Siberian Math. J., 60:6 (2019), 993–1002  isi  scopus 4
2018
5. M. V. Zubkov, A. N. Frolov, “Computable linear orders and limitwise monotonic functions”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018),  70–105  mathnet  mathscinet; J. Math. Sci. (N. Y.), 256:1 (2021), 61–95 3
2017
6. M. V. Zubkov, “Sufficient conditions for the existence of $\mathbf0'$-limitwise monotonic functions for computable $\eta$-like linear orders”, Sibirsk. Mat. Zh., 58:1 (2017),  107–121  mathnet  elib; Siberian Math. J., 58:1 (2017), 80–90  isi  elib  scopus 8
2011
7. M. V. Zubkov, “Strongly $\eta$-representable degrees and limitwise monotonic functions”, Algebra Logika, 50:4 (2011),  504–520  mathnet  mathscinet  zmath; Algebra and Logic, 50:4 (2011), 346–356  isi  scopus 4
2009
8. M. V. Zubkov, “Initial segments of computable linear orders with additional computable predicates”, Algebra Logika, 48:5 (2009),  564–579  mathnet  mathscinet  zmath; Algebra and Logic, 48:5 (2009), 321–329  isi  scopus 11
9. M. V. Zubkov, “One theorem about strongly $\eta$-representable sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 7,  77–81  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 53:7 (2009), 65–69 5

Presentations in Math-Net.Ru
1. Computable linearly ordered structures
M. V. Zubkov
Seminars "Proof Theory" and "Logic Online Seminar"
September 16, 2024 16:00   
2. Well-orders realized by CE equivalence relations
M. V. Zubkov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science»
November 7, 2022 16:00   
3. "Jump inversion" for linear orders
Maxim Zubkov
Fourth Workshop on Digitalization and Computable Models (WDCM-2022)
October 24, 2022 17:00   
4. On categoricity of linear orders
M. V. Zubkov

August 13, 2021 16:40
5. The join degree spectrum of successor and block relations on computable linear orders
M. V. Zubkov
Computable linear orders and linearly ordered structures
October 5, 2019

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024