RUS  ENG
Full version
SEMINARS

"Algorithmic problems in algebra and logic" (S.I.Adian seminar)
April 9, 2013 18:30, Moscow, Steklov Mathematical Institute


On the computational complexity of the closed fragment of the provability logic GLP

F. N. Pakhomov


© Steklov Math. Inst. of RAS, 2024