Maslov Sergei Yur'evich

Publications in Math-Net.Ru

1. Calculuses with monotone deductions and their economic interpretation
   
   Zap. Nauchn. Sem. LOMI, 88 (1979),  90–105
2. Herbrand strategies and the “greater deducibility” relation
   
   Zap. Nauchn. Sem. LOMI, 68 (1977),  51–61
3. Absorption relation on regular sets
   
   Zap. Nauchn. Sem. LOMI, 60 (1976),  65–74
4. The mutation-calculuses
   
   Zap. Nauchn. Sem. LOMI, 49 (1975),  7–30
5. On cut-type rules for calculuses of general type
   
   Zap. Nauchn. Sem. LOMI, 40 (1974),  63–76
6. Decidable classes that reduce to a single quantifier class
   
   Trudy Mat. Inst. Steklov., 121 (1972),  57–66
7. The inverse method, and tactics for establishing deducibility for a calculus with functional symbols
   
   Trudy Mat. Inst. Steklov., 121 (1972),  14–56
8. Probabilistic canonical systems
   
   Zap. Nauchn. Sem. LOMI, 32 (1972),  66–76
9. Deduction search in calculi of general type
   
   Zap. Nauchn. Sem. LOMI, 32 (1972),  59–65
10. An extension of the inverse method to the predicate calculus with equality
    
    Zap. Nauchn. Sem. LOMI, 20 (1971),  80–96
11. A connection between tactics of the inverse method and the resolution method
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  137–146
12. Deduction search tactics based on a specialization of the order of members in favourable sets
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  126–136
13. A computer algorithm for establishing deducibility, based on the inverse method
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  8–19
14. The inverse method for establishing deducibility for logical calculi
    
    Trudy Mat. Inst. Steklov., 98 (1968),  26–87
15. Inverse method of establishing deducibility for non-prenex formulas of predicate calculus
    
    Dokl. Akad. Nauk SSSR, 172:1 (1967),  22–25
16. The representation of recursively enumerable sets by local calculi
    
    Trudy Mat. Inst. Steklov., 93 (1967),  43–49
17. The concept of strict representability in the general theory of calculi
    
    Trudy Mat. Inst. Steklov., 93 (1967),  3–42
18. Invertible sequential variant of intuitibnistic predicate calculus
    
    Zap. Nauchn. Sem. LOMI, 4 (1967),  96–111
19. Application of the inverse method for establishing deducibility to the theory of decidable fragments in the classical predicate calculus
    
    Dokl. Akad. Nauk SSSR, 171:6 (1966),  1282–1285
20. Insolvability in the constructive calculus of predicates of certain classes of formulae containing only one-place predicate variables
    
    Dokl. Akad. Nauk SSSR, 163:2 (1965),  295–297
21. An inverse method of establishing deducibility in the classical predicate calculus
    
    Dokl. Akad. Nauk SSSR, 159:1 (1964),  17–20
22. On E. L. Post's “tag problem”
    
    Trudy Mat. Inst. Steklov., 72 (1964),  57–68
23. Certain properties of E. L. Post's apparatus of canonical calculi
    
    Trudy Mat. Inst. Steklov., 72 (1964),  5–56
24. On certain methods of prescribing sets in generating bases
    
    Dokl. Akad. Nauk SSSR, 153:2 (1963),  266–269
25. On strict representability of sets by calculi
    
    Dokl. Akad. Nauk SSSR, 152:2 (1963),  272–274
26. Transformation of arbitrary canonical calculi into canonical calculi of special types
    
    Dokl. Akad. Nauk SSSR, 147:4 (1962),  779–782


27. Nikolai Aleksandrovich Shanin (on his sixtieth birthday)
    
    Uspekhi Mat. Nauk, 35:2(212) (1980),  241–245