Topology, Algebra and Categories in Logic (TACL 2011)
Marseille : 2011.
Academic editor: L. Santocanale, N. Olivetti, Y. Lafont
Kudinov A., , , in : Topology, Algebra and Categories in Logic (TACL 2011). : Marseille : [б.и.], 2011. P. 261-264.
We consider propositional normal unimodal pretransitive logics, i.e., logics with expressible `transitive' modality. There is a long-standing open problem about the finite model property (fmp) and decidability of pretransitive logics, in particular - for the logics K^m_n = K+^m p -> ^n p, n>m>1. ...
Added: February 27, 2013
, Notre Dame Journal of Formal Logic 2019
We introduce a modal operator of weak necessity, inspired by the canonical model construction for the non-contingency logic developed by Humberstone and Kuhn in 1995. This operator, when applied to a proposition, means that all consequences of a given proposition are non-contingent. We show that, although the weak necessity has many properties inherent to normal ...
Added: June 14, 2018
, , / Cornell University. Series math "arxiv.org". 2012. No. ArXiv:1210.7317.
Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold Simmons and Leo Esakia. They have observed that the dual $\Diamond$ modality, corresponding to consistency in the context of formal arithmetic, ...
Added: February 12, 2013
College Publications, 2014
Volume 10 contains invited and contributed papers from the tenth conference on "Advances in Modal logic," held in Groningen, the Netherlands, in August 2014. ...
Added: November 7, 2014
, Moscow Mathematical Journal 2005 Vol. 5 No. 2 P. 477-492
Классический результат о топологической семантике модальных логик, принадлежащий МакКинси и Тарскому (и часто называемый теоремой Тарского), состоит в полноте логики S4 по отношению к интерпретациям в пространстве R^n для любого n. В последнее время разные авторы рассматривали динамические топологические логики, которые интерпретируются в динамических пространствах (абстрактных динамических системах). Динамическое пространство – это топологическое пространство вместе с непрерывной функцией на нем. В работе Артёмова, Даворен и ...
Added: February 27, 2013
This volume is dedicated to Leo Esakia’s contributions to the theory of modal and intuitionistic systems. Leo Esakia was one of the pioneers in developing duality theory for modal and intuitionistic logics, and masterfully utilizing it to obtain some major results in the area. The volume consists of 10 chapters, written by leading experts, that ...
Added: March 5, 2014
, Annals of Pure and Applied Logic 2014 Vol. 165 No. 1 P. 82-105
We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with ...
Added: November 21, 2013
L. : College Publications, 2010
Added: February 27, 2013
Proceedings of 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT'17) / April 5-7, 2017
Barcelona : IEEE, 2017
International Conference on Control, Decision and Information Technologies. ...
Added: January 17, 2018
Интегрированные модели и мягкие вычисления в искусственном интеллекте. Сб. научных трудов VII-й Международной научно-практической конференции (Коломна, 20-22 мая 2013)
М. : Физматлит, 2013
Conference is devoted to application of the integrated models and soft computing in artificial intelligence. ...
Added: May 26, 2013
, , , IOSR Journal of Computer Engineering (IOSR-JCE) 2017 Vol. 19 No. 3 P. 113-121
The paper deals with the Forrester’s approach to analysis of heart electrical dynamics based on the hypothesis that heart belongs to the class of Complex Systems and its dynamics can be described by coupled Van der Pol differential equations with a time lag. The chain of such equations suggested by Ginzburg and Landau was used ...
Added: June 13, 2018
, European Journal of Operational Research 2009 Vol. 198 No. 1 P. 102-112
Added: July 31, 2012
, , et al., Physica A: Statistical Mechanics and its Applications 2014 Vol. 413 No. 1 P. 59-70
A general approach to measure statistical uncertainty of different filtration techniques for market network analysis is proposed. Two measures of statistical uncertainty are introduced and discussed. One is based on conditional risk for multiple decision statistical procedures and another one is based on average fraction of errors. It is shown that for some important cases ...
Added: July 19, 2014
М. : ИКИ РАН, 2011
Added: March 26, 2013
, , Дискретная математика 2017 Т. 29 № 3 С. 114-125
Задача о независимом множестве для заданного обыкновенного графа состоит в вычислении размера наибольшего множества его попарно несмежных вершин. Предлагается новый способ редукции графов. С его помощью получено новое доказательство NP-полноты задачи о независимом множестве в классе планарных графов и доказана NP-полнота данной задачи в классе плоских графов, имеющих только треугольные внутренние грани, с максимальной степенью ...
Added: September 7, 2017
Trends in Biomathematics: Modeling Cells, Flows, Epidemics, and the Environment. Selected Works from the BIOMAT Consortium Lectures, Szeged, Hungary, 2019
This volume offers a collection of carefully selected, peer-reviewed papers presented at the BIOMAT 2019 International Symposium, which was held at the University of Szeged, Bolyai Institute and the Hungarian Academy of Sciences, Hungary, October 21st-25th, 2019. The topics covered in this volume include tumor and infection modeling; dynamics of co-infections; epidemic models on networks; ...
Added: March 11, 2021
, Journal of Applied and Industrial Mathematics 2020 Vol. 14 No. 4 P. 706-721
The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...
Added: January 30, 2021
Lanham : University Press of America, 2012
The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...
Added: February 13, 2013
, , Сибирский журнал индустриальной математики 2013 Т. XVI № 4 С. 111-120
The paper considers the problem of determining the rate of cooling of metal during solidification at the intersection of the liquidus temperature under intense heat sink from the surface. The solution to this problem it is necessary to determine the process conditions, the boundary and initial conditions for which it is possible to get new ...
Added: November 17, 2013
Increasing the performance of a Mobile Ad-hoc Network using a game-theoretic approach to drone positioning
, , et al., Vestnik Sankt-Peterburgskogo Universiteta, Prikladnaya Matematika, Informatika, Protsessy Upravleniya 2019 Vol. 15 No. 1 P. 22-38
We describe a novel game-theoretic formulation of the optimal mobile agents’ placement problem which arises in the context of Mobile Ad-hoc Networks (MANETs). This problem is modelled as a sequential multistage game. The definitions of both the Nash equilibrium and cooperative solution are given. A modification was proposed to ensure the existence of a Nash ...
Added: March 13, 2020
, , Дискретный анализ и исследование операций 2008 Т. 15 № 1 С. 3-10
Доказывается полиномиальная разрешимость задачи о независимом множестве для бесконечного семейства подмножеств класса планарных графов. ...
Added: August 31, 2012
, , , Bernoulli: a journal of mathematical statistics and probability 2015 P. 740-759
In this paper, we tackle the problem of comparing distributions of random variables and defining a mean pattern between a sample of random events. Using barycenters of measures in the Wasserstein space, we propose an iterative version as an estimation of the mean distribution. Moreover, when the distributions are a common measure warped by a ...
Added: October 13, 2018
, Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Совершенствование преподавания дисциплин математического цикла на основе инвариантов, необходимых для преподавания курса «Эконометрика» экономистам-бакалаврам
, , Вестник Нижегородского университета им. Н.И. Лобачевского. Серия: Социальные науки 2019 Т. 55 № 3 С. 183-189
The article describes a method that allows to improve the content of disciplines of the mathematical cycle by dividing them into invariant (general) and variable parts. The invariants were identified for such disciplines as «Linear algebra», «Mathematical analysis», «Probability theory and mathematical statistics» delivered to Bachelors program students of economics at several universities. Based on ...
Added: January 28, 2020
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
, Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...
Added: April 7, 2014