Geodesic

Computational complexity theory. Part VIII

Sommaire

Preface
p. 5-6
Weak constructive second order arithmetic with extracting polynomial time computable algorithms
p. 7-12
New models of bounded induction axioms
p. 13-18
Formal axiomatic theories on the base of three-valued logic
p. 19-74
Some algebras of recursively enumerable sets and their applications to the fuzzy logic
p. 75-98
$S_{k,\exp}$ does not prove $\mathrm{NP}=\mathrm{co}-\mathrm{NP}$ uniformly
p. 99-120
Destinies and decidability
p. 121-127
EMSO-definability of some languages with event structures
p. 128-140
Diophantine undecidability for some function fields of infinite transcendence degree and positive characteristic
p. 141-167