Эпистемическая STIT-логика без типов действий

?

Эпистемическая STIT-логика без типов действий

С. 145–148.

Khaitovich D.

In the recent literature we can find several epistemic exstensions of STIT logics. One of the most prominent variant -- KSTIT logic, developed by John Horty and Eric Pacuit -- is build upon the introducing action type-token distinction in the theory, combined with a number of semantic constrains on epistemic and historical relations. In this article we will deduce counter-intuitive theorems provable in KSTIT-logic and introduce our own variant of epistemic STIT logic, not supporting them.

Language: Russian

Full text

In book

Двенадцатые Смирновские чтения: материалы Международной научной конференции, Москва, 24–26 июня 2021 г.

М.: Русское общество истории и философии науки, 2021.

Modal Products and Around

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

Graph Games and Logic Design. Recent Developments and Further Directions. (TREN, volume 66)

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., Математический сборник 2024 Т. 215 № 3 С. 37–69

Разрабатывается кванторная версия пропозициональной модальной логики BK из статьи С. П. Одинцова и Х. Вансинга, в основе которой лежит (немодальная) система Белнапа–Данна; мы будем обозначать эту версию через QBK. Сначала с помощью метода канонических моделей будет доказано, что QBK — как и некоторые важные её расширения — сильно полна относительно подходящей семантики возможных миров. Затем мы ...

Added: December 26, 2025

Epistemic Mathematical Models for Analyzing Meta-opinions on Social Networks

Fedyanin D., , in: 17th International Conference, SCSM 2025, Held as Part of the 27th HCI International Conference, HCII 2025, Gothenburg, Sweden, June 22–27, 2025, Proceedings, Part II. Social Computing and Social Media. LNCS, volume 15787Vol. 2.: Switzerland: Springer, 2025. P. 247–256.

The paper proposes a formal model for describing opinions and higher-order opinions (e.g., opinions about opinions) using classical epistemic logic, such as the Kripke structure. Traditionally employed for analyzing knowledge and beliefs, this model is adapted to interpret opinions as beliefs, which is particularly promising for describing human-computer interaction due to its high level of formalization. The study is ...

Added: December 13, 2025

17th International Conference, SCSM 2025, Held as Part of the 27th HCI International Conference, HCII 2025, Gothenburg, Sweden, June 22–27, 2025, Proceedings, Part II. Social Computing and Social Media. LNCS, volume 15787

Fedyanin D., Switzerland: Springer, 2025.

The 17th International Conference on Social Computing and Social Media (SCSM 2025) was an affiliated conference of the HCI International (HCII) conference. It provided an established international forum for the exchange and dissemination of scientific information related to social computing and social media, addressing a broad spectrum of issues expanding our understanding of current and future issues in ...

Added: December 3, 2025

Two Types of Filtrations for wK4 and Its Relatives

Kudinov A., Shapirovsky I., Studia Logica 2025 P. 1–25

We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For m > 0, let Lm be the logic defined by axiom ♦^{m+1}p → ♦p ∨ p. We construct quotient filtrations for the logics Lm, which implies that these logics and their tense counterparts have the finite model property. Then, we construct selective filtrations ...

Added: October 14, 2025

Влияние аксиомы связности на сложность модальной логики.

Kudinov A., Мясников К. М., Математика и теоретические компьютерные науки 2025 Т. 3 № 2 С. 58–84

The paper proves that for weakly transitive logics with the universal modality, whose formula satisfiability problem is in PSPACE, adding the connectedness axiom does not increase the complexity. Furthermore, an explicit algorithm solving this problem is presented. ...

Added: October 14, 2025

Логики с аксиомой конвергентности: сложность при малом числе переменных в языке

Rybakov M., Щербаков М. И., В кн.: Четырнадцатые Смирновские чтения по логике: материалы Междунар. науч. конф., Москва, 19-21 июня 2025 г.: М.: Издатель Александр Воробьев, 2025. С. 46–49.

Логики с аксиомой конвергентности: сложность при малом числе переменных в языке ...

Added: June 21, 2025

Сложность константных фрагментов ненормальных модальных логик

Kudinov A., Rybakov M., В кн.: Четырнадцатые Смирновские чтения по логике: материалы Междунар. науч. конф., Москва, 19-21 июня 2025 г.: М.: Издатель Александр Воробьев, 2025. С. 36–39.

Показано, что каждая модальная логика, содержащая классическую логику высказываний и содержащаяся в слабой логике Гжегорчика, имеет NP-трудную проблему выполнимости для константного фрагмента. В частности, константные фрагменты ненормальных модальных логик E, EM, EN и EMN являются coNP-полными. ...

Added: June 21, 2025

Advances in Modal Logic 2024. Short Papers

[б.и.], 2024.

The book contains short papers presented at AiML 2024. ...

Added: August 15, 2024

Advances in Modal Logic

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

Variations on the Kripke trick

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

Temporal Epistemic Logic for Agents with Delay in Awareness

Dolgorukov V., Popova E., , in: Logic Colloquium 2023, European Summer Meeting of the Association for Symbolic Logic, University of Milan, Italy 5—9 June 2023, Book of Abstracts.: Milan: University of Milan, 2023. P. 90–90.

We present a multi-agent logic for reasoning about knowledge in time which involves delays in the agent’s awareness. Awareness framework divides a common epistemic concept of knowledge into explicit and implicit ones. This division helps to avoid the problem of logical omniscience and proposes new instruments for analysis of resourcebounded agents reasoning. ...

Added: November 26, 2023

Dynamic Epistemic Logic for Budget-Constrained Agents

Dolgorukov V., Gladyshev M., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 20–23.

This abstract is based on recent work in [6]. We present a static (ELbc) and dynamic (DELbc) epistemic logic for budget-constrained agents. ELbc extends a standard multi-agent epistemic logic with expressions concerning agent’s budgets and formulas’ costs. DELbc extends ELbc with dynamic modality “[?iA]φ” which reads as “φ holds after i’s question whether a propositional ...

Added: November 26, 2023

Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames

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

Complexity of the variable-free fragment of the weak Grzegorczyk logic

Rybakov M., Агаджанян И. А., / arXiv. Серия 2211.14571 "Logic". 2022.

Доказывается PSPACE-трудность константных фрагментов всех логик, лежащих между K и wGrz ...

Added: December 5, 2022

On Strictly Positive Fragments of Modal Logics with Confluence

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