×

zbMATH — the first resource for mathematics

Nepeĭvoda, Nikolaĭ Nikolaevich

Compute Distance To:
Author ID: nepeivoda.nikolay-n Recent zbMATH articles by "Nepeĭvoda, Nikolaĭ Nikolaevich"
Published as: Nepejvoda, N. N.; Nepeivoda, N. N.; Nepeĭvoda, N. N.; Nepeĭvoda, Nikolaĭ Nikolaevich; Nepejvoda, Nikolai Nikolaevich; Nepeivoda, Nikolay N.; Nepejvoda, Nikolai
External Links: MGP · Math-Net.Ru · Wikidata · dblp
Documents Indexed: 53 Publications since 1971, including 2 Books
Biographic References: 1 Publication

Publications by Year

Citations contained in zbMATH Open

9 Publications have been cited 14 times in 9 Documents Cited by Year
A relation between the natural deduction rules and operators of higher level algorithmic languages. Zbl 0392.68004
Nepeivoda, N. N.
4
1978
A new concept of predicative truth and definability. Zbl 0274.02011
Nepeivoda, N. N.
2
1973
Logic and computer. Modelling of reasonings and control of the correctness of programs. (Logika i komp’yuter. Modelirovanie rassuzhdenij i proverka pravil’nosti programm.) Zbl 0713.68050
Aleshina, N. A.; Anisov, A. M.; Bystrov, P. I.; Gerasimova, I. A.; Mes’kov, V. S.; Nepejvoda, N. N.; Smirnov, V. A.; Stebletsova, V. N.; Shalak, V. I.
2
1990
The unexpectedness rule and the structural go to. Zbl 0562.03030
Nepejvoda, N. N.
1
1984
The language \(\Delta\) with intuitionistic connectives. Zbl 0322.02034
Nepeivoda, N. N.
1
1975
Logical approach to programming. Zbl 0516.68035
Nepeivoda, N. N.
1
1982
Logical and algorithmic formalisms for the problem of correct program design. Zbl 0977.68010
Nepejvoda, N. N.
1
1999
The relationship between predicative significance and the intuition of universality. Zbl 0336.02029
Nepeivoda, N. N.
1
1973
Deductions in the form of graphs. Zbl 0621.03037
Nepejvoda, N. N.
1
1985
Logical and algorithmic formalisms for the problem of correct program design. Zbl 0977.68010
Nepejvoda, N. N.
1
1999
Logic and computer. Modelling of reasonings and control of the correctness of programs. (Logika i komp’yuter. Modelirovanie rassuzhdenij i proverka pravil’nosti programm.) Zbl 0713.68050
Aleshina, N. A.; Anisov, A. M.; Bystrov, P. I.; Gerasimova, I. A.; Mes’kov, V. S.; Nepejvoda, N. N.; Smirnov, V. A.; Stebletsova, V. N.; Shalak, V. I.
2
1990
Deductions in the form of graphs. Zbl 0621.03037
Nepejvoda, N. N.
1
1985
The unexpectedness rule and the structural go to. Zbl 0562.03030
Nepejvoda, N. N.
1
1984
Logical approach to programming. Zbl 0516.68035
Nepeivoda, N. N.
1
1982
A relation between the natural deduction rules and operators of higher level algorithmic languages. Zbl 0392.68004
Nepeivoda, N. N.
4
1978
The language \(\Delta\) with intuitionistic connectives. Zbl 0322.02034
Nepeivoda, N. N.
1
1975
A new concept of predicative truth and definability. Zbl 0274.02011
Nepeivoda, N. N.
2
1973
The relationship between predicative significance and the intuition of universality. Zbl 0336.02029
Nepeivoda, N. N.
1
1973

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.