## "Zapiski Nauchnyh Seminarov POMI"

VOL. ** 304**
This issue is entitled **"Computational complexity theory. Part VIII"**
editor ** Yu.V.Matiyasevich **

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

** Paging: 171 pp.
**-
** Language: Russian
**

**Back to the Petersburg Department of
Steklov Institute of Mathematics
**