Kossovski Nikolai Kirillovich

Publications in Math-Net.Ru

1. Polynomial upper bounds of RAM+BOOL program size of changes for the proof of belonging to FP
   
   Zap. Nauchn. Sem. POMI, 407 (2012),  105–110
2. Gradable logical values for knowlege representation
   
   Zap. Nauchn. Sem. POMI, 241 (1997),  135–149
3. Level logics
   
   Zap. Nauchn. Sem. POMI, 220 (1995),  72–82
4. On decision procedures for invariant properties of short algorithms
   
   Zap. Nauchn. Sem. LOMI, 88 (1979),  73–77
5. On constructive distribution functions
   
   Zap. Nauchn. Sem. LOMI, 60 (1976),  59–64
6. On the expressive power of the operations of bounded summation and bounded multiplication
   
   Zap. Nauchn. Sem. LOMI, 49 (1975),  3–6
7. On solutions of systems consisting both of word equationa and of word length inequalities
   
   Zap. Nauchn. Sem. LOMI, 40 (1974),  24–29
8. Constructive variants of the laws of large numbers
   
   Trudy Mat. Inst. Steklov., 129 (1973),  3–23
9. On recognizing invariant properties of algorithms
   
   Zap. Nauchn. Sem. LOMI, 32 (1972),  29–34
10. Some properties of solutions of equations in a free semigroup
    
    Zap. Nauchn. Sem. LOMI, 32 (1972),  21–28
11. On algorithmical sequences belonging to the initial class of Grzegorczyk hierarchy
    
    Zap. Nauchn. Sem. LOMI, 20 (1971),  60–66
12. On Diophantine representations of the sequence of solutions of Pell's equation
    
    Zap. Nauchn. Sem. LOMI, 20 (1971),  49–59
13. Certain questions of the constructive theory of normed Boolean algebras
    
    Trudy Mat. Inst. Steklov., 113 (1970),  3–38
14. The laws of large numbers in constructive probability theory
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  105–113
15. Intergrable $FR$-constructs over a probability space
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  97–104
16. Nesessary and sufficient conditions for a probability space to have Specker properties
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  91–96
17. A construction of basic operators of the combination theory of $K$-algorithms, using operators of a simple kind
    
    Zap. Nauchn. Sem. LOMI, 8 (1968),  80–94
18. On a system of operators, simplifying the combination theory of $K$-algorithms
    
    Zap. Nauchn. Sem. LOMI, 8 (1968),  66–79
19. Sufficient conditions for incompleteness of formalized parts of arithmetic
    
    Zap. Nauchn. Sem. LOMI, 4 (1967),  44–57


20. Nikolai Aleksandrovich Shanin (obituary)
    
    Uspekhi Mat. Nauk, 68:4(412) (2013),  173–176