?
Topological completeness of the provability logic GLP
Annals of Pure and Applied Logic. 2013. Vol. 164. No. 12. P. 1201-1223.
Beklemishev L. D., Gabelaia D.
Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces are called GLP-spaces whenever they satisfy all the axioms of GLP. We develop some constructions to build nontrivial GLP-spaces and show that GLP is complete w.r.t. the class of all GLP-spaces. © 2013 Elsevier B.V.
Shamkanov D. S., Review of Symbolic Logic 2020 Vol. 13 No. 4 P. 776-796
We consider Hilbert-style non-well-founded derivations in the Gödel-Löb provability logic GL and establish that GL with the obtained derivability relation is globally complete for algebraic and neighbourhood semantics. ...
Added: December 20, 2019
Berger G., Beklemishev L. D., Tompits H., / Cornell University. Series math "arxiv.org". 2016. No. 1601.02857.
We consider a many-sorted variant of Japaridze's polymodal provability logic GLP. In this variant,
propositional variables are assigned sorts n< omega,
where variables of sort n are arithmetically interpreted as Pi_{n+1}-sentences of the arithmetical hierarchy. We prove that the many-sorted variant is arithmetically complete with respect to this interpretation. ...
Added: March 13, 2016
Berger G., Beklemishev L. D., Tompits H., Logic Journal of the IGPL 2018 Vol. 26 No. 5 P. 505-538
We consider a many-sorted variant of Japaridze’s polymodal provability logic (GLP). In this variant, which is denoted GLP∗, propositional variables are assigned sorts n≤ω, where variables of finite sort n<ω are interpreted as Π_{n+1}-sentences of the arithmetical hierarchy, while those of sort ω range over arbitrary ones. We prove that GLP∗is arithmetically complete with respect to this interpretation. Moreover, we ...
Added: February 14, 2019
L. Beklemishev, Flaminio T., Studia Logica 2016 Vol. 104 No. 1 P. 1-46
Franco Montagna, a prominent logician and one of the leaders of the Italian school on Mathematical Logic, passed away on February 18, 2015. We survey some of his results and ideas in the two disciplines he greatly contributed along his career: provability logic and many-valued logic. ...
Added: March 13, 2016
Beklemishev L. D., Fernandez D., Joosten J., / Cornell University. Series math "arxiv.org". 2012.
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength.
We shall provide a reduction of these logics to GLP(\omega) yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of ...
Added: February 12, 2013
Shamkanov D. S., Sbornik Mathematics 2016 Vol. 207 No. 9 P. 1344-1360
We present a new justification logic corresponding to the Gödel-Löb provability logic GL and prove the realization theorem connecting these two systems in such a way that all the realizations provided in the theorem are normal. ...
Added: November 25, 2016
Shamkanov D. S., Mathematical notes 2014 Vol. 96 No. 4 P. 575-585
Sequent calculus for the provability logic GL is considered, in which provability is based on the notion of a circular proof. Unlike ordinary derivations, circular proofs are represented by graphs allowed to contain cycles, rather than by finite trees. Using this notion, we obtain a syntactic proof of the Lyndon interpolation property for GL. ...
Added: August 13, 2014
Shamkanov D. S., Logic Journal of the IGPL 2015 Vol. 23 No. 5 P. 789-815
We present a proof system for the provability logic GLP in the formalism of nested sequents and prove the cut elimination theorem for it. As an application, we obtain the reduction of GLP to its important fragment called J syntactically. ...
Added: July 2, 2015
Shamkanov D. S., Proceedings of the Steklov Institute of Mathematics 2011 Vol. 274 No. 1 P. 303-316
We study interpolation properties of provability logics. We prove the Lyndon interpolation for GL and the uniform interpolation for GLP. ...
Added: February 6, 2013
В. Л. Попов, Математические заметки 2017 Т. 102 № 1 С. 72-80
Мы доказываем, что аффинно-треугольные подгруппы являются борелевскими подгруппами групп Кремоны. ...
Added: May 3, 2017
Красноярск : ИВМ СО РАН, 2013
Труды Пятой Международной конференции «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): ...
Added: November 18, 2013
Grines V., Gurevich E., Pochinka O., Russian Mathematical Surveys 2017 Vol. 71 No. 6 P. 1146-1148
In the paper a Palis problem on finding sufficient conditions on embedding of Morse-Smale diffeomorphisms in topological flow is discussed. ...
Added: May 17, 2017
Borzykh D., ЛЕНАНД, 2021
Книга представляет собой экспресс-курс по теории вероятностей в контексте начального курса эконометрики. В курсе в максимально доступной форме изложен тот минимум, который необходим для осознанного изучения начального курса эконометрики. Данная книга может не только помочь ликвидировать пробелы в знаниях по теории вероятностей, но и позволить в первом приближении выучить предмет «с нуля». При этом, благодаря доступности изложения и небольшому объему книги, ...
Added: February 20, 2021
Kotelnikova M. V., Aistov A., Вестник Нижегородского университета им. Н.И. Лобачевского. Серия: Социальные науки 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
Okounkov A., Aganagic M., Moscow Mathematical Journal 2017 Vol. 17 No. 4 P. 565-600
We associate an explicit equivalent descendent insertion to any relative insertion in quantum K-theory of Nakajima varieties.
This also serves as an explicit formula for off-shell Bethe eigenfunctions for general quantum loop algebras associated to quivers and gives the general integral solution to the corresponding quantum Knizhnik Zamolodchikov and dynamical q-difference equations. ...
Added: October 25, 2018
Danilov B.R., Moscow University Computational Mathematics and Cybernetics 2013 Vol. 37 No. 4 P. 180-188
The article investigates a model of delays in a network of functional elements (a gate network) in an arbitrary finite complete basis B, where basis elements delays are arbitrary positive real numbers that are specified for each input and each set of boolean variables supplied on the other inputs. Asymptotic bounds of the form τ ...
Added: December 2, 2019
Amerik E., Verbitsky M., / Cornell University. Series arXiv "math". 2021.
An MBM locus on a hyperkahler manifold is the union of all deformations of a minimal rational curve with negative self-intersection. MBM loci can be equivalently defined as centers of bimeromorphic contractions. It was shown that the MBM loci on deformation equivalent hyperkahler manifolds are diffeomorphic. We determine the MBM loci on a hyperkahler manifold ...
Added: April 7, 2022
Litvin Y. V., Абрамов И. В., Технологии техносферной безопасности 2016 № 66
Advanced approach to the assessment of a random time of arrival fire fighting calculation on the object of protection, the time of their employment and the free combustion. There is some quantitative assessments with the review of analytical methods and simulation ...
Added: August 27, 2016
Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Arzhantsev I., Journal of Lie Theory 2000 Vol. 10 No. 2 P. 345-357
Added: July 8, 2014
Levashov M., Кухаренко А. В., Вопросы защиты информации 2018 № 2 С. 66-71
Рассматривается статистическая модель одного этапа системы фрод-мониторинга транзакций в интернет-банкинге. Построен и рассчитан близкий к отношению правдоподобия критерий отсева мошеннических транзакций. Для выборочных распределений, полученных на выборке объема в 1 млн реальных транзакций, вычислены параметры эффективности этого критерия. ...
Added: June 14, 2018
Beklemishev L. D., Оноприенко А. А., Математический сборник 2015 Т. 206 № 9 С. 3-20
We formulate some term rewriting systems in which the number of computation steps is finite for each output, but this number cannot be bounded by a provably total computable function in Peano arithmetic PA. Thus, the termination of such systems is unprovable in PA. These systems are derived from an independent combinatorial result known as the Worm ...
Added: March 13, 2016
Min Namkung, Younghun K., Scientific Reports 2018 Vol. 8 No. 1 P. 16915-1-16915-18
Sequential state discrimination is a strategy for quantum state discrimination of a sender’s quantum
states when N receivers are separately located. In this report, we propose optical designs that can
perform sequential state discrimination of two coherent states. For this purpose, we consider not
only binary phase-shifting-key (BPSK) signals but also general coherent states, with arbitrary prior
probabilities. Since ...
Added: November 16, 2020
Кокоулина М. В., Епифанова А. С., Pelinovsky E. et al., Труды НГТУ им. Р.Е. Алексеева 2020 № 3 С. 28-41
Purpose: to analyze the dynamics of COVID-19 development using a generalized stochastic logistic equation to esti-mate the number of probable peaks in coronavirus incidence and to evaluate the nature of the scatter of the generalized logistic model coefficients.
Design/methodology/approach: we use a logistic model based on a generalized first-order logistic equation. The data on the incidence ...
Added: September 29, 2020