?
On Kripke completeness of modal predicate logics around quantified K5
Annals of Pure and Applied Logic. 2023. Vol. 174. No. 2. Article 103202.
The paper studies completeness and incompleteness of modal predicate logics in
Kripke semantics, especially for logics of the form QL, minimal predicate extensions
of modal propositional logics. We show that QL is incomplete for a continual family
of logics above K + \Box(\Box p \rigtharrow p), in particular for well-known K5 and K45. On
the other hand, in some cases we find completions of QL; they are obtained by
adding a single extra axiom. Completeness proofs use canonical models, with some
modifications, and the case of QK5 is the most interesting from the technical side.
We also introduce the “boxing” operation for modal predicate logics and prove
transfer results for Kripke and Kripke sheaf completeness with respect to this
operation.
Шиманогов И. Н., Vyalyi M., Дискретный анализ и исследование операций 2025 Т. 32 № 4 С. 213–230
A well-studied class of algorithmic problems is that of regular realizability: checking the non-emptiness of the intersection of a regular language with a given language. This problem has a natural algebraic interpretation: verifying whether an element of a Boolean algebra belongs to the kernel of a certain homomorphism. This motivates the consideration of an analogous ...
Added: July 12, 2026
Rybakov M., Annals of Pure and Applied Logic 2026 Vol. 177 Article 103811
The paper presents a solution to the question about the decidability of the two-variable fragment of the superintuitionistic predicate logic QLC defined by the class of linear Kripke frames, which is also the ‘superintuitionistic’ fragment of the modal predicate logic QS4.3, under the Gödel translation. We prove that the fragment is undecidable. The result remains true for the ...
Added: July 11, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Springer, 2027.
The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research, teaching, and education. LNCS enjoys close cooperation with the computer science R & ...
Added: July 8, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Pilé I., Shchur L., Deng Y., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 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
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Rybakov M., / Series arXiv "math". 2025. No. 2505.00524.
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order logics and theories indirectly — by extracting it as a consequence of the recursive inseparability of special problems associated with them. First, we ...
Added: May 21, 2025
Agadzhanian I., Rybakov M., Shkatov D., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 13–17.
Added: July 7, 2023
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness
Rybakov M., Logic Journal of the IGPL 2024 Vol. 32 No. 3 P. 465–492
In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics GL, Grz, wGrz and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between QwGrz and QGL.3 or between QwGrz and QGrz.3 is Pi-1-1-hard even in languages with ...
Added: July 7, 2023
Rybakov M., Shkatov D., Journal of Logic and Computation 2020 Vol. 30 No. 7 P. 1305–1329
We study 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 modal logics of finite Kripke frames on the logics’ algorithmic properties. A finite frame is a frame with a finite set of possible worlds. The languages we consider have ...
Added: August 27, 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., , in: Advances in Modal LogicVol. 12.: College Publications, 2018. P. 531–539.
It is well-known that every quanti ed modal logic complete with respect to a first-order defi nable class of Kripke frames is recursively enumerable. Numerous examples are also known of natural quanti ed modal logics complete with respect to a class of frames de ned by an essentially second-order condition which are not recursively enumerable. It is not, however, known if these ...
Added: October 6, 2019
Shehtman V. B., , in: Advances in Modal LogicVol. 12.: College Publications, 2018. P. 559–575.
We prove completeness for some normal modal predicate logics in the standard Kripke semantics with expanding domains. We consider quantified versions of propositional logics with the axiom of density plus some others (transitivity, confluence). The method of proof modifies the technique developed for other cases
(without density) by S. Ghilardi, G. Corsi and D. Skvorstov; but now we arrange the ...
Added: September 20, 2018
Shapirovsky I., Zolin E., , in: 7th International Conference on Topology, Algebra and Categories in Logic (TACL 2015).: [б.и.], 2015. P. 1–3.
We give a sufficient condition for Kripke completeness of the extension of a modal logic with the transitive closure modality. More precisely, we show that if a logic is canonical and admits what we call definable filtration (ADF), then such an extension is complete (and again ADF). ...
Added: June 14, 2018
Shehtman V. B., , in: Advances in Modal Logic, Volume 10.: College Publications, 2014. P. 498–512.
The paper deals with a special type of filtration in modal logic called "canonical". This filtration has been known since the 1970s, but was used only occasionally. Applying it in a systematic way allows us to prove new results on finite model property (and in some cases --- local tabularity) for different polymodal logics. ...
Added: September 18, 2015