Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Rybakov, Mikhail Nikolaevich

Total publications: 106 (102)
in MathSciNet: 38 (38)
in zbMATH: 43 (43)
in Web of Science: 27 (27)
in Scopus: 37 (37)
Cited articles: 30
Citations: 171
Presentations: 7

Number of views:
This page:5745
Abstract pages:1346
Full texts:729
References:183
Rybakov, Mikhail Nikolaevich
Associate professor
Candidate of physico-mathematical sciences (2005)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail:
Website: https://lms.tversu.ru/eportfolios/3636
Keywords: Logic, modal logics, superintuitionistic logics, non-classical logics, predicate logics, complexity, dcidability, Kripke semantics

Subject:

Logic


https://www.mathnet.ru/eng/person114672
https://scholar.google.com/citations?user=NsaMXlgAAAAJ&hl=en
https://zbmath.org/authors/?q=ai:rybakov.mikhail-nikolaevich
https://mathscinet.ams.org/mathscinet/MRAuthorID/685529
https://elibrary.ru/author_items.asp?spin=1408-9349
ISTINA https://istina.msu.ru/workers/223772131
https://orcid.org/0000-0002-1491-1310
https://publons.com/researcher/O-5806-2018
https://www.webofscience.com/wos/author/record/O-5806-2018
https://www.scopus.com/authid/detail.url?authorId=55114172200
https://www.researchgate.net/profile/Mikhail_Rybakov3
https://arxiv.org/a/rybakov_m_1

Full list of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)
1. M. Rybakov, D. Shkatov, “Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite frames”, Journal of Logic and Computation (to appear)  crossref  isi 1
2. M. Rybakov, D. Shkatov, “Variations on the Kripke trick”, Studia Logica (to appear)  crossref  isi  scopus
3. M. Rybakov, D. Shkatov, “Polytime embedding of intuitionistic modal logics into their one-variable fragments”, Journal of Logic and Computation (to appear)

   2024
4. M. Rybakov, “Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness”, Logic Journal of the IGPL, 32:3 (2024), 465–492  crossref  mathscinet  isi  scopus 2
5. M. Rybakov, D. Shkatov, D. Skvortsov, “On the system of positive slices in the structure of superintuitionistic predicate logics”, Advances in Modal Logic (Faculty of Arts of Charles University (Prague), 19–22 August 2024), 15, eds. Agata Ciabattoni, David Gabelaia, and Igor Sedlár, College Publications, 2024, 653–674
6. M. N. Rybakov, “Nerazreshimost logiki QLC v yazyke s dvumya predmetnymi peremennymi”, IV Konferentsiya matematicheskikh tsentrov Rossii. Sbornik tezisov (Sankt-Peterburg, 6–11 avgusta), 2024, 151–152

   2023
7. M. Rybakov, D. Shkatov, “Complexity function and complexity of validity of modal and superintuitionistic propositional logics”, Journal of Logic and Computation, 33:7 (2023), 1566–1595  crossref  mathscinet  zmath  isi  scopus 2
8. M. N. Rybakov, “Derevya kak sredstvo modelirovaniya nerazreshimykh problem”, Vestnik TvGU. Seriya: Prikladnaya matematika, 2023, no. 1, 5–23  mathnet  crossref  elib 1
9. M. N. Rybakov, “Binarnyi predikat, tranzitivnoe zamykanie, dve-tri peremennye: sygraem v domino?”, Logicheskie issledovaniya, 29:1 (2023), 114–146  crossref  mathscinet  zmath  elib  scopus
10. I. Agadzhanian, M. Rybakov, D. Shkatov, “Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames”, SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics (Moscow + Online, June 13–17, 2023), Steklov International Mathematical Center, Moscow, 2023, 16–19 https://scan2023.mi-ras.ru/abstracts.pdf  crossref  zmath  adsnasa  isi  scopus
11. M. Rybakov, D. Serova, “Tiling problems and complexity of logics”, SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics (Moscow + Online, June 13–17, 2023), Steklov International Mathematical Center, Moscow, 2023, 70–72 https://scan2023.mi-ras.ru/abstracts.pdf
12. M. Rybakov, D. Shkatov, “On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics”, SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics (Moscow + Online, June 13–17, 2023), Steklov International Mathematical Center, 2023, 73–76 https://scan2023.mi-ras.ru/abstracts.pdf  crossref  zmath  adsnasa  isi  scopus
13. M. N. Rybakov, D. P. Shkatov, “Tryuk Kripke i razreshimost monadicheskikh fragmentov modalnykh i superintuitsionistskikh predikatnykh logik”, Trinadtsatye Smirnovskie chteniya po logike, Materialy mezhdunarodnoi nauchnoi konferentsii (22–24 iyunya 2023g., Moskva), 2023, 40–44  crossref  zmath  adsnasa  scopus
14. M. Rybakov, D. Serova, Tiling problems and complexity of logics (extended version), 2023 (Published online) , 7 pp., arXiv: 2306.13736  crossref  zmath  adsnasa  isi  scopus
15. M. N. Rybakov, “Prostoi primer blokirovki argumenta Kreiga”, Logicheskie issledovaniya, 29:2 (2023), 36–58  crossref  mathscinet  zmath  scopus
16. M. N. Rybakov, “Rekursivnaya neotdelimost v modalnykh i superintuitsionistskikh predikatnykh logikakh”, Maltsevskie chteniya. Tezisy dokladov (Mezhdunarodnyi matematicheskii tsentr v Akademgorodke, 13–17 noyabrya 2023 goda), SO RAN, Novosibirsk, 2023, 16 http://old.math.nsc.ru/conference/malmeet/23/maltsev2023.pdf
17. M. N. Rybakov, “Rekursivnaya neotdelimost dlya klassicheskikh teorii binarnogo predikata i modalnykh logik unarnogo predikata”, Tretya konferentsiya Matematicheskikh tsentrov Rossii (Respublika Adygeya, g.Maikop, AGU, 10–15 oktyabrya 2023 goda), 2023 https://mc-conf.adygnet.ru/upload/math_logic.pdf
18. M. N. Rybakov, Dokl. RAN. Math. Inf. Proc. Upr., 512 (2023), 102  mathnet  crossref  elib

   2022
19. M. Rybakov, D. Shkatov, “Undecidability of the logic of partial quasiary predicates”, Logic Journal of the IGPL, 30:3 (2022), 519–533  crossref  mathscinet  zmath  isi  elib  scopus 2
20. M. Rybakov, “Computational complexity of the word problem in modal and pseudo-Boolean algebras with a small number of generators”, Russian Mathematics, 66:5 (2022), 33-48  mathnet  crossref  crossref  mathscinet  mathscinet  zmath  isi  elib  elib  scopus
21. M. Rybakov, D. Shkatov, “Complexity of finite-variable fragments of products with non-transitive modal logics”, Journal of Logic and Computation, 32:5 (2022), 853–870  crossref  mathscinet  zmath  isi  elib  scopus 6
22. M. Rybakov, D. Shkatov, “Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter”, Studia Logica, 110 (2022), 597–598  crossref  mathscinet  zmath  isi  elib  scopus
23. M. Rybakov, D. Shkatov, “Complexity of finite-variable fragments of propositional temporal and modal logics of computation”, Theoretical Computer Science, 925, 10 August 2022 (2022), 45–60  crossref  mathscinet  zmath  isi  elib  scopus 3
24. M. Rybakov, “Computational complexity of theories of a binary predicate with a small number of variables”, Doklady Mathematics, 106:3 (2022), 458–461  mathnet  crossref  crossref  mathscinet  mathscinet  zmath  isi  elib  elib  scopus
25. I. Agadzhanian, M. Rybakov, Complexity of the variable-free fragment of the weak Grzegorczyk logic, 2022 , 13 pp., arXiv: 2211.14571  crossref  zmath  adsnasa  scopus
26. M. N. Rybakov, “Undecidability of modal and superintuitionistic logics of a single unary predicate in languages with two variables”, Vtoraya konferentsiya Matematicheskikh tsentrov Rossii. Annotatsii dokladov (Moskva, MGU, MIAN, 7–11 noyabrya 2022 goda), 2022, 73–74 https://www.mathnet.ru/ConfLogos/2047/All_sections_-_Abstracts.pdf

   2021
27. M. Rybakov, D. Shkatov, “Complexity of finite-variable fragments of products with K”, Journal of Logic and Computation, 31:2 (2021), 426–443  crossref  mathscinet  zmath  isi  elib  scopus 10
28. M. Rybakov, D. Shkatov, “Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages”, Journal of Logic and Computation, 31:2 (2021), 494–522  crossref  mathscinet  zmath  isi  elib  scopus 11
29. M. N. Rybakov, “Geometriya, naglyadnost i sovremennye tekhnologii”, Perspektivy razvitiya matematicheskogo obrazovaniya v epokhu tsifrovoi transformatsii: materialy II Vserossiiskoi nauchno-prakticheskoi konferentsii (Tver, 25–27 marta 2021 goda), eds. Yu. V. Chemarina, A. A. Golubev, Izdatelstvo TvGU, Tver, 2021, 172–176  elib
30. M. Rybakov, D. Shkatov, “Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages”, Journal of Logic and Computation, 31:5, July 2021 (2021), 1266–1288  crossref  mathscinet  zmath  adsnasa  isi  scopus 8
31. M. Rybakov, D. Shkatov, “On relationship between complexity function and complexity of validity in propositional modal logic”, Logical Perspectives 2021 (Moscow, June 7 – July 8), 2021 http://lp2021.mi-ras.ru/contributed/workshop-rybakov-shkatov.pdf
32. M. Rybakov, D. Shkatov, “Algorithmic properties of QK4.3 and QS4.3”, Dvenadtsatye Smirnovskie chteniya. Materialy Mezhdunarodnoi nauchnoi konferentsii. (Moskva, 24–26 iyunya 2021 goda), eds. O. M. Grigorev, D. V. Zaitsev, Yu. V. Ivlev, V. I. Shalak, N. E. Tomova; otv.red. V. I. Markin, Russkoe obschestvo istorii i filosofii nauki, Moskva, 2021, 50–54  crossref  zmath  adsnasa  scopus
33. M. Rybakov, D. Shkatov, “Undecidability of QLTL and QCTL with two variables and one monadic predicate letter”, Logicheskie issledovaniya, 27:2 (2021), 93–120  crossref  mathscinet  zmath  elib  scopus 3
34. M. N. Rybakov, “Computational complexity of the word problem in modal algebras”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2021, no. 3, 5–17  mathnet  crossref  elib
35. M. N. Rybakov, D. P. Shkatov, “Nerazreshimost logik s unarnym predikatom i dvumya peremennymi”, Matematicheskie osnovy informatiki i informatsionno-kommunikatsionnykh tekhnologii. Sbornik trudov (TvGU, Tver, 3–8 dekabrya 2021 goda), RIU TvGU, 2021, 246–254  crossref  elib
36. K. Aleksandrov, M. Rybakov, D. Shkatov, Computational complexity of one-variable fragments of products with T, 2021 (Published online) , 10 pp., arXiv: 2112.03833  crossref  zmath  adsnasa  isi  scopus

   2020
37. A. P. Koryakov, I. B. Kostyukov, M. N. Rybakov, “Modelirovanie odnovremennogo perenosa zhidkosti i gaza: prakticheskii podkhod”, Programmnye produkty i sistemy, 33:1 (2020), 96–110  crossref  elib
38. M. N. Rybakov, “Element konstruktivnosti v matematicheskikh kursakh”, Perspektivy razvitiya matematicheskogo obrazovaniya v epokhu tsifrovoi transformatsii, Materialy Vserossiiskoi nauchno-prakticheskoi konferentsii (Tver, 27–28 marta 2020 goda), eds. Yu. V. Chemarina, A. A. Golubev, Redaktsionno-izdatelskoe upravlenie Tverskogo gosudarstvennogo universiteta, Tver, 2020, 176–180 http://math.tversu.ru/websites/4/documents/5456/  elib
39. M. Rybakov, D. Shkatov, “Recursive enumerability and elementary frame definability in predicate modal logic”, Journal of Logic and Computation, 30:2, March 2020 (2020), 549–560  crossref  mathscinet  zmath  adsnasa  isi  elib  scopus 8
40. M. Rybakov, D. Shkatov, “Computational properties of the logic of partial quasiary predicates”, Conference of the South African Institute of Computer Scientists and Information Technologists 2020 (SAICSIT 20) (September 14–16, 2020, Cape Town, South Africa), ACM, New York, NY, USA, 8 Pages, 2020, 58–65  crossref  isi  elib  scopus 1
41. M. Rybakov, D. Shkatov, “Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages”, Published: 26 August 2020, Journal of Logic and Computation, 30:7, October 2020 (2020), 1305–1329  crossref  mathscinet  zmath  isi  scopus 14
42. M. Rybakov, D. Shkatov, “Algorithmic properties of first-order modal logics of the natural number line in restricted languages”, Advances in Modal Logic, 978-1-84890-341-8 (Helsinki, August 24–28), July 2020, 13, eds. Nicola Olivetti, Rineke Verbrugge, Sara Negri and Gabriel Sandu, College Publications, 2020, 523–539  mathscinet  zmath  scopus

   2019
43. M. Rybakov, D. Shkatov, “Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter”, Studia Logica, 107:4 (2019), 695–717 , arXiv: 1706.05060  crossref  mathscinet  zmath  adsnasa  isi  elib  scopus 24
44. M. N. Rybakov, D. P. Shkatov, “Suschestvovanie rekursivno perechislimoi polnoi po Kripke normalnoi modalnoi predikatnoi logiki, kotoraya ne polna otnositelno pervoporyadkovo opredelimykh klassov shkal”, Odinnadtsatye Smirnovskie chteniya po logike (Moskva, 19–21 iyunya 2019 goda), Sovremennye tetradi, Moskva, 2019, 43–45
45. M. N. Rybakov, “Matematicheskoe obrazovanie: rekursivnaya mozaika”, Perspektivy razvitiya matematicheskogo obrazovaniya v Tveri i Tverskoi oblasti. Materialy III Vserossiiskoi nauchno-prakticheskoi konferentsii (Tver, 29–30 marta 2019 goda), Izdatelstvo TvGU, 2019, 174–176  elib
46. M. Rybakov, Algorithmic properties of modal logics with restricted languages, PhD thesis, University of the Witwatersrand, Johannesburg, 2019 , 88 pp. http://wiredspace.wits.ac.za/handle/10539/27933
47. M. Rybakov, D. Shkatov, “Complexity of finite-variable fragments of propositional modal logics of symmetric frames”, Logic Journal of the IGPL, 27:1 (2019), 60–68  crossref  mathscinet  zmath  adsnasa  isi  elib  scopus 5
48. M. Rybakov, D. Shkatov, “Trakhtenbrot theorem for classical languages with three individual variables”, Proceedings of the South African Institute of Computer Scientists and Information Technologists 2019 (SAICSIT19) (Skukuza, South Africa, September 17–18, 2019), ACM, New York, NY, USA, 2019  crossref  elib  scopus 4

   2018
49. M. N. Rybakov, “Axiomatizability of non-normal and quasi-normal modal predicate logics of first-order definable classes of Kripke frames”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2018, no. 3, 81–94  mathnet  crossref  elib
50. M. N. Rybakov, “Algorithmical properties of quasinormal modal logics with linear finite model property”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2018, no. 4, 87–97  mathnet  crossref  elib
51. M. N. Rybakov, L. A. Chagrova, “Algoritmicheskaya nerazreshimost problemy pervoporyadkovoi opredelimosti formul logiki vetvyaschegosya vremeni”, Programmnye produkty i sistemy, 31:3 (2018), 591–597  crossref  isi  elib
52. M. Rybakov, D. Shkatov, “Complexity and expressivity of propositional dynamic logics with finitely many variables”, Logic Journal of the IGPL, 26:5 (2018), 539–547 , arXiv: 1901.06407  crossref  mathscinet  zmath  adsnasa  isi  scopus 18
53. M. Rybakov, D. Shkatov, “A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames”, Advances in Modal Logic, 12, eds. Guram Bezhanishvili, Giovanna D’Agostino, George Metcalfe, and Thomas Studer, College Publications, 2018, 531–540  mathscinet  zmath  elib  scopus
54. M. Rybakov, D. Shkatov, “Complexity and expressivity of Branching- and Alternating-time temporal logics with finitely many variables”, Lecture Notes in Computer Science, 11187, eds. B. Fischer, T. Uustalu, Springer-Verlag GmbH, 2018, 396–414 , arXiv: 1810.09142  crossref  mathscinet  zmath  adsnasa  isi  elib  scopus 9
55. M. Rybakov, D. Shkatov, “On complexity of propositional linear-time temporal logic with finitely many variables”, Proceedings of SAICSIT18 (South Africa, Port Elizabeth, 26–28 September 2018), eds. J. van Niekerk, B. Haskins, ACM, 2018, 313–316 , arXiv: 1706.04108  crossref  adsnasa  isi  elib  scopus 2
56. M. N. Rybakov, Yu. V. Chemarina, D. P. Shkatov, “Modeli vremeni i matematicheskoe obrazovanie”, Perspektivy razvitiya matematicheskogo obrazovaniya v Tveri i Tverskoi oblasti. Materialy Vtoroi Vserossiiskoi nauchno-prakticheskoi konferentsii (Tver, 21 aprelya 2018 goda), Izdatelstvo TvGU, 2018, 173–178  elib

   2017
57. M. N. Rybakov, “Nerazreshimost modalnykh logik odnomestnogo predikata”, Logicheskie issledovaniya, 23:2 (2017), 60–75  crossref  mathscinet  zmath  elib  scopus 2
58. M. N. Rybakov, “Obrazovanie i tvorchestvo”, Perspektivy razvitiya matematicheskogo obrazovaniya v Tveri i Tverskoi oblasti. Vypusk I, chast II. Materialy nauchno-prakticheskoi konferentsii (Tver, 18 fevralya 2017 goda), Izdatelstvo TvGU, Tver, 2017, 79–82  elib
59. M. N. Rybakov, “Nerazreshimost modalnykh predikatnykh logik v yazyke s odnoi odnomestnoi bukvoi”, Desyatye Smirnovskie chteniya po logike (Moskva, 15–17 iyunya 2017 goda), Sovremennye tetradi, Moskva, 2017, 41–43  elib
60. M. N. Rybakov, E. A. Kotikova, “Algoritmicheskaya vyrazitelnost predikatnoi logiki vetvyaschegosya vremeni v yazyke s odnoi odnomestnoi bukvoi”, Desyatye Smirnovskie chteniya po logike (Moskva, 15–17 iyunya 2017 goda), Sovremennye tetradi, Moskva, 2017, 43–44  elib
61. M. Rybakov, D. Shkatov, “On existence of recursively-enumerable Kripke-complete first-order modal logics that are not Kripke complete with respect to a first-order definable class of frames”, Desyatye Smirnovskie chteniya po logike (Moskva, 15–17 iyunya 2017 goda), Sovremennye tetradi, Moskva, 2017, 45  elib
62. P. Balbiani, M. Rybakov, “An axiomatization of iteration-free PDL with loop”, XII Tbilisi Symposium of Language, Logic and Computation (Lagodekhi, Georgia, 18–22 September, 2017), 2017, 49–53

   2016
63. E. A. Kotikova, M. N. Rybakov, “Modeling arithmetic in the first-order language enriched with temporal quantifiers”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2016, no. 4, 5–19  mathnet  crossref  elib
64. A. V. Dukhovneva, M. N. Rybakov, D. P. Shkatov, “Algoritmicheskaya vyrazitelnost nekotorykh fragmentov yazyka logiki vetvyaschegosya vremeni”, Programmnye produkty i sistemy, 29:4 (2016), 135–142  crossref  isi  elib
65. M. N. Rybakov, Sposoby obosnovaniya suschestvovaniya matematicheskikh ob'ektov. Uchebno-metodicheskoe posobie, Tver, Izdatelstvo TvGU, 2016
66. M. N. Rybakov, Otnosheniya, funktsii i operatsii nad nimi. Uchebno-metodicheskoe posobie, Tver, Izdatelstvo TvGU, 2016

   2015
67. E. A. Kotikova, M. N. Rybakov, “Kripke incompleteness of first-order calculi with temporal modalities of CTL and near logics”, Logicheskie issledovaniya, 21:1 (2015), 86–99  crossref  mathscinet  zmath  elib 1
68. M. N. Rybakov, “Pogruzhenie klassicheskoi logiki predikatov v logiku kvaziarnykh predikatov”, Devyatye Smirnovskie chteniya po logike (Moskva, 17–19 iyunya 2015 goda), eds. V. I. Markin, Sovremennye tetradi, Moskva, 2015, 33–34  elib
69. M. Rybakov, D. Shkatov, “Computational complexity of logics of nonterminating programs with restrictions on the number of propositional variables”, Devyatye Smirnovskie chteniya po logike (Moskva, 17–19 iyunya 2015 goda), eds. V. I. Markin, Sovremennye tetradi, Moskva, 2015, 34  elib

   2014
70. E. A. Kotikova, M. N. Rybakov, “Primer ispolzovaniya logiki kak shag v protsesse ee postizheniya”, Problemi vikladannya logiki ta perspektivi ¿¿ rozvitku. V² Mizhnarodna naukovo-praktichna konferentsiya (Ki¿vskii natsionalnii universitet imeni Tarasa Shevchenka, 15–16 travnya 2014 roku), VPTs «Ki¿vskii universitet», Ki¿v, 2014, 102–104
71. M. N. Rybakov, “Nerazreshimost logiki kvaziarnykh predikatov”, Vestnik TvGU. Seriya: Prikladnaya matematika, 2014, no. 4, 17–32  mathnet  elib

   2013
72. E. A. Kotikova, M. N. Rybakov, “First-Order Logics of Branching Time: On Expressive Power of Temporal Operators”, Logicheskie issledovaniya, 19 (2013), 68–99  crossref  mathscinet  zmath  elib 2

   2012
73. E. A. Kotikova, M. N. Rybakov, “Predikatnaya logika vetvyaschegosya vremeni QCTL: algoritmicheskie, semanticheskie i deduktivnye aspekty”, Otkrytyi Rossiisko-Finskii kollokvium po logike (Sankt-Peterburg, 14–16 iyunya 2012 goda), 2012

   2010
74. E. A. Kotikova, M. N. Rybakov, “Slozhnost problemy istinnosti konstantnykh modalnykh formul v modeli”, Sovremennaya logika: problemy teorii, istorii i primeneniya v nauke. Materialy XI Obscherossiiskoi nauchnoi konferentsii (Sankt-Peterburg, 23–26 iyunya 2010 goda), Izdatelstvo SPbGU, Sankt-Peterburg, 2010, 281–283  elib

   2009
75. M. N. Rybakov, “Slozhnost fragmentov logiki IPDL”, Shestye Smirnovskie chteniya po logike, Sovremennye tetradi, 2009, 34–35  elib

   2008
76. M. N. Rybakov, “Svoistva logik znaniya pri odnovremennom ispolzovanii operatora raspredelennogo znaniya i operatora vseobschego znaniya”, Sovremennaya logika: problemy teorii, istorii i primeneniya v nauke. Materialy X Obscherossiiskoi nauchnoi konferentsii (Sankt-Peterburg, 26–28 iyunya 2008 goda), Izdatelstvo SPbGU, 2008, 443–444  elib
77. M. N. Rybakov, “Complexity of intuitionistic propositional logic and its fragments”, Journal of Applied Non-Classical Logics, 18:2–3 (2008), 267–292  crossref  mathscinet  zmath  elib  scopus 15

   2007
78. M. N. Rybakov, “The complexity of the constant fragment of propositional dynamic logic”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2007, no. 5, 5–17  mathnet  elib
79. M. N. Rybakov, “Neklassicheskie logiki: ikh slozhnost i slozhnost ikh prilozhenii”, Filosofiya matematiki: aktualnye problemy. Materialy Mezhdunarodnoi nauchnoi konferentsii (Moskva, 15–16 iyunya 2007 goda), Izdatelstvo filosofskogo fakulteta MGU, Moskva, 2007, 123–125  elib
80. M. N. Rybakov, “K voprosu o polnote po Kripke predikatnykh logik”, Smirnovskie chteniya. Materialy 5-oi konferentsii (Moskva, 20–22 iyunya 2007 goda), eds. A. S. Karpenko, Izdatelstvo IF RAN, Moskva, 2007, 37–38  elib
81. M. N. Rybakov, “Complexity of finite-variable fragments of EXPTIME-complete logics”, Journal of Applied Non-Classical Logics, 17:3 (2007), 359–382  crossref  mathscinet  zmath  elib  scopus 10
82. I. A. Gorbunov, M. N. Rybakov, “Kontinualnye semeistva logik”, Logicheskie issledovaniya, 14 (2007), 131–151  mathscinet  zmath  elib

   2006
83. M. N. Rybakov, “Formalnaya predikatnaya logika A.Vissera: vyrazitelnost fragmentov yazyka ot odnoi odnomestnoi bukvy”, Sovremennaya logika: problemy teorii, istorii i primeneniya v nauke. Materialy IX Obscherossiiskoi nauchnoi konferentsii (Sankt-Peterburg, 22–24 iyunya 2006 goda), 2006, 386–388  elib
84. M. N. Rybakov, “Complexity of intuitionistic and Visser’s basic and formal logics in finitely many variables”, Advances in Modal Logic, 6, College Publications, London, 2006, 393–411  mathscinet  zmath  elib  scopus

   2005
85. M. N. Rybakov, Slozhnost propozitsionalnykh logik s konechnym chislom peremennykh, Dissertatsiya na soiskanie uchenoi stepeni kandidata fiziko-matematicheskikh nauk, Tverskoi gosudarstvennyi universitet, Tver, 2005 , 95 pp.  elib
86. M. N. Rybakov, “Complexity of the Two-Variable Fragment of Intuitionistic Propositional Logic”, Computer Science Applications of Modal Logic. International Conference (Moscow, September 5–9 2005), Poncelet Laboratory of UMI 2615 and Independent University of Moscow, Moscow, 2005, 35–36
87. M. N. Rybakov, Slozhnost propozitsionalnykh logik s konechnym chislom peremennykh, Avtoreferat dissertatsii na soiskanie uchenoi stepeni kandidata fiziko-matematicheskikh nauk. Yaroslavskii gosudarstvennyi universitet im. P.G. Demidova. Yaroslavl, 2005  elib

   2004
88. A. S. Guseva, M. N. Rybakov, “Intuitsionistskie formuly ot dvukh peremennykh i PSPACE-polnota”, Sovremennaya logika: problemy teorii, istorii i primeneniya v nauke. Materialy VIII Obscherossiiskoi nauchnoi konferentsii (Sankt-Peterburg), Izdatelstvo SPbGU, Sankt-Peterburg, 2004, 480–482
89. M. N. Rybakov, “Pogruzhenie intuitsionistskoi logiki v ee fragment ot dvukh peremennykh i slozhnost etogo fragmenta”, Logicheskie issledovaniya, 11 (2004), 247–261  mathscinet  zmath  elib

   2003
90. M. N. Rybakov, “O slozhnosti problemy razresheniya dlya bazisnoi i formalnoi logik s konechnym chislom peremennykh v yazyke”, Smirnovskie chteniya. IV Mezhdunarodnaya konferentsiya (Moskva), Izdatelstvo Instituta filosofii RAN, Moskva, 2003, 49–50
91. M. N. Rybakov, “Slozhnost problemy razresheniya bazisnoi i formalnoi logik”, Logicheskie issledovaniya, 10 (2003), 158–166  mathscinet  zmath  elib
92. M. N. Rybakov, A. V. Chagrov, “O slozhnosti modalnykh logik, imeyuschikh dokazuemostnuyu interpretatsiyu, s ogranicheniyami na chislo peremennykh”, Kolmogorov i sovremennaya matematika (Moskva), eds. Osipov Yu. S., Sadovnichii V. A., Izdatelstvo MGU, Moskva, 2003, 707–708  elib
93. A. V. Chagrov, M. N. Rybakov, “How Many Variables One Needs to Prove PSPACE-Hardness of Modal Logics?”, Advances in Modal Logic, 4, King’s College Publications, London, 2003, 71–82  mathscinet  zmath

   2002
94. M. N. Rybakov, A. V. Chagrov, “Konstantnye formuly v modalnykh logikakh: problema razresheniya”, Logicheskie issledovaniya, 9 (2002), 202–220  mathscinet  zmath  elib
95. M. N. Rybakov, “Ob algoritmicheskoi vyrazitelnosti modalnogo yazyka s odnoi lish odnomestnoi predikatnoi bukvoi”, Logicheskie issledovaniya, 9 (2002), 179–201  mathscinet  zmath  elib
96. A. V. Chagrov, M. N. Rybakov, “Least Number of Variables for PSPACE-Hardness of Provability Problem in Systems of Modal Logic”, Advances in Modal Logic (30 Septembre – 2 Octobre 2002. Institut de Reacherche en Informatique de Toulouse, Universite Paul Sabatier, Toulouse, France), Toulouse, 2002, 178–188
97. M. N. Rybakov, A. V. Chagrov, “Modalnye formuly bez peremennykh i PSPACE-polnota”, Sovremennaya logika: problemy teorii, istorii i primeneniya v nauke. Materialy VII Mezhdunarodnoi nauchnoi konferentsii (Sankt-Peterburg), Izdatelstvo Sankt-Peterburgskogo universiteta, Sankt-Peterburg, 2002, 498–500
98. M. N. Rybakov, “Rekursivnaya svodimost predikatnykh variantov standartnykh modalnykh logik k klassicheskoi logike predikatov”, Rossiiskoi matematike — trista let. Materialy yubileinoi nauchnoi konferentsii (Tver, 24–25 oktyabrya 2001 goda), Izdatelstvo Tverskogo gosudarstvennogo universiteta, Tver, 2002, 108–114

   2001
99. I. A. Gorbunov, M. N. Rybakov, “Vyrazitelnost operatorov znaniya i vozmozhnost effektivnogo opisaniya logik znaniya”, Problemy upravleniya i modelirovaniya v slozhnykh sistemakh. Trudy III Mezhdunarodnoi konferentsii (Samara), Samarskii nauchnyi tsentr RAN, Samara, 2001, 617–622
100. M. N. Rybakov, “Perechislimost modalnykh predikatnykh logik i usloviya obryva vozrastayuschikh tsepei”, Logicheskie issledovaniya, 8 (2001), 155–167  mathscinet  zmath  elib
101. M. N. Rybakov, “Operatory vseobschego i raspredelennogo znaniya: dopolnitelnye vyrazitelnye sredstva v logikakh znaniya”, Informatsionnye protsessy, 1:1 (2001), 89–98  elib
102. M. N. Rybakov, “O stepeni nerazreshimosti predikatnykh logik znaniya”, Trudy nauchno-issledovatelskogo seminara Logicheskogo tsentra Instituta filosofii RAN, XV, Izdatelstvo Instituta filosofii RAN, Moskva, 2001, 79–91  mathscinet  zmath

   2000
103. M. N. Rybakov, “Razreshimost nekotorykh modalnykh predikatnykh logik otnositelno klassicheskoi logiki predikatov”, Uchenye zapiski Tverskogo gosudarstvennogo universiteta, 6, Izdatelstvo Tverskogo gosudarstvennogo universiteta, Tver, 2000, 8–12
104. M. N. Rybakov, “Razreshimost intuitsionistskoi logiki predikatov otnositelno klassicheskoi logiki predikatov”, Sovremennaya logika: problemy teorii, istorii i primeneniya v nauke. Materialy VI Mezhdunarodnoi nauchnoi konferentsii (Sankt-Peterburg), Izdatelstvo Sankt-Peterburgskogo gosudarstvennogo universiteta, Sankt-Peterburg, 2000, 247–250
105. M. N. Rybakov, A. V. Chagrov, “Standartnye perevody neklassicheskikh formul i otnositelnaya razreshimost logik”, Trudy nauchno-issledovatelskogo seminara Logicheskogo tsentra Instituta filosofii RAN, XIV, Izdatelstvo Instituta filosofii RAN, Moskva, 2000, 81–98  mathscinet  zmath

   1999
106. M. N. Rybakov, “Konservativnost v normalnykh modalnykh predikatnykh logikakh”, Tezisy XXXVII Mezhdunarodnoi nauchnoi studencheskoi konferentsii (Novosibirsk, 12–16 aprelya 1999 goda), Izdatelstvo NGU, Novosibirsk, 1999

Presentations in Math-Net.Ru
1. Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
Irina Agadzhanian, Mikhail Rybakov, Dmitry Shkatov
Workshop "Semantical and Computational Aspects of Non-Classical Logics" (SCAN 2023)
June 16, 2023 15:30   
2. On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics
Mikhail Rybakov, Dmitry Shkatov
Workshop "Semantical and Computational Aspects of Non-Classical Logics" (SCAN 2023)
June 16, 2023 12:30   
3. Tiling problems and complexity of logics
Mikhail Rybakov, Darya Serova
Workshop "Semantical and Computational Aspects of Non-Classical Logics" (SCAN 2023)
June 14, 2023 15:00   
4. Computational complexity of non-classical logics of an unary predicate
M. N. Rybakov
Seminars "Proof Theory" and "Logic Online Seminar"
March 6, 2023 18:30   
5. Undecidability of modal and superintuitionistic logics of a single unary predicate in languages with two variables
M. N. Rybakov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science»
November 9, 2022 15:30   
6. On relationship between complexity function and complexity of validity in propositional modal logic
D. Shkatov, M. N. Rybakov
Logical Perspectives 2021: Summer School and Workshop
June 19, 2021 11:00   
7. Àëãîðèòìè÷åñêàÿ âûðàçèòåëüíîñòü íåêëàññè÷åñêèõ ïðåäèêàòíûõ ëîãèê, çàäàâàåìûõ êëàññàìè øêàë Êðèïêå, íå îïðåäåëèìûìè â ëîãèêå ïåðâîãî ïîðÿäêà
M. N. Rybakov

December 5, 2018   

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