Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kolmakov, Evgeny Aleksandrovich

Total publications: 7 (7)
in MathSciNet: 2 (2)
in zbMATH: 3 (3)
in Web of Science: 4 (4)
in Scopus: 5 (5)
Cited articles: 1
Citations in Web of Science: 2
Citations in Scopus: 2
Presentations: 5

Number of views:
This page:286
E-mail:
Keywords: mathematical logic, proof theory, formal arithmetic, computability theory

Subject:

mathematical logic, proof theory, formal arithmetic, computability theory


http://www.mathnet.ru/eng/person131340
List of publications on Google Scholar
https://zbmath.org/authors/?q=ai:kolmakov.e-a
https://mathscinet.ams.org/mathscinet/MRAuthorID/1121051
ISTINA http://istina.msu.ru/workers/8067708
http://orcid.org/0000-0002-6526-9719
http://www.researcherid.com/rid/X-7478-2018
https://www.scopus.com/authid/detail.url?authorId=56406419100

Full list of publications:
| scientific publications | by years | by types | by times cited in WoS | by times cited in Scopus | common list |



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

   2020
2. Evgeny Kolmakov, “Local reflection, definable elements and 1-provability”, Arch. Math. Logic, 59 (2020), 979–996  mathnet  crossref  mathscinet  isi  scopus;

   2019
3. E. A. Kolmakov, L. D. Beklemishev, “Axiomatization of provable $n$-provability”, J. Symb. Log., 84:2 (2019), 849–869  mathnet  crossref  mathscinet  isi (cited: 2)  scopus (cited: 2)

   2018
4. E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing provable $n$-provability”, Dokl. Math., 98:3 (2018), 582–585  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus

   2016
5. 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  mathnet  crossref  zmath  elib  elib  scopus

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

   2014
7. 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
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022