Pakhomov Fedor Nikolaevich

Presentations in Math-Net.Ru

1. Dilators, Reflection, and Forcing: A Proof-Theoretic Analysis of $\Pi^1_1-\mathsf{CA}_0$ (continuation)
   F. N. Pakhomov
   Seminars "Proof Theory" and "Logic Online Seminar"
   March 27, 2023 18:30   
2. Dilators, Reflection, and Forcing: A Proof-Theoretic Analysis of $\Pi^1_1-\mathsf{CA}_0$
   F. N. Pakhomov
   Seminars "Proof Theory" and "Logic Online Seminar"
   March 20, 2023 18:30   
3. How to escape Tennenbaum's Theorem?
   F. N. Pakhomov
   Seminars "Proof Theory" and "Logic Online Seminar"
   November 21, 2022 18:30   
4. Reflection ranks and ordinal analysis
   F. N. Pakhomov
   Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2020
   November 25, 2020 11:15   
5. Iterated $\omega$-model reflection and $\Pi^1_2$ proof-theoretic analysis
   F. N. Pakhomov
   Seminars "Proof Theory" and "Logic Online Seminar"
   October 19, 2020 18:30   
6. Solovay’s completeness without fixed points
   F. Pakhomov
   Workshop on Proof Theory, Modal Logic and Reflection Principles
   October 20, 2017 12:50   
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. 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   
9. 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   
10. 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   
11. 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   
12. 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   
13. 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   
14. 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   
15. 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   
16. 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   
17. 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   
18. 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   
19. Decidability of the elementary theory of the free GLP-algebra generated by constants
    F. N. Pakhomov
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    March 3, 2015 18:30
20. On the decidability of elementary theories of some ordinal notation systems based on the logic GLP
    F. N. Pakhomov
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    February 24, 2015 18:30
21. On the computational complexity of the closed fragment of the provability logic GLP
    F. N. Pakhomov
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    April 9, 2013 18:30
22. On the decidability of elementary theories of provability algebras and their fragments
    F. N. Pakhomov
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    October 23, 2012 18:30
23. On a class of decidable monadic theories of graphs
    F. N. Pakhomov
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    March 20, 2012 18:30