default search action
Mikhail N. Rybakov
Person information
- unicode name: Михаил Рыбаков
- affiliation: Tver State University, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Mikhail N. Rybakov
, Dmitry Shkatov:
Complexity function and complexity of validity of modal and superintuitionistic propositional logics. J. Log. Comput. 33(7): 1566-1595 (2023) - [i8]Mikhail N. Rybakov
Algorithmic properties of QK4.3 and QS4.3. CoRR abs/2307.02800 (2023) - 2022
- [j14]Mikhail N. Rybakov
Undecidability of the Logic of Partial Quasiary Predicates. Log. J. IGPL 30(3): 519-533 (2022) - [j13]Mikhail N. Rybakov
Complexity of finite-variable fragments of products with non-transitive modal logics. J. Log. Comput. 32(5): 853-870 (2022) - [j12]Mikhail N. Rybakov
Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. Stud Logica 110(2): 597-598 (2022) - [j11]Mikhail N. Rybakov
Complexity of finite-variable fragments of propositional temporal and modal logics of computation. Theor. Comput. Sci. 925: 45-60 (2022) - 2021
- [j10]Mikhail N. Rybakov
Complexity of finite-variable fragments of products with K. J. Log. Comput. 31(2): 426-443 (2021) - [j9]Mikhail N. Rybakov
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages. J. Log. Comput. 31(2): 494-522 (2021) - [j8]Mikhail N. Rybakov
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. J. Log. Comput. 31(5): 1266-1288 (2021) - [i7]Mikhail N. Rybakov
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. CoRR abs/2105.11811 (2021) - 2020
- [j7]Mikhail N. Rybakov
Recursive enumerability and elementary frame definability in predicate modal logic. J. Log. Comput. 30(2): 549-560 (2020) - [j6]Mikhail N. Rybakov
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. J. Log. Comput. 30(7): 1305-1329 (2020) - [c8]Mikhail N. Rybakov, Dmitry Shkatov:
Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages. AiML 2020: 523-539 - [c7]Mikhail N. Rybakov
Computational properties of the logic of partial quasiary predicates. SAICSIT 2020: 58-65
2010 – 2019
- 2019
- [j5]Mikhail N. Rybakov
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. Log. J. IGPL 27(1): 60-68 (2019) - [j4]Mikhail N. Rybakov
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. Stud Logica 107(4): 695-717 (2019) - [c6]Mikhail N. Rybakov
Trakhtenbrot theorem for classical languages with three individual variables. SAICSIT 2019: 19:1-19:7 - [i6]Mikhail N. Rybakov
Complexity and expressivity of propositional dynamic logics with finitely many variables. CoRR abs/1901.06407 (2019) - [i5]Mikhail N. Rybakov
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. CoRR abs/1910.02257 (2019) - [i4]Mikhail N. Rybakov
Recursive enumerability and elementary frame definability in predicate modal logic. CoRR abs/1911.09473 (2019) - 2018
- [j3]Mikhail N. Rybakov
Complexity and expressivity of propositional dynamic logics with finitely many variables. Log. J. IGPL 26(5): 539-547 (2018) - [c5]Mikhail N. Rybakov, Dmitry 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 2018: 531-539 - [c4]Mikhail N. Rybakov
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. ICTAC 2018: 396-414 - [c3]Mikhail N. Rybakov
On complexity of propositional linear-time temporal logic with finitely many variables. SAICSIT 2018: 313-316 - [i3]Mikhail N. Rybakov
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. CoRR abs/1810.09142 (2018) - 2017
- [i2]Mikhail N. Rybakov
Complexity of propositional Linear-time Temporal Logic with finitely many variables. CoRR abs/1706.04108 (2017) - [i1]Mikhail N. Rybakov
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter. CoRR abs/1706.05060 (2017)
2000 – 2009
- 2008
- [j2]Mikhail N. Rybakov
Complexity of intuitionistic propositional logic and its fragments. J. Appl. Non Class. Logics 18(2-3): 267-292 (2008) - 2007
- [j1]Mikhail N. Rybakov
Complexity of finite-variable fragments M of EXPTIME-complete logics. J. Appl. Non Class. Logics 17(3): 359-382 (2007) - 2006
- [c2]Mikhail N. Rybakov:
Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables. Advances in Modal Logic 2006: 393-411 - 2002
- [c1]Alexander V. Chagrov, Mikhail N. Rybakov:
How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics. Advances in Modal Logic 2002: 71-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: