( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Recursive enumerability and elementary frame definability in predicate modal logic.

, и . CoRR, (2019)

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.

Dmitry Sveshnikov

Dmitry Suslov

Dmitry Shvedov

Dmitry Marchenko

Dmitry Lobaskin

 

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

Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time., и . AAMAS (2), стр. 969-976. IFAAMAS, (2009)Extensions of Solovay's system S without independent sets of axioms., и . Ann. Pure Appl. Log., 175 (Issue 1, Part A): 103360 (января 2024)Complexity of the Universal Theory of Residuated Ordered Groupoids., и . J. Log. Lang. Inf., 32 (3): 489-510 (августа 2023)Complexity of propositional Linear-time Temporal Logic with finitely many variables., и . CoRR, (2017)Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge., , и . CoRR, (2012)Tableau-based decision procedures for logics of strategic ability in multiagent systems., и . ACM Trans. Comput. Log., 11 (1): 3:1-3:51 (2009)On complexity of propositional linear-time temporal logic with finitely many variables., и . SAICSIT, стр. 313-316. ACM, (2018)A general method for proving decidability of intuitionistic modal logics., и . J. Appl. Log., 4 (3): 219-230 (2006)Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis., , и . M4M, том 262 из Electronic Notes in Theoretical Computer Science, стр. 113-125. Elsevier, (2009)Recursive enumerability and elementary frame definability in predicate modal logic., и . CoRR, (2019)