"Zapiski Nauchnyh Seminarov POMI"
VOL. 241
This issue is entitled "Studies in Constructive Mathematics and
Mathematical Logic. Part X"
editors E. Ya. Dantsin and V. P. Orevkov
This volume contains articles on complexity of algorithms
and complexity of proofs. Themes of papers concern diophantine
representations for sets, probabilistic verifications
of proofs and upper bounds for problem of satisfiability.
Contents

Vsemirnov M. A. Diophantine representations of linear recurrent
sequences. II........ 5
(.ps.gz)

Hirsch E. A. Separating sings in the propositional satisfiability
problem ....... 30
(.ps.gz)

Davydov G. V., Davydova I. M.
Number representations of satisfiability
....... 72
(.ps.gz)

Dantsin E. Ya. Probabilistic verification of proofs in
calculuses ....... 97
(.ps.gz)

Konev B. Yu. Refinement of bounds of the heights of terms in the
most general unifer ....... 117
(.ps.gz)

Kossovski N. K., Tishkov A. V. Gradable logical values for knowlege
representation ....... 135
(.ps.gz)

Reviews ....... 150
(.ps.gz)
Paging: 152 pp.

Language: Russian
Back to the Petersburg Department of
Steklov Institute of Mathematics