( en | de | ru )

 

Disambiguation of "Shkatov, Dmitry"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

Dmitry Sveshnikov

Dmitry Suslov

Dmitry Varentsov

Dmitry Lobaskin

Dmitry Ivanov

 

Other publications of authors with the same name

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