RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Pakhomov Fedor Nikolaevich

Total publications: 8
Scientific articles: 8
in MathSciNet: 3
in zbMATH: 2
in Web of Science: 4
in Scopus: 5
Cited articles: 3
Citations in Math-Net.Ru: 5
Citations in MathSciNet (by Sep 2017): 2
Citations in Web of Science: 6
Citations in Scopus: 6
Presentations: 31

Number of views:
This page:739
Abstract pages:444
Full texts:29
References:57
Candidate of physico-mathematical sciences
Birth date: 15.07.1990
E-mail:
Keywords: mathematical logic, proof theory, modal logic, decision problems.

Subject:

Proof theory, modal logic, decision problems.


http://www.mathnet.ru/eng/person64334
http://scholar.google.com/citations?user=Srnnd-oAAAAJ&hl=en
http://zbmath.org/authors/?q=ai:pakhomov.f-n
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=1003226
http://www.researcherid.com/rid/Q-5602-2016
http://www.scopus.com/authid/detail.url?authorId=55457524000

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


Articles

1. Fedor Pakhomov, “Solovay’s completeness without fixed points”, Logic, Language, Information, and Computation, 24th International Workshop, WoLLIC 2017 (London, UK, July 18-21, 2017), Lecture Notes in Comput. Sci., 10388, eds. Kennedy J., de Queiroz R., Springer, Berlin, 2017, 281–294  mathnet  crossref  scopus
2. F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199  mathnet  crossref  crossref  mathscinet  isi  elib  scopus
3. F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math., 289 (2015), 194–212  mathnet  crossref  crossref  isi (cited: 2)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 3)
4. Fedor Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”, Arch. Math. Logic, 53:7 (2014), 949–967  mathnet  crossref  mathscinet  zmath  isi  scopus (cited: 1)
5. F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math., 203:8 (2012), 1211–1229  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 4)  elib (cited: 2)  elib (cited: 2)  scopus (cited: 2)

Proceedings

6. F. Pakhomov, “Ordinal Notations and Fundamental Sequences in Caucal Hierarchy”, Logic Colloquium, Logic, Algebra and Truth Degrees. Abstract Booklet (Vienna, July 14–19), Kurt Gödel Society, 2014, 88
7. Fedor Pakhomov, “Complexity of Fragments of the Logic GLP”, Proof Theory, Modal Logic and Re ection Principles (Mexico City, September 29 – October 2, 2014), ITAM, 2014, 4

ArXiv

8. Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036

Presentations in Math-Net.Ru
1. Solovay’s completeness without fixed points
F. Pakhomov
Workshop on Proof Theory, Modal Logic and Reflection Principles
October 20, 2017 12:50   
2. Об интерпретациях арифметики Пресбургера в самой себе
A. Zapryagaev, F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
October 3, 2017 18:30
3. Об индукции в теориях итерированных определений истины
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
October 2, 2017 18:35
4. Цепи из утверждений о медленной непротиворечивости
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
April 3, 2017 18:30
5. О неразрешимых элементарных теориях полугрупп со свободным одноместным предикатом
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
February 28, 2017 18:30
6. О новом классе теорий, удовлетворяющих второй теореме Гёделя о неполноте
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
December 19, 2016 18:30
7. Linear $GLP$-algebras and their elementary theories
F. N. Pakhomov
Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2016
November 16, 2016 14:15   
8. Новое доказательство теоремы Соловея об арифметической полноте логики GL
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
November 15, 2016 18:30
9. Семантика квазидоказуемости для полных по Крипке расширений логики GL
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
November 8, 2016 18:30
10. О новом доказательстве теоремы Соловея
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
September 26, 2016 18:30
11. Predicative subsystem of second-order arithmetic. Lecture 10
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
April 29, 2016 17:30   
12. Predicative subsystem of second-order arithmetic. Lecture 9
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
April 22, 2016 17:30   
13. Системы ординальных обозначений в иерархии Кукаля
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
April 19, 2016 18:30
14. Predicative subsystem of second-order arithmetic. Lecture 8
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
April 15, 2016 17:30   
15. Predicative subsystem of second-order arithmetic. Lecture 7
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
April 1, 2016 18:00   
16. Predicative subsystem of second-order arithmetic. Lecture 6
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
March 25, 2016 17:30   
17. Predicative subsystem of second-order arithmetic. Lecture 5
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
March 18, 2016 17:30   
18. Predicative subsystem of second-order arithmetic. Lecture 4
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
March 11, 2016 17:30   
19. Predicative subsystem of second-order arithmetic. Lecture 3
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
March 4, 2016 17:30   
20. Predicative subsystem of second-order arithmetic. Lecture 2
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
February 26, 2016 17:30   
21. Predicative subsystem of second-order arithmetic. Lecture 1
F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016
February 19, 2016 17:30   
22. Биинтерпретируемость для расширений ZF
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
February 15, 2016 18:30
23. О некоторых нестандартных предикатах доказуемости для формальной арифметики Пеано
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
October 27, 2015 18:30
24. Итерации медленной непротиворечивости. Часть 2
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
October 26, 2015 18:30
25. Итерации медленной непротиворечивости. Часть 1
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Proof Theory"
October 19, 2015 18:30
26. Lambda calculus, or computational proof theory. Lecture 9
F. N. Pakhomov
Special course "Lambda calculus, or computational proof theory", 2015
April 15, 2015 18:00   
27. Decidability of the elementary theory of the free GLP-algebra generated by constants.
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
March 3, 2015 18:30
28. On the decidability of elementary theories of some ordinal notation systems based on the logic GLP
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
February 24, 2015 18:30
29. On the computational complexity of the closed fragment of the provability logic GLP
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
April 9, 2013 18:30
30. On the decidability of elementary theories of provability algebras and their fragments
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
October 23, 2012 18:30
31. On a class of decidable monadic theories of graphs
F. N. Pakhomov
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
March 20, 2012 18:30

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017