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
1976, Volume 60
|
General information
|
Contents
|
Forward links
|
Studies in constructive mathematics and mathematical logic. Part VII
An iterative description of the class
$\varepsilon^1$
of Grzegorczyk's hierarchy
A. P. Beltiukov
3–14
Decidability of the universal theory of natural numbers with addition and divisibility
A. P. Beltiukov
15–28
Kolmogoroff algorithms are stronger than turing machines
D. Yu. Grigor'ev
29–37
Application of separability and independence notions for proving lower bounds of circuit complexity
D. Yu. Grigor'ev
38–48
On an approximative version of the notion of constructive analytic function
E. Ya. Dantsin
49–58
On constructive distribution functions
N. K. Kossovski
59–64
Absorption relation on regular sets
S. Yu. Maslov
65–74
A new proof of the theorem on exponential diophantine representation of enumerable sets
Yu. V. Matiyasevich
75–92
What can be done with PRA?
G. E. Mints
93–102
On the approximation of reduction classes of RPC by decidable classes
S. A. Norgela
103–108
Solvable classes of pseudoprenex formulas
V. P. Orevkov
109–170
Approximability of operators in constructive metric spaces
S. V. Pakhomov
171–182
Hierarchies of operators in constructive metric spaces
S. V. Pakhomov
183–193
Continuity of operators in separable constructive metric spaces
S. V. Pakhomov
194–196
On the recognition of the tautological nature of propositional formulas
P. Yu. Suvorov
197–206
Example of a constructive separable space with an inseparable completion
V. P. Chernov
207–208
On the quantifier of limiting realizability
N. A. Shanin
209–220
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2024