( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables.

, и . 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.

n n n

Aleksej Rybakov

Mikhail Dobrynin

Mikhail Salzmann

Mikhail Karnevskiy

 

Другие публикации лиц с тем же именем

On complexity of propositional linear-time temporal logic with finitely many variables., и . SAICSIT, стр. 313-316. ACM, (2018)Complexity of finite-variable fragments M of EXPTIME-complete logics.. J. Appl. Non Class. Logics, 17 (3): 359-382 (2007)How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics., и . Advances in Modal Logic, стр. 71-82. King's College Publications, (2002)Recursive enumerability and elementary frame definability in predicate modal logic., и . CoRR, (2019)Complexity of propositional Linear-time Temporal Logic with finitely many variables., и . CoRR, (2017)Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter., и . Stud Logica, 107 (4): 695-717 (2019)Undecidability of the Logic of Partial Quasiary Predicates., и . Log. J. IGPL, 30 (3): 519-533 (2022)Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables.. Advances in Modal Logic, стр. 393-411. College Publications, (2006)Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages., и . J. Log. Comput., 31 (2): 494-522 (2021)Recursive enumerability and elementary frame definability in predicate modal logic., и . J. Log. Comput., 30 (2): 549-560 (2020)