Seminars
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Calendar
Search
Add a seminar

RSS
Forthcoming seminars




L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus
April 7, 2020, Steklov Mathematical Institute, room 530, 8 Gubkina St., Moscow, online
 


Лекция 17. Примитивно рекурсивная арифметика

L. D. Beklemishev
Video records:
MP4 1,993.0 Mb

Number of views:
This page:321
Video files:72
Youtube:

L. D. Beklemishev




References
  1. A. Troelstra, D. van Dalen, Constructivism in Mathematics, Vol 1, Ch. 3, Section 2, 1988, 120 (PRA na baze beskvantornoi (propozitsionalnoi) logiki, blizko k lektsii)
  2. C. Smoryński, Modal Logic and Self-Reference, 1985 (PRA na baze logiki pervogo poryadka. (Smorinskii dopuskaet skhemu induktsii dlya $\Sigma_1$-formul, otozhdestvlyaya PRA i I $\Sigma_1$, no osnovnoe razvitie prokhodit i dlya beskvantornoi skhemy induktsii))  crossref
  3. R. L. Goodstein, “Logic-free formalizations of recursive arithmetic”, Math. Scandinavica, 1954, no. 2, 247–261 (Ekvatsionalnaya formulirovka PRA i (fakticheski) interpretatsiya v nei beskvantornoi PRA)
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024