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

Total publications: 84 (81)
in MathSciNet: 20 (20)
in zbMATH: 22 (22)
in Web of Science: 11 (11)
in Scopus: 19 (19)
Cited articles: 17
Citations in Math-Net.Ru: 2
Citations in Web of Science: 36
Citations in Scopus: 85
Presentations: 2

Number of views:
This page:2182
Abstract pages:478
Full texts:389
References:40
Rybakov, Mikhail Nikolaevich
Associate professor
Candidate of physico-mathematical sciences (2005)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail:
Website: http://lms.tversu.ru/eportfolios/3636

http://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 http://istina.msu.ru/workers/223772131
http://orcid.org/0000-0002-1491-1310
https://publons.com/researcher/O-5806-2018
http://www.researcherid.com/rid/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 in WoS | by times cited in Scopus | common list |



   2022
1. M. Rybakov, D. Shkatov, “Undecidability of the logic of partial quasiary predicates”, Logic Journal of the IGPL, 2022  crossref
2. M. Rybakov, “Computational complexity of the word problem in modal and pseudo-Boolean algebras with a small number of generators”, Russian Mathematics, 2022 (to appear)
3. M. Rybakov, D. Shkatov, “Complexity of finite-variable fragments of products with non-transitive modal logics”, Journal of Logic and Computation, 2022 (to appear)  crossref

   2021
4. 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 (cited: 2)  elib  scopus (cited: 3)
5. 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 (cited: 1)  elib  scopus (cited: 2)
6. 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
7. 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  isi  scopus (cited: 1)
8. 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
9. 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
10. 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  elib  scopus
11. 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
12. 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
13. K. I. Aleksandrov, M. N. Rybakov, D. P. Shkatov, Slozhnost fragmentov proizvedenii s logikoi T v yazyke s odnoi peremennoi, 2021 (Published online) , 10 pp., arXiv: 2112.03833
14. M. Rybakov, D. Shkatov, “Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter”, Studia Logica, 2021  crossref  isi  elib  scopus

   2020
15. 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
16. 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
17. 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  isi (cited: 3)  elib  scopus (cited: 5)
18. 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 1416, 2020, Cape Town, South Africa), ACM, New York, NY, USA, 8 Pages, 2020, 58–65  crossref  elib  scopus
19. 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 (cited: 3)  scopus (cited: 4)
20. 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

   2019
21. 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), 695717  crossref  mathscinet  zmath  isi (cited: 7)  elib  scopus (cited: 10)
22. 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, 1921 iyunya 2019 goda), Sovremennye tetradi, Moskva, 2019, 43–45
23. M. N. Rybakov, “Matematicheskoe obrazovanie: rekursivnaya mozaika”, Perspektivy razvitiya matematicheskogo obrazovaniya v Tveri i Tverskoi oblasti. Materialy III Vserossiiskoi nauchno-prakticheskoi konferentsii (Tver, 2930 marta 2019 goda), Izdatelstvo TvGU, 2019, 174–176  elib
24. 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
25. 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  isi (cited: 7)  elib  scopus (cited: 10)
26. 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 (cited: 3)

   2018
27. 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
28. 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
29. 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  elib
30. 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  crossref  mathscinet  isi (cited: 9)  scopus (cited: 12)
31. 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 DAgostino, George Metcalfe, and Thomas Studer, College Publications, 2018, 531–540  mathscinet  zmath  elib  scopus (cited: 6)
32. 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  crossref  mathscinet  zmath  isi (cited: 4)  elib  scopus (cited: 7)
33. 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  crossref  isi  elib  scopus (cited: 2)
34. 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
35. M. N. Rybakov, “Nerazreshimost modalnykh logik odnomestnogo predikata”, Logicheskie issledovaniya, 23:2 (2017), 60–75  crossref  mathscinet  zmath  elib  scopus
36. 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
37. M. N. Rybakov, “Nerazreshimost modalnykh predikatnykh logik v yazyke s odnoi odnomestnoi bukvoi”, Desyatye Smirnovskie chteniya po logike (Moskva, 1517 iyunya 2017 goda), Sovremennye tetradi, Moskva, 2017, 41–43  elib
38. M. N. Rybakov, E. A. Kotikova, “Algoritmicheskaya vyrazitelnost predikatnoi logiki vetvyaschegosya vremeni v yazyke s odnoi odnomestnoi bukvoi”, Desyatye Smirnovskie chteniya po logike (Moskva, 1517 iyunya 2017 goda), Sovremennye tetradi, Moskva, 2017, 43–44  elib
39. 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, 1517 iyunya 2017 goda), Sovremennye tetradi, Moskva, 2017, 45  elib
40. P. Balbiani, M. Rybakov, “An axiomatization of iteration-free PDL with loop”, XII Tbilisi Symposium of Language, Logic and Computation (Lagodekhi, Georgia, 1822 September, 2017), 2017, 49–53

   2016
41. 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
42. 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  elib
43. M. N. Rybakov, Sposoby obosnovaniya suschestvovaniya matematicheskikh ob'ektov. Uchebno-metodicheskoe posobie, Tver, Izdatelstvo TvGU, 2016
44. M. N. Rybakov, Otnosheniya, funktsii i operatsii nad nimi. Uchebno-metodicheskoe posobie, Tver, Izdatelstvo TvGU, 2016

   2015
45. 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  mathscinet  zmath  elib
46. M. N. Rybakov, “Pogruzhenie klassicheskoi logiki predikatov v logiku kvaziarnykh predikatov”, Devyatye Smirnovskie chteniya po logike (Moskva, 1719 iyunya 2015 goda), eds. V. I. Markin, Sovremennye tetradi, Moskva, 2015, 33–34  elib
47. 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, 1719 iyunya 2015 goda), eds. V. I. Markin, Sovremennye tetradi, Moskva, 2015, 34  elib

   2014
48. 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 (Kivskii natsionalnii universitet imeni Tarasa Shevchenka, 1516 travnya 2014 roku), VPTs Kivskii universitet, Kiv, 2014, 102–104
49. M. N. Rybakov, “Nerazreshimost logiki kvaziarnykh predikatov”, Vestnik TvGU. Seriya: Prikladnaya matematika, 2014, no. 4, 17–32  mathnet  elib

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

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

   2010
52. 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, 2326 iyunya 2010 goda), Izdatelstvo SPbGU, Sankt-Peterburg, 2010, 281–283  elib

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

   2008
54. 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, 2628 iyunya 2008 goda), Izdatelstvo SPbGU, 2008, 443–444  elib
55. 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 (cited: 6)

   2007
56. 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
57. M. N. Rybakov, “Neklassicheskie logiki: ikh slozhnost i slozhnost ikh prilozhenii”, Filosofiya matematiki: aktualnye problemy. Materialy Mezhdunarodnoi nauchnoi konferentsii (Moskva, 1516 iyunya 2007 goda), Izdatelstvo filosofskogo fakulteta MGU, Moskva, 2007, 123–125  elib
58. M. N. Rybakov, “K voprosu o polnote po Kripke predikatnykh logik”, Smirnovskie chteniya. Materialy 5-oi konferentsii (Moskva, 2022 iyunya 2007 goda), eds. A. S. Karpenko, Izdatelstvo IF RAN, Moskva, 2007, 37–38  elib
59. 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 (cited: 1)
60. I. A. Gorbunov, M. N. Rybakov, “Kontinualnye semeistva logik”, Logicheskie issledovaniya, 14 (2007), 131–151  mathscinet  zmath  elib

   2006
61. 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, 2224 iyunya 2006 goda), 2006, 386–388  elib
62. M. N. Rybakov, “Complexity of intuitionistic and Vissers basic and formal logics in finitely many variables”, Advances in Modal Logic, 6, College Publications, London, 2006, 393–411  mathscinet  zmath  elib  scopus (cited: 13)

   2005
63. 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
64. M. N. Rybakov, “Complexity of the Two-Variable Fragment of Intuitionistic Propositional Logic”, Computer Science Applications of Modal Logic. International Conference (Moscow, September 59 2005), Poncelet Laboratory of UMI 2615 and Independent University of Moscow, Moscow, 2005, 35–36
65. 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
66. 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
67. M. N. Rybakov, “Pogruzhenie intuitsionistskoi logiki v ee fragment ot dvukh peremennykh i slozhnost etogo fragmenta”, Logicheskie issledovaniya, 11 (2004), 247–261  zmath  elib

   2003
68. 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
69. M. N. Rybakov, “Slozhnost problemy razresheniya bazisnoi i formalnoi logik”, Logicheskie issledovaniya, 10 (2003), 158–166  zmath  elib
70. 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
71. A. V. Chagrov, M. N. Rybakov, “How Many Variables One Needs to Prove PSPACE-Hardness of Modal Logics?”, Advances in Modal Logic, 4, Kings College Publications, London, 2003, 71–82  mathscinet  zmath

   2002
72. M. N. Rybakov, A. V. Chagrov, “Konstantnye formuly v modalnykh logikakh: problema razresheniya”, Logicheskie issledovaniya, 9 (2002), 202–220  zmath  elib
73. M. N. Rybakov, “Ob algoritmicheskoi vyrazitelnosti modalnogo yazyka s odnoi lish odnomestnoi predikatnoi bukvoi”, Logicheskie issledovaniya, 9 (2002), 179–201  zmath  elib
74. 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
75. 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
76. M. N. Rybakov, “Rekursivnaya svodimost predikatnykh variantov standartnykh modalnykh logik k klassicheskoi logike predikatov”, Rossiiskoi matematike trista let. Materialy yubileinoi nauchnoi konferentsii (Tver, 2425 oktyabrya 2001 goda), Izdatelstvo Tverskogo gosudarstvennogo universiteta, Tver, 2002, 108–114

   2001
77. 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
78. M. N. Rybakov, “Perechislimost modalnykh predikatnykh logik i usloviya obryva vozrastayuschikh tsepei”, Logicheskie issledovaniya, 8 (2001), 155–167  zmath  elib
79. M. N. Rybakov, “Operatory vseobschego i raspredelennogo znaniya: dopolnitelnye vyrazitelnye sredstva v logikakh znaniya”, Informatsionnye protsessy, 1:1 (2001), 89–98  mathscinet  elib
80. 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  zmath

   2000
81. 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
82. 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
83. 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  zmath

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

Presentations in Math-Net.Ru
1. 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   
2. , ,
M. N. Rybakov

December 5, 2018   

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