Zap. Nauchn. Sem. LOMI, 1969, Volume 16

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

1969, Volume 16

General information

Contents

Studies in constructive mathematics and mathematical logic. Part III

	Nikolai Aleksandrovich Shanin (photo)
	From the authors	7
	A computer algorithm for establishing deducibility, based on the inverse method G. V. Davydov, S. Yu. Maslov, G. E. Mints, V. P. Orevkov, A. O. Slisenko	8–19
	On constructive pseudofunctions M. G. Gelfond	20–27
	Nets of marks and deducibility in intuitionistic propositional calculus Ya. Ya. Golota	28–43
	Some ways simplifying the constructing of the nets of marks Ya. Ya. Golota	44–53
	On a class of strategies for the resolution method N. K. Zamov, V. I. Sharonov	54–64
	On Shannon's pseudofunctions I. D. Zaslavsky	65–76
	On estimations of the complexity of bounded halting problem M. I. Kanovitch	77–80
	On an estimation of the complexity of some algorithmic problems of analysis M. I. Kanovitch, B. A. Kushner	81–90
	Nesessary and sufficient conditions for a probability space to have Specker properties N. K. Kossovski	91–96
	Intergrable $FR$-constructs over a probability space N. K. Kossovski	97–104
	The laws of large numbers in constructive probability theory N. K. Kossovski	105–113
	On the set of zeroes of constructive power series in a real variable V. A. Lifshits	114–125
	Deduction search tactics based on a specialization of the order of members in favourable sets S. Yu. Maslov	126–136
	A connection between tactics of the inverse method and the resolution method S. Yu. Maslov	137–146
	On semantics of modal logic G. E. Mints	147–151
	On non-lengthening applications of equality rules V. P. Orevkov	152–156
	Some properties of homeomorphisms of constructive metric spaces V. P. Orevkov	157–164
	Two theorems on the complexity of algorithms and computations N. V. Petri	165–174
	Elimination of cut-type rules in axiomatic systems with equality A. Y. Plushkevichene	175–184

Correction
	Corrections to the volume “Studies in constructive mathematics and mathematical logic. II”. 1968	185–187

Registration to the website

Logotypes