The following pages link to Mikhail Rybakov (Q1623148):
Displayed 42 items.
- Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables (Q1623150) (← 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)
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
- (Q2804041) (← links)
- (Q2856051) (← links)
- Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages (Q3382820) (← links)
- (Q3509064) (← links)
- (Q3535111) (← links)
- Complexity of intuitionistic propositional logic and its fragments (Q3643316) (← links)
- (Q3647277) (← links)
- (Q4424651) (← links)
- (Q4440791) (← links)
- (Q4440792) (← links)
- (Q4467744) (← links)
- Неразрешимость модальных логик одноместного предиката (Q4566145) (← links)
- (Q4789048) (← links)
- (Q4789155) (← 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)
- (Q5465436) (← links)
- (Q5692811) (← 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)
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? (Q6075540) (← links)
- A simple example of blocking the Craig trick (Q6143287) (← 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)
- Computational complexity of one-variable fragments of products with T (Q6385038) (← links)
- Complexity of the variable-free fragment of the weak Grzegorczyk logic (Q6418549) (← links)
- Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames (Q6441271) (← links)
- Tiling problems and complexity of logics (extended version) (Q6441307) (← links)
- On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics (Q6441610) (← links)
- Algorithmic properties of QK4.3 and QS4.3 (Q6442795) (← links)
- Kripke trick and decidability of monadic fragments of modal and superintuitionistic logics (Q6442798) (← links)