Zapiski Nauchnykh Seminarov POMI
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

2003, Volume 304  
| General information | Contents |


Computational complexity theory. Part VIII


Preface
Yu. V. Matiyasevich 		5–6
Weak constructive second order arithmetic with extracting polynomial time computable algorithms
A. P. Beltiukov 		7–12
New models of bounded induction axioms
S. Boughattas, J.-P. Ressayre 		13–18
Formal axiomatic theories on the base of three-valued logic
I. D. Zaslavsky 		19–74
Some algebras of recursively enumerable sets and their applications to the fuzzy logic
S. N. Manukian 		75–98
$S_{k,\exp}$ does not prove $\mathrm{NP}=\mathrm{co}-\mathrm{NP}$ uniformly
Ch. Pollett 		99–120
Destinies and decidability
P. Cégielski 		121–127
EMSO-definability of some languages with event structures
K. V. Shahbazyan, Yu. G. Shoukourian 		128–140
Diophantine undecidability for some function fields of infinite transcendence degree and positive characteristic
A. Shlapentokh 		141–167
Записки научных семинаров ПОМИ
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025