Mikhail Rybakov

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
Journal of Logic and Computation
2026-09-01Paper
Superintuitionistic predicate logics of linear Kripke frames: undecidability with two individual variables
Annals of Pure and Applied Logic
2026-07-28Paper
Polytime embedding of intuitionistic modal logics into their one-variable fragments
Journal of Logic and Computation
2025-10-29Paper
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
Journal of Logic and Computation
2025-10-15Paper
On the system of positive slices in the structure of superintuitionistic predicate logics2025-06-26Paper
Variations on the Kripke trick
Studia Logica
2025-02-17Paper
Predicate counterparts of modal logics of provability: high undecidability and Kripke incompleteness
Logic Journal of the IGPL
2024-11-15Paper
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Journal Of Logic And Computation
2024-02-08Paper
A simple example of blocking the Craig trick
Logical Investigations
2024-01-23Paper
Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
Logical Investigations
2023-09-20Paper
Algorithmic properties of QK4.3 and QS4.32023-07-06Paper
Kripke trick and decidability of monadic fragments of modal and superintuitionistic logics2023-07-06Paper
On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics2023-06-27Paper
Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames2023-06-23Paper
Tiling problems and complexity of logics (extended version)2023-06-23Paper
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
Logical Investigations
2023-01-16Paper
Complexity of the variable-free fragment of the weak Grzegorczyk logic2022-11-26Paper
Complexity of finite-variable fragments of products with non-transitive modal logics
Journal Of Logic And Computation
2022-09-22Paper
Algorithmic properties of first-order modal logics of the natural number line in restricted languages2022-09-15Paper
Complexity and expressivity of propositional dynamic logics with finitely many variables
Logic Journal of the IGPL
2022-08-10Paper
Undecidability of the Logic of Partial Quasiary Predicates
Logic Journal of the IGPL
2022-07-22Paper
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
Theoretical Computer Science
2022-06-24Paper
Correction to: ``Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter''
Studia Logica
2022-03-23Paper
Computational complexity of one-variable fragments of products with T2021-12-07Paper
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
Journal Of Logic And Computation
2021-09-22Paper
Complexity of finite-variable fragments of products with <b>K</b>
Journal Of Logic And Computation
2021-04-09Paper
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
Journal Of Logic And Computation
2021-04-09Paper
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
Journal Of Logic And Computation
2020-12-15Paper
Recursive enumerability and elementary frame definability in predicate modal logic
Journal Of Logic And Computation
2020-06-04Paper
Complexity of finite-variable fragments of propositional modal logics of symmetric frames
Logic Journal of the IGPL
2019-11-04Paper
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
Studia Logica
2019-09-03Paper
A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames2019-07-24Paper
Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
(available as arXiv preprint)
2018-11-23Paper
Undecidability of modal logics of unary predicate
Logical Investigations
2018-06-14Paper
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
(available as arXiv preprint)
2017-06-15Paper
Kripke incompleteness of first-order calculi with temporal modalities of CTL and near logics
Logicheskie Issledovaniya
2016-04-27Paper
First-order logics of braching time: on expressive power of temporal operators2013-10-23Paper
Complexity of finite-variable fragments of EXPTIME-complete logics2009-11-30Paper
Complexity of intuitionistic propositional logic and its fragments
Journal of Applied Non-Classical Logics
2009-11-11Paper
Continuum classes of logics2008-11-10Paper
Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables2008-07-01Paper
scientific article; zbMATH DE number 2209833 (Why is no real title available?)2005-09-28Paper
scientific article; zbMATH DE number 2196586 (Why is no real title available?)2005-08-22Paper
scientific article; zbMATH DE number 2072508 (Why is no real title available?)2004-06-10Paper
scientific article; zbMATH DE number 1975408 (Why is no real title available?)2004-02-25Paper
scientific article; zbMATH DE number 1858071 (Why is no real title available?)2003-07-02Paper
scientific article; zbMATH DE number 1859179 (Why is no real title available?)2003-06-17Paper
scientific article; zbMATH DE number 2020142 (Why is no real title available?)2002-01-01Paper
scientific article; zbMATH DE number 2020143 (Why is no real title available?)2002-01-01Paper


Research outcomes over time


This page was built for person: Mikhail Rybakov