?
On algorithmic properties of propositional inconsistency-adaptive logics
Logic and Logical Philosophy. 2012. Vol. 21. No. 3. P. 209–228.
Odintsov S., Speranski S. O.
The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuN-r and CLuN-m , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Kazimirov D., Vitalii Gulevskii, Kroshnin A. et al., Mathematics 2026 Article 1136
The Hough transform (HT) is widely used in computer vision, tomography, and neural networks. Numerous algorithms for HT computation have been proposed, making their systematic comparison essential. However, existing comparative methodologies are either non-universal and limited to certain HT formulations, or task-oriented, relying on application-specific criteria that do not fully capture algorithmic properties. This paper ...
Added: May 28, 2026
Ivanashev Y., , in: 19th Annual Conference, TAMC 2025, Jinan, China, September 19–21, 2025, Proceedings. Theory and Applications of Models of Computation. Lecture Notes in Computer Science (LNCS, volume 16084)Vol. 16084.: Springer, 2026. P. 15–24.
The class TotP consists of functions that count the number of all paths of a nondeterministic polynomial-time Turing machine. In this paper, we give a predicate based definition of TotP, analogous to a standard definition of #P. From a new characterization of TotP it follows that many well known #P problems belong to TotP, and ...
Added: January 20, 2026
Springer, 2026.
This book constitutes the proceedings of the 19th Annual Conference on Theory and Applications of Models of Computation, TAMC 2025, which was held in Jinan, China, during September 19–21, 2025. ...
Added: January 20, 2026
Speranski S. O., Studia Logica 2013 Vol. 101 No. 6 P. 1237–1262
In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way. ...
Added: December 27, 2025
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
Onoprienko A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 № 527 С. 206–216
We study the algorithmic complexity of the cooperative card game Hanabi. The feature of Hanabi is that players see each other’s cards but not their own, and exchange information through hints. Even in the model with one player who has full information about the deck, Hanabi remains NP-hard. We found the minimal parameters ofthe game ...
Added: November 23, 2025
Melman A., Dzhanashia K., Evsyutin O., Computer Standards and Interfaces 2026 Vol. 96 Article 104066
The cybersecurity problems remain extremely relevant in the modern world. Every year image steganography and watermarking schemes are proposed that solve the problems of hidden confidential data transfer and image authentication, respectively. The authors attempt to maximize the main embedding indicators, such as capacity, invisibility, and robustness. However, in practice, the time effectiveness of embedding ...
Added: September 3, 2025
Ivanashev Y., / Series Computer Science "arxiv.org". 2025.
Added: July 29, 2025
Duginov O., Dmitriy Malyshev, Dmitriy Mokeev, Discrete Applied Mathematics 2025 Т. 373 С. 179–195
Given a graph, the (induced) P_k-partition problem is to decide whether its vertex set can be partitioned into subsets, each of which induces (the k-path) a k-vertex subgraph with a Hamiltonian path. We show that these problems are NP-complete for planar subcubic bipartite (H_1,H_2,...,H_ℓ)-free graphs of girth g, for any k,g≥3,l≥1, where Hi is obtained ...
Added: May 3, 2025
Торопкина В.А., В кн.: Научное наследие Б.Н. Головина в свете актуальных проблем современного языкознания (к 100-летию со дня рождения Б.Н. Головина): Сборник статей по материалам Международной научной конференции.: Н. Новгород: Деком, 2016. С. 370–374.
The article discusses the concept of evaluation and expressivity in modern media texts,
characterizes the specificity of derivational neologisms as a means of formation of this linguistic
categories. The specific features of expression of expressive and evaluative semantics of different
types of neologisms within the media and political discourse are analyzed. ...
Added: September 30, 2020
Торопкина В.А., Рацибурская Л. В., Вестник Балтийского федерального университета им. И. Канта. Серия: Филология, педагогика, психология (Российская Федерация) 2019 № 2 С. 41–51
The authors analyse the process of word formation in Russian media as a reflection of the global trends in modern communication. A structural and semantic analysis of word formation is done to identify the most productive models. The authors employ pragmatic analysis to determine the role of neologisms in media texts. The following phenomena are ...
Added: September 29, 2020
Петрова Е. С., Землянухина И. В., Евразийское Научное Объединение 2019 № 4-5 (50) С. 296–299
Статья посвящена специфике перевода научно-популярного кинотекста с английского языка на русский. Материалом для анализа выступает документальный научно-популярный телесериал производства Discovery. Авторами рассматривается проблема передачи экспрессивности в переводном тексте, предназначенном для озвучивания. Выявляются типы трансформаций, способствующих и препятствующих передаче экспрессивности. ...
Added: October 22, 2019
Zirko A., Человек 2019 № 2 С. 114–129
In this article a brief history of vocal practices in psychotherapy, a model of types of vocalizations and their empirical research in self-expression and self-inquiry are introduced. The participants of this research were divided into two groups. In one group they were offered to express themselves with sounds of their voices in the situation of ...
Added: August 29, 2019