RUS  ENG
Full version
JOURNALS // Doklady Akademii Nauk // Archive

Dokl. Akad. Nauk SSSR, 1986 Volume 288, Number 1, Pages 11–14 (Mi dan8607)

This article is cited in 3 papers

MATHEMATICS

Arithmetic complexity of provability predicate logics and their fragments

V. A. Vardanyan

Science Counsil on Complex Problem 'Cybernetics', USSR Academy of Sciences, Moscow

UDC: 510.65

Presented: V. A. Mel'nikov
Received: 30.12.1985



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026