Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Akademii Nauk SSSR, 1986, Volume 288, Number 1, Pages 11–14 (Mi dan8607)  
This article is cited in 2 scientific papers (total in 2 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
Full-text PDF (580 kB) Citations (2)
Presented: V. A. Mel'nikov
Received: 30.12.1985
Bibliographic databases:
Document Type: Article
UDC: 510.65
Language: Russian
Citation: V. A. Vardanyan, “Arithmetic complexity of provability predicate logics and their fragments”, Dokl. Akad. Nauk SSSR, 288:1 (1986), 11–14
Citation in format AMSBIB
\Bibitem{Var86}
\by V.~A.~Vardanyan
\paper Arithmetic complexity of provability predicate logics and their
fragments
\jour Dokl. Akad. Nauk SSSR
\yr 1986
\vol 288
\issue 1
\pages 11--14
\mathnet{http://mi.mathnet.ru/dan8607}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=841130}
\zmath{https://zbmath.org/?q=an:0623.03022}
Linking options:
  • https://www.mathnet.ru/eng/dan8607
  • https://www.mathnet.ru/eng/dan/v288/i1/p11
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024