Advances in Modal Logic 2010, Extended Abstracts

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: Oct 7, 2019

Dynamics of Information Systems: Mathematical Foundations

Iss. 20. NY: Springer, 2012.

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

Added: Dec 19, 2012

The almost necessity operator

Zolin E. Notre Dame Journal of Formal Logic. 2019.

Added: Jun 14, 2018

Topological modal logics with difference modality

Kudinov A. In bk.: Advances in Modal Logic, Volume 6. L.: College Publications, 2006. P. 319-332.

Added: Feb 27, 2013

Squares of modal logics with additional connectives

Shehtman V. B. Russian Mathematical Surveys. 2012. Vol. 67. No. 4. P. 721-777.

This paper studies two-dimensional modal logics of a special type, 'Segerberg squares'. They are defined as the usual squares of modal logics with additional connectives corresponding to the diagonal symmetry and the two projections onto the diagonal. For these logics a finite axiomatization is constructed in many cases, and completeness and the finite model property are proved. A translation of Segerberg squares into classical predicate logic is constructed. Bibliography: 21 titles.

Added: Feb 4, 2013

Positive provability logic for uniform reflection principles

Beklemishev L. D. arxiv.org. math. Cornell University, 2013. No. arXiv:1304.4396.

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 modalities labeled by natural numbers and \omega, where \omega corresponds to the full uniform reflection schema, whereas n<\omega corresponds to its restriction to arithmetical \Pi_{n+1}-formulas. This calculus is shown to be complete w.r.t. a suitable class of finite Kripke models and to be decidable in polynomial time.

Added: Nov 22, 2013

Leo Esakia on Duality in Modal and Intuitionistic Logics

Edited by: G. Bezhanishvili. Springer, 2014.

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 discuss Leo’s original contributions and consequent developments that have shaped the current state of the field.

Added: Mar 5, 2014

Advances in Modal Logic

Edited by: T. Bolander, T. Brauner, S. Ghilardi. Iss. 9. L.: College Publications, 2012.

Advances in Modal Logic is a bi-annual international conference and book series in Modal Logic. The aim of the conference series is to report on important new developments in pure and applied modal logic, and to do so at varying locations throughout the world. The book series is based on the conferences. Please consult thebackground pages for further details.

Added: Feb 21, 2013

Modal logic of some products of neighbourhood frames

Kudinov A. In bk.: Advances in Modal Logic. Iss. 9. L.: College Publications, 2012. P. 286-294.

We consider modal logics of products of neighborhood frames and prove that for any pair L and L' of logics from set {S4, D4, D, T} modal logic of products of L-neighborhood frames and L'-neighborhood frames is the fusion of L and L'.

Added: Feb 21, 2013

Topology, Algebra and Categories in Logic (TACL 2011)

Edited by: L. Santocanale, N. Olivetti, Y. Lafont. Marseille: 2011.

Added: Feb 27, 2013

Bounded limit cycles of polynomial foliations of ℂP²

Goncharuk N. B., Kudryashov Y. arxiv.org. math. Cornell University, 2015. No. 1504.03313.

In this article we prove in a new way that a generic polynomial vector field in ℂ² possesses countably many homologically independent limit cycles. The new proof needs no estimates on integrals, provides thinner exceptional set for quadratic vector fields, and provides limit cycles that stay in a bounded domain.

Added: Apr 15, 2015

Анализ эволюции лаговых структур в задачах экономического прогнозирования

Вавилов Б., Моторин В. И. Вопросы радиоэлектроники. 1983. № 3. С. 44-51.

Added: Mar 5, 2015

Системные проблемы надёжности, качества, информационно-телекоммуникационных и электронных технологий в инновационных проектах (ИННОВАТИКА - 2011). Часть 1

Ч. 1. М.: Энергоатомиздат, 2011.

Added: Feb 7, 2013

Short lists with short programs in short time

Bauwens B., Makhlin A., Vereshchagin N. et al. Electronic Colloquium on Computational Complexity. Technical report. Hasso-Plattner-Institut, 2013. No. TR13-007.

Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any universal machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a $O(\log |x|)$-short program for $x$. We also show that there exist computable functions that map every $x$ to a list of size $O(|x|^2)$ containing a $O(1)$-short program for $x$ and this is essentially optimal because we prove that such a list must have size $\Omega(|x|^2)$. Finally we show that for some machines, computable lists containing a shortest program must have length $\Omega(2^{|x|})$.

Added: Dec 14, 2013

Laminations from the Main Cubioid

Timorin V., Blokh A., Oversteegen L. et al. arxiv.org. math. Cornell University, 2013. No. 1305.5788.

According to a recent paper \cite{bopt13}, polynomials from the closure $\ol{\phd}_3$ of the {\em Principal Hyperbolic Domain} ${\rm PHD}_3$ of the cubic connectedness locus have a few specific properties. The family $\cu$ of all polynomials with these properties is called the \emph{Main Cubioid}. In this paper we describe the set $\cu^c$ of laminations which can be associated to polynomials from $\cu$.

Added: Oct 6, 2013

Анализ динамики структурных параметров в моделях экономического прогнозирования с элементами адаптации

Моторин В. И. Вопросы радиоэлектроники. 1984. № 2. С. 28-36.

Added: Mar 5, 2015

Консенсус в социальной сети со сложными узлами

Федянин Д. Н., Чхартишвили А. Г. Управление большими системами: сборник трудов. 2016. Т. 64. С. 137-150.

Added: Jun 1, 2018

Асимптотические разложения решений пятого уравнения Пенлеве

Парусникова А. В., Брюно А. Д. Институт прикладной математики им. М.В. Келдыша Российской академии наук, 2010. № 39.

Added: Apr 18, 2012

Вопросы оптимизации проектирования РЭС с учетом ЭМС

Грачев Н. Н., Лазарев Д. В. Современная наука: актуальные проблемы теории и практики. Серия: Естественные и технические науки. 2012. № 3. С. 31-39.

Added: Nov 10, 2012

SCANER: отслеживая энергетические горизонты

Макаров А., Митрова Т. А., Кулагин В. А. ТЭК. Стратегии развития. 2011. № 1. С. 71-77.

Added: Sep 18, 2012

Математическое моделирование социальных процессов

Edited by: А. Михайлов Вып. 14. М.: Социологический факультет МГУ, 2012.

Added: Mar 14, 2013

Выбор регрессии, максимизирующий несмещенную оценку коэффициента детерминации

Ершов Э. Б. Прикладная эконометрика. 2008. № 4. С. 71-83.

A form for an unbiased estimate of the coefficient of determination of a linear regression model is obtained. It is calculated by using a sample from a multivariate normal distribution. This estimate is proposed as an alternative criterion for a choice of regression factors.

Added: Oct 14, 2012

Conjugacy classes in discrete Heisenberg groups

Roman Budylin. arxiv.org. math. Cornell University, 2014

We study some extension of a discrete Heisenberg group coming from the theory of loop-groups and find invariants of conjugacy classes in this group. In some cases including the case of the integer Heisenberg group we make these invariants more explicit.

Added: Nov 14, 2014