The following pages link to Dmitry Shkatov (Q1623149):
Displayed 33 items.
- Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables (Q1623150) (← links)
- Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
- On independent axiomatizability of quasi-normal modal logics (Q2082254) (← links)
- Correction to: ``Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter'' (Q2118982) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Complexity of the universal theory of modal algebras (Q2307300) (← links)
- Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids (Q2317378) (← links)
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
- A general method for proving decidability of intuitionistic modal logics (Q2506825) (← links)
- Tableau-based decision procedures for logics of strategic ability in multiagent systems (Q2946589) (← links)
- Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information (Q3092299) (← links)
- Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages (Q3382820) (← links)
- (Q3509043) (← links)
- Finding Uniform Strategies for Multi-agent Systems (Q3582739) (← links)
- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic (Q3605530) (← links)
- Modal logics for reasoning about infinite unions and intersections of binary relations (Q4583172) (← links)
- Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge (Q4925179) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Undecidability of the Logic of Partial Quasiary Predicates (Q5092565) (← links)
- Complexity and expressivity of propositional dynamic logics with finitely many variables (Q5095651) (← links)
- (Q5104724) (← links)
- Recursive enumerability and elementary frame definability in predicate modal logic (Q5112647) (← links)
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages (Q5140314) (← links)
- (Q5224585) (← links)
- Complexity of finite-variable fragments of propositional modal logics of symmetric frames (Q5241916) (← links)
- Complexity of finite-variable fragments of products with <b>K</b> (Q5858128) (← links)
- Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages (Q5858132) (← links)
- Complexity of finite-variable fragments of products with non-transitive modal logics (Q5866476) (← links)
- Extensions of Solovay's system \(\mathbf{S}\) without independent sets of axioms (Q6050171) (← links)
- Complexity of the universal theory of residuated ordered groupoids (Q6169326) (← links)
- Complexity function and complexity of validity of modal and superintuitionistic propositional logics (Q6189216) (← links)
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q6287908) (← links)
- Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids (Q6327061) (← links)