activity
20082026
most citedUndecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter

29 citations · 109 across the 15 of their papers we have counts for

collaborators
Showing cs.LOShow all

10 papers · 1 filter

cs.LO2021★ 13 cited

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

Mikhail Rybakov, Dmitry Shkatov

We study the algorithmic properties of first-order monomodal logics of frames , , $\langle \mathbb{Q}, \leq \rangle…

cs.LO2019★ 21 cited

Complexity and expressivity of propositional dynamic logics with finitely many variables

Mikhail Rybakov, Dmitry Shkatov

We investigate the complexity of satisfiability for finite-variable fragments of propositional dynamic logics. We consider three formalisms belonging to three representative comple…

cs.LO2018★ 11 cited

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

Mikhail Rybakov, Dmitry Shkatov

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single pro…

cs.LO2017★ 29 cited

Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter

Mikhail Rybakov, Dmitry Shkatov

We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is…

cs.LO2017★ 2 cited

On complexity of propositional Linear-time Temporal Logic with finitely many variables

Mikhail Rybakov, Dmitry Shkatov

It is known [DemriSchnoebelen02] that both satisfiability and model-checking problems for propositional Linear-time Temporal Logic, LTL, with only a single propositional variable i…

cs.LO2012

Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge

Mai Ajspur, Valentin Goranko, Dmitry Shkatov

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common a…

cs.LO2009

Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic

Valentin Goranko, Dmitry Shkatov

We study the multiagent epistemic logic CMAELCD with operators for common and distributed knowledge for all coalitions of agents. We introduce Hintikka structures for this logic an…

cs.LO2009

Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time

Valentin Goranko, Dmitry Shkatov

We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common and…

cs.LO2008★ 11 cited

Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge

Valentin Goranko, Dmitry Shkatov

We develop an incremental-tableau-based decision procedure for the multi-agent epistemic logic MAEL(CD) (aka S5_n (CD)), whose language contains operators of individual knowledge f…

cs.LO2008★ 2 cited

Tableau-based decision procedures for logics of strategic ability in multi-agent systems

Valentin Goranko, Dmitry Shkatov

We develop an incremental tableau-based decision procedures for the Alternating-time temporal logic ATL and some of its variants. While running within the theoretically established…