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

1971, Volume 20

| General information | Contents |


Studies in constructive mathematics and mathematical logic. Part IV


Editors' preface
Yu. V. Matiyasevich, A. O. Slisenko
7
On a class of realizable propositional formulas
F. L. Varpakhovskii
8
A synthesis of the resolution method and the inverse method
G. V. Davydov
24
Yet another constructive version of Cauchy theorem
I. D. Zaslavsky, G. S. Tseitin
36
On realizations of predicate formulas
M. M. Kipnis
40
On Diophantine representations of the sequence of solutions of Pell's equation
N. K. Kossovski
49
On algorithmical sequences belonging to the initial class of Grzegorczyk hierarchy
N. K. Kossovski
60
On investigation of constructive functions by the fillings method
V. A. Lifshits
67
An extension of the inverse method to the predicate calculus with equality
S. Yu. Maslov
80
A sufficient condition for the recursive convergence of a monotone sequence
Yu. V. Matiyasevich
97
On real-time recognition of the relation of occurrence
Yu. V. Matiyasevich
104
Quantifier-free and one-quantifier systems
G. E. Mints
115
Exact estimates for provability of the rule of transfinite induction in initial parts of arithmetic
G. E. Mints
134
The equivalence of the two definitions of recursive continuity
V. P. Orevkov
145
On the continuity of constructive functionals
V. P. Orevkov
160
On biconjunctive reduction classes
V. P. Orevkov
170
On a specialization of processing of axions in proof procedures for axiomatic theories with equality
A. Y. Plushkevichene
175
On elimination of cut-type rules from Robinson and Presburger axiomatic systems
A. Y. Plushkevichene
186
A property of recursively enumerable sets containing “hardly deducible” formulas
A. O. Slisenko
200
On some weakening of intuitionistic logic
Yu. N. Tolstova
208
Regular approximations to the recursive predicates
R. I. Freidson
220
A reduced form of normal algorithms and a linear speed-up theorem
G. S. Tseitin
234
The lower estimate of number of steps for reversing normal algorithms and other similar algorithms
G. S. Tseitin
243
A pseudo-rundamental sequence not equivalent to any monotone sequence
G. S. Tseitin
263
Some aspects of graphic regularity
A. I. Shklovskii
272


© Steklov Math. Inst. of RAS, 2024