Zapiski Nauchnykh Seminarov LOMI
RUS
ENG
JOURNALS
PEOPLE
ORGANISATIONS
CONFERENCES
SEMINARS
VIDEO LIBRARY
PACKAGE AMSBIB
JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
General information
Latest issue
Archive
Impact factor
Search papers
Search references
RSS
Latest issue
Current issues
Archive issues
What is RSS
Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find
Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register
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–23
A synthesis of the resolution method and the inverse method
G. V. Davydov
24–35
Yet another constructive version of Cauchy theorem
I. D. Zaslavsky, G. S. Tseitin
36–39
On realizations of predicate formulas
M. M. Kipnis
40–48
On Diophantine representations of the sequence of solutions of Pell's equation
N. K. Kossovski
49–59
On algorithmical sequences belonging to the initial class of Grzegorczyk hierarchy
N. K. Kossovski
60–66
On investigation of constructive functions by the fillings method
V. A. Lifshits
67–79
An extension of the inverse method to the predicate calculus with equality
S. Yu. Maslov
80–96
A sufficient condition for the recursive convergence of a monotone sequence
Yu. V. Matiyasevich
97–103
On real-time recognition of the relation of occurrence
Yu. V. Matiyasevich
104–114
Quantifier-free and one-quantifier systems
G. E. Mints
115–133
Exact estimates for provability of the rule of transfinite induction in initial parts of arithmetic
G. E. Mints
134–144
The equivalence of the two definitions of recursive continuity
V. P. Orevkov
145–159
On the continuity of constructive functionals
V. P. Orevkov
160–169
On biconjunctive reduction classes
V. P. Orevkov
170–174
On a specialization of processing of axions in proof procedures for axiomatic theories with equality
A. Y. Plushkevichene
175–185
On elimination of cut-type rules from Robinson and Presburger axiomatic systems
A. Y. Plushkevichene
186–199
A property of recursively enumerable sets containing “hardly deducible” formulas
A. O. Slisenko
200–207
On some weakening of intuitionistic logic
Yu. N. Tolstova
208–219
Regular approximations to the recursive predicates
R. I. Freidson
220–233
A reduced form of normal algorithms and a linear speed-up theorem
G. S. Tseitin
234–242
The lower estimate of number of steps for reversing normal algorithms and other similar algorithms
G. S. Tseitin
243–262
A pseudo-rundamental sequence not equivalent to any monotone sequence
G. S. Tseitin
263–271
Some aspects of graphic regularity
A. I. Shklovskii
272–281
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2025