RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

2003, Volume 304

| General information | Contents |


Computational complexity theory. Part VIII


Preface
Yu. V. Matiyasevich
5
Weak constructive second order arithmetic with extracting polynomial time computable algorithms
A. P. Beltiukov
7
New models of bounded induction axioms
S. Boughattas, J.-P. Ressayre
13
Formal axiomatic theories on the base of three-valued logic
I. D. Zaslavsky
19
Some algebras of recursively enumerable sets and their applications to the fuzzy logic
S. N. Manukian
75
$S_{k,\exp}$ does not prove $\mathrm{NP}=\mathrm{co}-\mathrm{NP}$ uniformly
Ch. Pollett
99
Destinies and decidability
P. Cégielski
121
EMSO-definability of some languages with event structures
K. V. Shahbazyan, Yu. G. Shoukourian
128
Diophantine undecidability for some function fields of infinite transcendence degree and positive characteristic
A. Shlapentokh
141


© Steklov Math. Inst. of RAS, 2025