?
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
Journal of Logic and Computation. 2025. Vol. 35. No. 2. Article exad078.
Rybakov M., Shkatov D.
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.
Смирнов С. В., Миллионщиков Д. В., Уфимский математический журнал 2021 Т. 13 № 2 С. 44–73
В данной работе изучаются характеристические алгебры для систем экспоненциального типа, соответствующих вырожденным матрицам Картана. Эти системы обобщают хорошо известные в теории интегрируемых систем гиперболические уравнения синус-Гордон и Цицейки. Для таких систем, соответствующих матрицам Картана ранга 2, характеристические алгебры описаны явно в терминах образующих и соотношений, и доказано, что они имеют линейный рост. Исследуется связь между ...
Added: September 11, 2026
Смирнов С. В., Glasgow Mathematical Journal 2026 Vol. 68 No. 2 P. 299–316
In the second half of the 19th century Darboux obtained determinant formulae that provide the general solution for a linear hyperbolic second order PDE with finite Laplace series. These formulae played an important role in his study of the theory of surfaces and, in particular, in the theory of conjugate nets. During the last three ...
Added: September 11, 2026
Смирнов С. В., Journal of Physics A: Mathematical and Theoretical 2023 Vol. 56 No. 26 Article 265204
There are different methods of discretizing integrable systems. We consider semi-discrete analog of two-dimensional Toda lattices associated to the Cartan matrices of simple Lie algebras that was proposed by Habibullin in 2011. This discretization is based on the notion of Darboux integrability. Generalized Toda lattices are known to be Darboux integrable in the continuous case ...
Added: September 11, 2026
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2026 № 6 С. 132–138
In schemes S for placing r particles in n distinguishable cells, their placement in selected m cells – schemes S∗ is studied, for which the analysis is carried out by a new enumerative method (EM) in extended areas of enumerative combinatorics: finding the number of outcomes and, based on the construction of a model of ...
Added: September 11, 2026
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2026 № 6 С. 139–147
The class of particle cell arrangements under consideration is characterized by the introduction of an upper limit on the filling levels of the cells, which must be achieved in at least one cell of each outcome of each arrangement. The circuits are distinguished by the paired qualities of their constituent elements (cells and particles) according ...
Added: September 11, 2026
Podinovskiy V. V., Нелюбин А. П., Автоматика и телемеханика 2026 № 8 С. 110–123
Для многокритериальных задач принятия решений по аналогии с качественной вероятностью введены понятия полной и частичной качественной важности как бинарных отношений, обладающих постулируемыми
свойствами. Предложено новое определение отношения нестрогого предпочтения на множестве вариантов решений, порождаемое качественной
важностью. Исследованы его свойства. Указаны аналитические правила,
позволяющие попарно сравнивать варианты по предпочтительности. Проведено сравнение новых отношений предпочтения с разработанными ранее для задач, ...
Added: September 9, 2026
Podinovskiy V. V., Нелюбин А. П., Автоматика и телемеханика 2026 № 7 С. 113–126
Рассматриваются задачи принятия решений, когда предпочтения оцениваются в порядковой шкале, а возможности реализации значений
неопределенного фактора описываются качественной вероятностью (полной или только частичной). Вводятся определения отношений предпочтения и безразличий на множестве стратегий. Предлагаются простые
решающие правила, позволяющие сравнивать стратегии по предпочтительности, и приводятся иллюстративные примеры. ...
Added: September 9, 2026
Chemical Papers 2026
Benzenoid hydrocarbons are structurally regular aromatic compounds, which makes them well suited for quantitative structure–property relationship (QSPR) studies. This study presents a QSPR analysis of nineteen benzenoid hydrocarbon species using degree-based topological co-indices. We developed a Python program to compute eleven degree-based topological co-indices from molecular graphs and evaluated their ability to explain variations in ...
Added: September 8, 2026
Glutsyuk A., / Series arXiv "math". 2026.
B.Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, dθdτ=1ω(cosθ+B+Acosτ), which is known as ...
Added: September 8, 2026
Glutsyuk A., / Series arXiv "math". 2026.
A planar dual billiard is a planar curve γ equipped with a family (σP)|P∈γ of projective involutions of the projective lines LP tangent to γ at P that fix P. A dual billiard is called rationally integrable, if there exists a rational function R(x,y) of two variables (called first integral) whose restriction to each tangent ...
Added: September 8, 2026
Alexandrov A., Glutsyuk A., Journal of Differential Equations 2026 Vol. 465 Article 114178
The overdamped Josephson junction in superconductivity theory can be modeled by the family of dynamical systems on the torus, which is known as the RSJ model. This family admits an equivalent description by a family of second-order differential equations: special double confluent Heun equations. In the present paper, we construct two new families of dynamical systems on ...
Added: September 8, 2026
Glutsyuk A., Inventiones Mathematicae 2026 Vol. 245 P. 977–1058
A caustic of a strictly convex planar bounded billiard is a smooth curve whose tangent lines are reflected from the billiard boundary to its tangent lines. The famous Birkhoff Conjecture, studied by many mathematicians, states that if the billiard boundary has an inner neighborhood foliated by closed caustics, then it is an ellipse. In the paper we study ...
Added: September 8, 2026
Prikhodko Artem, Kubrak D., Compositio Mathematica 2026 Vol. 162 No. 6 P. 1377–1438
In this follow-up paper we show that smooth Hodge-proper stacks over O𝐾 are ℚ𝑝-locally acyclic: namely the natural map between étale ℚ𝑝-cohomology of the algebraic and Raynaud generic fibers is an equivalence. This establishes the ℚ𝑝-case of general conjectures made in D. Kubrak and A. Prikhodko [p-adic Hodge theory for Artin stacks, Mem. Amer. Math. ...
Added: September 7, 2026
Ismailov A., Constructive Approximation 2026
The measure of the positivity set {x ∈ [0; 2π] | f (x) > 0} of a trigonometric polynomial f is bounded from below by the Motzkin density.
We generalize the bound to polynomials in several variables and almost periodic functions.
We then use these generalizations to extend known results on Taikov’s problem. ...
Added: September 7, 2026
Kelbert M., Statistics 2026 Vol. 60
We present variational representations for the weighted divergencies
and exponential error function, and discuss implications for the
statistical inference and entropic optimal transport. ...
Added: September 7, 2026
Kucheryavyy P., Математические заметки 2026 Т. 2026 № 120 С. 380–401
В работе изучаются перестановки, возникающие при упорядочивании по возрастанию дробных долей произведений элементов фиксированной целочисленной последовательности на вещественный параметр. Исследуется количество различных перестановок, которые можно получить таким образом при изменении этого параметра от нуля до единицы. ...
Added: September 7, 2026
Осипов Д.В., Математический сборник 2026 Т. 217 № 9 С. 130–146
Изучаются законы взаимности, связанные с комплексными линейными расслоениями на расслоениях на ориентируемые окружности. В частности, доказывается следующий закон взаимности. Пусть B – комплексное многообразие и πi:Mi→B – расслоение на ориентируемые окружности, где индекс i пробегает конечное множество. Пусть Li и Ni – комплексные линейные расслоения на каждом многообразии Mi. Закон взаимности утверждает, что сумма всех элементов (πi)∗(c1(Li)∪c1(Ni)), где (πi)∗ – ...
Added: September 3, 2026
Rybakov M., Annals of Pure and Applied Logic 2026 Vol. 177 No. 10 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
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
Speranski S. O., Journal of Logic and Computation 2013 Vol. 23 No. 5 P. 1035–1055
In the present article, the quantifiers over propositions are first introduced into the language for reasoning about probability, then the complexity issues for validity problems dealing with the corresponding hierarchy of probabilistic sentences are investigated. We prove, among other things, the $\Pi^1_1$-completeness for the general validity and also indicate the least level in the hierarchy ...
Added: December 27, 2025
Speranski S. O., Archive for Mathematical Logic 2013 Vol. 52 No. 5–6 P. 507–516
We carry out a study of definability issues in the standard models of Presburger and Skolem arithmetics (henceforth referred to simply as Presburger and Skolem arithmetics, for short, because we only deal with these models, not the theories, thus there is no risk of confusion) supplied with free unary predicates — which are strongly related to definability in ...
Added: December 27, 2025
Speranski S. O., Izvestiya. Mathematics 2025 Vol. 89 No. 3 P. 609–627
Let QPL-e expand the quantifier-free ‘polynomial’ probability logic of [Fagin et al. 1990] by adding quantifiers over arbitrary events; it can be viewed as a one-sorted elementary language for reasoning about probability spaces. We prove that the $\Sigma_2$-fragment of the QPL-e-theory of finite spaces is hereditarily undecidable. By earlier observations, this implies that $\Pi_2$ is the ...
Added: December 26, 2025
Speranski S. O., Logic Journal of the IGPL 2025 Vol. 33 No. 2 Article jzae042
This paper is concerned with a two-sorted probabilistic language, denoted by QPL, which contains quantifiers over events and over reals, and can be viewed as an elementary language for reasoning about probability spaces. The fragment of QPL containing only quantifiers over reals is a variant of the well-known ‘polynomial’ language from [Fagin et al. 1990, Section 6]. ...
Added: December 26, 2025