Zap. Nauchn. Sem. LOMI, 1967, Volume 4

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

1967, Volume 4

General information

Contents

Studies in constructive mathematics and mathematical logic. Part I

	Preface A. O. Slisenko		7
	A proof method for the classical predicate calculus G. V. Davydov		8–17
	On correction of unprovable formulae G. V. Davydov		18–29
	Lebesgue integral in constructive analysis O. Demuth		30–43
	Sufficient conditions for incompleteness of formalized parts of arithmetic N. K. Kossovski		44–57
	The normal form for deductions in the predicate calculus with equality and functional symbols V. A. Lifshits		58–64
	Some reduction classes and undecidable theories V. A. Lifshits		65–68
	Deductive validity and reduction classes V. A. Lifshits		69–77
	The decision problem for some constructive theories of equality V. A. Lifshits		78–85
	On constructive groups V. A. Lifshits		86–95
	Invertible sequential variant of intuitibnistic predicate calculus S. Yu. Maslov		96–111
	Choice of terms in quantifier rules of the intuitionistic pridicate calculus G. E. Mints		112–122
	Analog of the Herbrand's theorem for the intuitionistic predicate calculus G. E. Mints		123–133
	Varying of proof search tactics in sequenzen-calculi G. E. Mints		134–151
	Embedding operations related to the S. Kripke's "semantics" G. E. Mints		152–159
	On embedding operations G. E. Mints, V. P. Orevkov		160–167
	Unsolvability in the modal predicate calculus of the class of formulas containing only one monadic predicate variable V. P. Orevkov		168–173
	A sequential calculus of the constructive logic for the normal formulae without structural rules of inference R. A. Plyushkevitchus		174–188
	On sequential variants of applied predicate calculi M. G. Rogava		189–200
	On maximal regulators of continuity for constructive functions A. O. Slisenko		201–208
	Representation of recursive predicates by Rabin's machines R. I. Freidson		209–218

Registration to the website

Logotypes