Zapiski Nauchnykh Seminarov LOMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov LOMI, 1968, Volume 8, Pages 234–259 (Mi znsl2268)  
This article is cited in 25 scientific papers (total in 26 papers)

On the complexity of proof in prepositional calculus

G. S. Tseitin
Full-text PDF (1060 kB) Citations (26)
Bibliographic databases:
Language: Russian
Citation: G. S. Tseitin, “On the complexity of proof in prepositional calculus”, Studies in constructive mathematics and mathematical logic. Part II, Zap. Nauchn. Sem. LOMI, 8, "Nauka", Leningrad. Otdel., Leningrad, 1968, 234–259
Citation in format AMSBIB
\Bibitem{Tse68}
\by G.~S.~Tseitin
\paper On the complexity of proof in prepositional calculus
\inbook Studies in constructive mathematics and mathematical logic. Part~II
\serial Zap. Nauchn. Sem. LOMI
\yr 1968
\vol 8
\pages 234--259
\publ "Nauka", Leningrad. Otdel.
\publaddr Leningrad
\mathnet{http://mi.mathnet.ru/znsl2268}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=280378}
\zmath{https://zbmath.org/?q=an:0205.00402|0197.00102}
Linking options:
  • https://www.mathnet.ru/eng/znsl2268
  • https://www.mathnet.ru/eng/znsl/v8/p234
    • This publication is cited in the following 26 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:1243
    Full-text PDF :574
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024