?
Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter
Studia Logica. 2021.
Rybakov M., Shkatov D.
Shehtman V. B., Gagarin A., , in: Graph Games and Logic Design. Recent Developments and Further Directions. (TREN, volume 66)Vol. 66.: Springer, 2026. Ch. 17 P. 419–450.
The chapter contains an overview of results on products of propositional modal logics and related constructions: semiproducts, Segerberg squares, and others. We focus mainly on axiomatizations, finite model property, and decidability; we also sketch connections with classical and modal predicate logics. In some cases we give ideas of proofs, especially of those using games. ...
Added: June 30, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
[б.и.], 2024.
The book contains short papers presented at AiML 2024. ...
Added: August 15, 2024
College Publications, 2024.
Advances in Modal Logic (AiML) is an initiative founded in 1995 and aimed at presenting an up-to-date picture of the state of the art in modal logic and its many applications. It consists of a conference series together with volumes based on the conferences. The conference series is the main international forum at which research ...
Added: August 14, 2024
Rybakov M., Shkatov D., Studia Logica 2025 Vol. 113 P. 1–48
In the early 1960s, to prove undecidability of monadic fragments of sublogics of the predicate modal logic QS5 that include the classical predicate logic QCl, Saul Kripke showed how a classical atomic formula with a binary predicate letter can be simulated by a monadic modal formula. We consider adaptations of Kripke's simulation, which we call the Kripke trick, to various modal ...
Added: December 2, 2023
Rybakov M., Shkatov D., Journal of Logic and Computation 2025 Vol. 35 No. 2 Article exad078
We show that the monadic modal logic of a single Kripke frame with finitely many possible worlds, but possibly infinite domains, is decidable. This holds true even for monadic multimodal logics with equality, both if equality interpreted as identity and if equality interpreted as congruence. ...
Added: November 3, 2023
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Rybakov M., Shkatov D., Journal of Logic and Computation 2023 Vol. 33 No. 7 P. 1566–1595
We consider the relationship between the algorithmic properties of the validity problem for a modal or superintuitionistic propositional logic and the size of the smallest Kripke countermodels for non-theorems of the logic. We establish the existence, for every degree of unsolvability, of a propositional logic whose validity problem belongs to the degree and whose every ...
Added: January 6, 2023
Zapryagaev A., / Series arXiv "math". 2022.
Added: December 7, 2022
Kikot S., Kudinov A., Mathematics 2022 Vol. 10 No. 19 Article 3701
We axiomatize strictly positive fragments of modal logics with the confluence axiom. We consider unimodal logics such
as K.2, D.2, D4.2 and S4.2
with unimodal confluence $\Diamond\Box p \to \Box\Diamond p$
as well as the products of modal logics
in the set {K, D, T, D4, S4}, which contain bimodal confluence
$\Diamond_1\Box_2 p \to \Box_2\Diamond_1 p$.
We show that the impact ...
Added: October 10, 2022
Matushkin A. D., Popova S., Discrete Mathematics 2022 Vol. 345 No. 6 Article 112835
In this work we describe the spectra of all rational numbers that could be a density of a strictly balanced uniform hypergraph. We also introduce some specific constructions of strictly balanced uniform hypergraphs, and exploit them to generalize some results about Zero-One Law and Zero-One k-Law to the case of random uniform hypergraphs. ...
Added: June 29, 2022
Rybakov M., Shkatov D., Logical Investigations 2021 Vol. 27 No. 2 P. 93–120
Доказывается неразрешимость логи QCTL и QLTL в языке с двумя переменными и одной одноместной предикатной буквой. ...
Added: January 24, 2022
Шуман А. Н., Journal of Indian Philosophy 2021 Vol. 49 P. 467–498
There are two different modal logics: the logic T assuming contingency and the logic K = assuming logical determinism. In the paper, I show that the Aristotelian treatise On Interpretation (Περί ερμηνείας, De Interpretatione) has introduced some modal-logical relationships which correspond to T. In this logic, it is supposed that there are contingent events. The Nāgārjunian treatise Īśvara-kartṛtva-nirākṛtiḥ-viṣṇoḥ-ekakartṛtva-nirākaraṇa has introduced some modal-logical relationships which correspond ...
Added: July 21, 2021
Rybakov M., Shkatov D., Journal of Logic and Computation 2021 Vol. 31 No. 2 P. 494–522
We consider the effect of restricting the number of individual variables, as well as the number and arity of predicate letters, in languages of first-order predicate superintuitionistic logics of finite Kripke frames on the logics' algorithmic properties. By a finite frame we mean a frame with a finite set of possible worlds. The languages we consider have no constants, function ...
Added: December 23, 2020
Kikot S., Shapirovsky I., Zolin E., , in: Advances in Modal LogicVol. 13.: College Publications, 2020. P. 369–388.
We give a sufficient condition for Kripke completeness of modal logics that have the transitive closure modality. More precisely, we show that if a modal logic admits what we call definable filtration, then its enrichment with the transitive closure modality (and the corresponding axioms) is Kripke complete; in addition, the resulting logic has the finite ...
Added: December 2, 2020
Rybakov M., Котикова Е. А., Logical Investigations 2015 Vol. 21 No. 1 P. 86–99
For an infinite class of calculi containing CTL and QCL, it is proved that they are Kripke incomplete. ...
Added: July 20, 2020
Rybakov M., Shkatov D., , in: Десятые Смирновские чтения: материалы Междунар. науч. конф., Москва, 15–17 июня 2017 г.: М.: Современные тетради, 2017. P. 45–45.
We discuss an example of recursively-enumerable Kripke-complete first-order modal logics that are not Kripke complete with respect to a first-order definable class of frames. ...
Added: October 7, 2019
Rybakov M., Shkatov D., Studia Logica 2019 Vol. 107 No. 4 P. 695–717
We prove that the positive fragment of fi rst-order intuitionistic logic in the language with two individual variables and a single monadic predicate letter, without functional symbols, constants, and equality, is undecidable. This holds true regardless of whether we consider semantics with expanding or constant domains. We then generalise this result to intervals [QBL;QKC] and [QBL;QFL], where QKC ...
Added: October 2, 2019
Zolin E., В кн.: Одиннадцатые Смирновские чтения по логике: материалы Международной научной конференции, 19 – 21 июня 2019, г. Москва.: М.: Современные тетради, 2019. С. 24–26.
В модальной теории соответствия [1, Sect. 3.5] говорят, что формула
первого порядка с одной свободной переменной 𝑞(𝑥) сигнатуры {𝑅,=}, где
𝑅 – бинарный предикатный символ, соответствует модальной формуле 𝐴, если для любой шкалы Крипке 𝐹 = (𝑊,𝑅) и точки 𝑤 ∈ 𝑊, имеем: 𝐹 |= 𝑞(𝑤) ⇔ 𝐹,𝑤 |= 𝐴. Будем обозначать соответствие 𝑞(𝑥)!𝐴, следуя [4], где ...
Added: June 30, 2019