activity
20152024
most citedSatisfiability problems on sums of Kripke frames

6 citations · 9 across the 8 of their papers we have counts for

collaborators
Showing math.LOShow all

10 papers · 1 filter

math.LO2024

Two types of filtrations for and its relatives

Andrey Kudinov, Ilya Shapirovsky

We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For , let be the logic defined by axiom $\lozenge^…

math.LO2023

On decidable extensions of Propositional Dynamic Logic with Converse

Daniel Rogozin, Ilya Shapirovsky

We describe a family of decidable propositional dynamic logics, where atomic modalities satisfy some extra conditions (for example, given by axioms of the logics K5, S5, or K45 for…

math.LO2023

Decidability of modal logics of non--colorable graphs

Ilya Shapirovsky

We consider the bimodal language, where the first modality is interpreted by a binary relation in the standard way, and the second is interpreted by the relation of inequality. It…

math.LO2022

Sufficient conditions for local tabularity of a polymodal logic

Ilya B. Shapirovsky

On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local t…

math.LO2020★ 6 cited

Satisfiability problems on sums of Kripke frames

Ilya B. Shapirovsky

We consider the operation of sum on Kripke frames, where a family of frames-summands is indexed by elements of another frame. In many cases, the modal logic of sums inherits the fi…

math.LO2020★ 1 cited

Completeness of logics with the transitive closure modality and related logics

Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin

We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call de…