( en | de | ru )

 

Disambiguation of "Rybakov, Mikhail N."

Author of the publication

copydeleteadd this publication to your clipboard
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables.

, and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Aleksej Rybakov

Mikhail Salzmann

Mikhail Dobrynin

Mikhail Karnevskiy

 

Other publications of authors with the same name

Complexity of finite-variable fragments M of EXPTIME-complete logics.. J. Appl. Non Class. Logics, 17 (3): 359-382 (2007)On complexity of propositional linear-time temporal logic with finitely many variables., and . SAICSIT, page 313-316. ACM, (2018)How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics., and . Advances in Modal Logic, page 71-82. King's College Publications, (2002)Recursive enumerability and elementary frame definability in predicate modal logic., and . CoRR, (2019)Complexity of propositional Linear-time Temporal Logic with finitely many variables., and . CoRR, (2017)Complexity of intuitionistic propositional logic and its fragments.. J. Appl. Non Class. Logics, 18 (2-3): 267-292 (2008)Complexity of finite-variable fragments of products with K., and . J. Log. Comput., 31 (2): 426-443 (2021)Complexity of finite-variable fragments of products with non-transitive modal logics., and . J. Log. Comput., 32 (5): 853-870 (2022)Complexity function and complexity of validity of modal and superintuitionistic propositional logics., and . J. Log. Comput., 33 (7): 1566-1595 (October 2023)A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames., and . Advances in Modal Logic, page 531-539. College Publications, (2018)