Persons: Kolmakov, Evgeny Aleksandrovich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Kolmakov, Evgeny Aleksandrovich

Statistics Math-Net.Ru
in MathSciNet:	2 (2)
in zbMATH:	4 (4)
in Web of Science:	4 (4)
in Scopus:	5 (5)

Candidate of physico-mathematical sciences

E-mail:

Keywords:

mathematical logic, proof theory, formal arithmetic, computability theory

Subject:

mathematical logic, proof theory, formal arithmetic, computability theory

https://www.mathnet.ru/eng/person131340

List of publications on Google Scholar

https://zbmath.org/authors/ai:kolmakov.e-a

https://mathscinet.ams.org/mathscinet/MRAuthorID/1121051

ISTINA

https://istina.msu.ru/workers/8067708

https://orcid.org/0000-0002-6526-9719

https://www.webofscience.com/wos/author/record/X-7478-2018

https://www.scopus.com/authid/detail.url?authorId=56406419100

List of publications:

scientific publications

by years

by types

by times cited

common list

		Citations (Crossref Cited-By Service + Math-Net.Ru)


2022
1.	E. A. Kolmakov, “On Shavrukov’s non-isomorphism theorem for diagonalizable algebras”, The Review of Symbolic Logic, 2022 (Published online) https://www.cambridge.org/core/journals/review-of-symbolic-logic/article/on-shavrukovs-nonisomorphism-theorem-for-diagonalizable-algebras/127743F3DF59DC3DC83261011E861FCC

2021
2.	E. A. Kolmakov, “On a strengthening of the non-isomorphism theorem for provability algebras”, Dokl. Math., 104:1 (2021), 180–183

2020
3.	Evgeny Kolmakov, “Local reflection, definable elements and 1-provability”, Arch. Math. Logic, 59 (2020), 979–996 ;

2019
4.	E. A. Kolmakov, L. D. Beklemishev, “Axiomatization of provable $n$-provability”, J. Symb. Log., 84:2 (2019), 849–869	3 ^[x]

2018
5.	E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing provable $n$-provability”, Dokl. Math., 98:3 (2018), 582–585

2016
6.	E. A. Kolmakov, S. S. Marchenkov, “On maximal subgroups of the group of recursive permutations”, Moscow Univ. Comput. Math. Cybernet., 40:3 (2016), 128–132

2015
7.	E. A. Kolmakov, “Metric generalization of classification algorithms based on formal concept analysis”, Comput. Math. Model., 26:4 (2015), 566–576

2014
8.	E. Kolmakov, “Metric Generalization and Modification of Classification Algorithms Based on Formal Concept Analysis”, Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at ECAI 2014), v. 1257, eds. S. Kuznetsov, A. Napoli, S. Rudolph, CEUR Workshop Proceedings, Prague, 2014, 43–50 http://ceur-ws.org/Vol-1257/paper5.pdf

Presentations in Math-Net.Ru

1.	О разрешимости ∀∃-теории решётки Σ₁-предложений арифметики Пеано E. A. Kolmakov Seminars "Proof Theory" and "Logic Online Seminar" June 24, 2019 18:30
2.	О разрешимости ∀∃-теории решётки Σ₁-предложений арифметики Пеано E. A. Kolmakov Seminars "Proof Theory" and "Logic Online Seminar" May 20, 2019 18:30
3.	О формулах, $n$-доказуемость которых выводима в арифметике Пеано E. A. Kolmakov "Algorithmic problems in algebra and logic" (S.I.Adian seminar) April 10, 2018 18:30
4.	Аксиоматизация доказуемой 1-доказуемости E. A. Kolmakov Seminars "Proof Theory" and "Logic Online Seminar" October 30, 2017 18:30
5.	Axiomatizing provable 1-provability E. Kolmakov Workshop on Proof Theory, Modal Logic and Reflection Principles October 19, 2017 14:50

Organisations

Registration to the website

Logotypes